Submission #1343563

#	Time	Username	Problem	Language	Result	Execution time	Memory
1343563		vtnoo	Gift Exchange (JOI24_ho_t4)	C++20	0 / 100	2593 ms	2564 KiB

Main

#include <bits/stdc++.h>
#define L(i,j,k) for(int i=(j);i<=(k);i++)
#define R(i,j,k) for(int i=(j);i>=(k);i--)
#define all(x) x.begin(),x.end()
#define sz(a) ((int)a.size())
#define pb push_back
using namespace std;
typedef long long ll; 

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
	int n;cin>>n;
    vector<int>a(n),b(n);
    L(i,0,n-1)cin>>a[i];
    L(i,0,n-1)cin>>b[i];
    int q;cin>>q;
    while(q--){
        int l,r;cin>>l>>r;l--,r--;
        vector<pair<int,int>>v;
        L(i,l,r){
            v.pb({b[i],a[i]});
        }    
        sort(all(v));
        int m=sz(v);
        bool possible=true;
        int cycle=1;
        L(i,0,m-1){
            if(i<m-1&&v[i].second>=v[i+1].first){
                cycle++;
            }else{
                if(cycle==1){
                    possible=false;
                    break; 
                }
                cycle=1;
            }
            // cout<<i<<" "<<cycle<<endl;
        }
        if(possible){
            cout<<"Yes"<<endl;
        }else{
            cout<<"No"<<endl;
        }
    }
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 5
• Subtask 3: 0 / 10
• Subtask 4: 0 / 31
• Subtask 5: 0 / 8
• Subtask 6: 0 / 12
• Subtask 7: 0 / 18
• Subtask 8: 0 / 12