제출 #1057479

#제출 시각아이디문제언어결과실행 시간메모리
1057479beaconmcGift Exchange (JOI24_ho_t4)C++14
10 / 100
11 ms3176 KiB
#include <bits/stdc++.h>
 
typedef long long ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)
 
using namespace std;


int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	ll n;
	cin >> n;
	vector<ll> vals(n), req(n);
	FOR(i,0,n) cin >> vals[i];
	FOR(i,0,n) cin >> req[i];
	ll q;
	cin >> q;
	FOR(i,0,q){
		ll a,b;
		cin >> a >> b;
		a--;b--;
		bool flag = false;

		FOR(j,1,n){

			if (req[j] == 2*n-1){
				cout << "No";
				flag = 1;
				break;
			}
		}
		if (!flag){
			cout<<"Yes";
		} 

	}




}
#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...