제출 #1188755

#제출 시각아이디문제언어결과실행 시간메모리
1188755mertbbmGift Exchange (JOI24_ho_t4)C++20
50 / 100
2596 ms5624 KiB
#include <bits/stdc++.h>
using namespace std;

#define int long long 
#define ld long double
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << "  " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << "  " << j << " " << #i << "  " << q << " " << #p << endl;
#define show4(x,y) for(auto it:y) cout << it << " "; cout << #x << endl;
typedef pair<int,int>pii;
typedef pair<int,pii>pi2;
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());

void solve(){
	int n;
	cin >> n;
	pii arr[n];
	for(int x=0;x<n;x++) cin >> arr[x].second;
	for(int x=0;x<n;x++) cin >> arr[x].first;
	
	int q;
	int l,r;
	cin >> q;
	for(int x=0;x<q;x++){
		cin >> l >> r;
		l--; r--;
		vector<pii>v;
		for(int y=l;y<=r;y++){
			v.push_back(arr[y]);
		}
		
		sort(v.begin(),v.end());
		
		bool amos=true;
		int cur=-1;
		int sz=2;
		//show(x,x);
		for(auto it:v){
			//show2(it.first,it.first,it.second,it.second);
			if(it.first>cur){
				if(sz==1) amos=false;
				sz=1;
				cur=it.second;
			}
			else{
				cur=max(cur,it.second);
				sz++;
			}
		}
		if(sz==1) amos=false;
		
		if(amos) cout << "Yes\n";
		else cout << "No\n";
	}
}	
																   
int32_t main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	//freopen("in.txt","r",stdin);
	//freopen("out.txt","w",stdout);
	int t=1;
	//cin >> t;
	while(t--){
		solve();
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...