Submission #8356530

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main(){
    int N;
    while(cin >> N){
        vector<pair<int,int>> A, B;
        for(int i=0;i<N;i++){
            int t; cin >> t;
            A.emplace_back(t, i);
        }
        for(int i=0;i<N;i++){
            int t; cin >> t;
            B.emplace_back(t, i);
        }
        sort(A.begin(), A.end());
        sort(B.begin(), B.end());
        vector<int> next(N);
        bool ok = true;
        bool chk = true;
        for(int i=N-1;i>=0;i--){
            if(A[i].first > B[i].first) ok = false;
            else if(i-1 >= 0 && A[i].first <= B[i-1].first) chk = false;
            next[A[i].second] = B[i].second;
        }
        if(chk){
            int size = 0;
            vector<int> visit(N, 0);
            int s = 0;
            while(!visit[s]){
                visit[s] = 1;
                ++size;
                s = next[s];
            }
            if(size == N) ok = false;            
        }
        cout << (ok ? "Yes" : "No") << endl;
    }
}

Submission Info

Judge Result