제출 #1124727

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1124727		peacebringer1667	Gift Exchange (JOI24_ho_t4)	C++17	10 / 100	36 ms	2244 KiB

Main

#include<bits/stdc++.h>
#define ll long long
#define ldb long double
#define db double
#define fi first
#define se second
#define sza(a) (int)a.size()
#define pir pair<int,int>
#define pirll pair<ll,ll>
using namespace std;
const int maxn = 1e5 + 5;

template <class t1,class t2> inline void maxi(t1 &x,t2 y){if (x < y) x = y;}
template <class t1,class t2> inline void mini(t1 &x,t2 y){if (x > y) x = y;}

int a[maxn],b[maxn];
pir Q[maxn];

void input(int &n,int &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;
	for (int i = 1 ; i <= q ; i++) cin >> Q[i].fi >> Q[i].se;
}

bool possible(int l,int r){
	vector <pir> lst;
	for (int i = l ; i <= r ; i++) lst.push_back({a[i],b[i]});
	
	sort(lst.begin(),lst.end());
	int M = lst[0].se;
	
	for (pir x : lst)
	   if (M >= x.se)
	      maxi(M,x.fi);
	
	return (M >= lst.back().se);
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	
	int n,q;
	input(n,q);
	
	assert(n * q <= 10000000);
	
	//subtask1
	for (int i = 1 ; i <= q ; i++){
		cout << ((possible(Q[i].fi,Q[i].se) ? "Yes" : "No")) << "\n";
	}
	return 0;
}

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