oj.uz

Submission #514921

# Submission time Handle Problem Language Result Execution time Memory
514921 2022-01-18T19:43:53 Z Abrar_Al_Samit Remittance (JOI19_remittance) C++17
0 / 100
 1 ms 204 KB 
#include<bits/stdc++.h>
using namespace std;

void PlayGround() {
	int n;
	cin >> n;
	long long a[n], b[n];
	for(int i=0; i<n; ++i) {
		cin >> a[i] >> b[i];
	}
	for(int st=0; st<n; ++st) {
		long long have[n];
		for(int i=0; i<n; ++i) {
			have[i] = a[i];
		}
		int v = st;
		while(1) {
			long long can = max(0LL, have[v]-b[v]);
			if(can&1) --can;
			if(can==0) break;
			have[v] -= can;
			can /= 2;
			have[(v+1)%n] += can;
			v = (v+1)%n;
		}
		bool ok = 1;
		for(int i=0; i<n; ++i) {
			ok &= have[i]==b[i];
		}
		if(ok) {
			cout << "YES\n";
			return;
		}
	}
	cout << "NO\n";

	//O(N^2logN)

	// cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
}
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	PlayGround();
	return 0;
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -