Submission #1057474

#	Time	Username	Problem	Language	Result	Execution time	Memory
1057474		beaconmc	Gift Exchange (JOI24_ho_t4)	C++14	0 / 100	0 ms	348 KiB

Main

#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;
		ll maxi = 0;
		FOR(j,1,n){
			maxi = max(maxi, vals[j]);
			if (req[j] != 2*n-1){
				cout << "Yes";
				flag = 1;
				break;
			}
		}
		if (!flag){
			if (vals[0] == 2*n-2 && maxi == 2*n-2)cout << "No";
			else cout << "Yes";
		} 

	}




}

• 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