Submission #1265532

#	Time	Username	Problem	Language	Result	Execution time	Memory
1265532		Robert_junior	Gift Exchange (JOI24_ho_t4)	C++20	0 / 100	0 ms	328 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back  
#define all(x) x.begin(), x.end()
#define ins insert
#define F first
#define S second
const int N = 5e5 + 7, mod = 998244353;
int a[N], b[N];
void solve(){
	int n, q;
	cin>>n;
	for(int i = 1; i <= n; i++){
		cin>>a[i];
	}
	for(int i = 1; i <= n; i++){
		cin>>b[i];
	}
	cin>>q;
	while(q--){
		int l, r;
		cin>>l>>r;
		set<int>s;
		for(int i = l; i <= r; i++){
			s.ins(a[i]);
		}
		string ans = "Yes\n";
		for(int i = l; i <= r; i++){
			auto it = s.lower_bound(b[i]);
			if(it == s.end()){
				ans = "No\n";
			}
			else if(*it == a[i]){
				if(*it == *s.rbegin()){
					ans = "No\n";
				}
				else{
					it++;
					s.erase(it);
				}
			}
			else{
				s.erase(it);
			}
		}
		cout<<ans;
	}
}
signed main(){
	ios_base :: sync_with_stdio(false);
	cin.tie(0);
    //freopen("area.in", "r", stdin);
    //freopen("area.out", "w", stdout);
    int t = 1;
    //cin>>t;
    while(t--){
        solve();
    }
}

• 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