Submission #1284421

#TimeUsernameProblemLanguageResultExecution timeMemory
1284421am_aadvikRemittance (JOI19_remittance)C++20
0 / 100
1 ms580 KiB
#include <iostream>
#include<vector>
#define int long long
using namespace std;

void p(int x, int n, vector<int> a, vector<int> b) {
	a[n - 1] -= 2 * x, a[0] += x;
	for (int i = n - 2; i >= 0; --i) a[i] -= (2 * (b[i + 1] - a[i + 1]));
	for (int i = 0; i < n; ++i) if (a[i] > b[i]) return;
	if (a[0] == b[0]) { cout << "Yes"; exit(0); }
}
int32_t main() {
	ios_base::sync_with_stdio(false); cin.tie(NULL);
	int n; cin >> n;
	vector<int> a(n), b(n);
	for (int i = 0; i < n; ++i)
		cin >> a[i] >> b[i];
	for (int x = 0; x < 100; ++x) p(x, n, a, b);
	cout << "No";
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...