Submission #254727

#	Time	Username	Problem	Language	Result	Execution time	Memory
254727		dolphingarlic	Remittance (JOI19_remittance)	C++14	100 / 100	374 ms	16016 KiB

remittance

#include <bits/stdc++.h>
using namespace std;

long long a[1000000], b[1000000];

int main() {
	int n;
	scanf("%d", &n);
	for (int i = 0; i < n; i++) scanf("%lld %lld", a + i, b + i);
	if (!accumulate(b, b + n, 0)) return puts(accumulate(a, a + n, 0) ? "No" : "Yes"), 0;
	bool p = 1;
	while (p) {
		p = 0;
		for (int i = 0; i < n; i++) {
			if (a[i] > b[i]) {
				a[(i + 1) % n] += (a[i] - b[i] + 1) / 2;
				a[i] -= (a[i] - b[i] + 1) / 2 * 2;
				p = 1;
			}
		}
	}
	for (int i = 0; i < n; i++) p |= (a[i] != b[i]);
	puts(p ? "No" : "Yes");
	return 0;
}

Compilation message (stderr)

remittance.cpp: In function 'int main()':
remittance.cpp:8:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
remittance.cpp:9:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (int i = 0; i < n; i++) scanf("%lld %lld", a + i, b + i);
                              ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 15 / 15
• Subtask 2: 40 / 40
• Subtask 3: 45 / 45