제출 #1186551

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1186551		asli_bg	Gift Exchange (JOI24_ho_t4)	C++20	50 / 100	2592 ms	11300 KiB

Main

#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;

#define int long long

typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<bool> vb;

typedef tree<pii,null_type,less<pii>,rb_tree_tag,
tree_order_statistics_node_update> oset;

#define fi first
#define se second
#define pb push_back
#define pf push_front

#define mid (l+r)/2
#define all(x) x.begin(),x.end()
#define FOR(i,a) for(int i=0;i<(a);i++)
#define FORE(i,a,b) for(int i=(a);i<(b);i++)

#define cont(x) for(auto el:x) cout<<el<<' ';cout<<endl;
#define contp(x) for(auto el:x) cout<<el.fi<<'-'<<el.se<<' ';cout<<endl;
#define sp <<" "<<

#define DEBUG(x) cout<<(#x) sp x<<endl
#define carp(a,b) (((a%MOD)*(b%MOD))%MOD)
#define topla(a,b) (((a%MOD)+(b%MOD))%MOD)

const int INF=1e18;
const int MAXN=2e5+5;
const int MOD=998244353;

int n;
vi a,b;

bool mm(pii a,pii b){
    return a.se<b.se;
}

signed main(){

    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    cin>>n;
    a.resize(n+1);
    b.resize(n+1);
    FORE(i,1,n+1) cin>>a[i];
    FORE(i,1,n+1) cin>>b[i];

    //build();

    int q;
    cin>>q;
    while(q--){
        int l,r;
        cin>>l>>r;

        vii vec;
        set<pii> cur;
        FORE(i,l,r+1){
            vec.pb({a[i],i});
            cur.insert({a[i],i});
        }
        
        sort(all(vec));
        reverse(all(vec));

        //contp(vec);
        //contp(cur);

        bool f=true;
        int tut=-1;
        FOR(i,vec.size()){
            int ind=vec[i].se;
            pii p={a[ind],ind};
            if(cur.count(p)){
                tut=i;
                cur.erase(p);
            }

            if(cur.empty()){
                f=false;
                break;
            }

            auto it=cur.lower_bound({b[ind],0});
            if(it==cur.end()){
                f=false;
                break;
            }
            
            cur.erase(*it);

            if(tut!=-1){
                cur.insert(p);
                tut=-1;
            }
        }

        if(f) cout<<"Yes"<<endl;
        else cout<<"No"<<endl;
    }
}

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