Submission #1101266

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1101266	2024-10-16T01:46:56 Z	IBory	Remittance (JOI19_remittance)	C++17	0 / 100	1 ms	2644 KB

remittance

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

const int MAX = 1000007;
ll A[MAX], B[MAX];

int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	ll N;
	cin >> N;
	for (int i = 0; i < N; ++i) {
		ll a, b;
		cin >> a >> b;
		A[i] = b - a;
		B[i] = a;
	}

	if (N <= 30) {
		for (int i = 0; i < N; ++i) {
			if (0 <= A[i]) continue;
			ll init = abs(A[i]), conv = 0;
			while (init) {
				conv -= init % (1LL << N);
				init /= (1LL << N);
			}
			A[i] = conv;
		}
	}
	
	for (int t = 0; t < 3; ++t) {
		for (int i = 0; i < N; ++i) {
			if (A[i] >= 0) continue;
			ll z = abs(A[i]) / 2LL;
			A[i] += z * 2;
			A[(i + 1) % N] -= z;
		}
	}

	bool s1 = 0, s2 = 1;
	for (int i = 0; i < N; ++i) {
		if (B[i] > 1) s1 = 1;
		if (A[i] != -1) s2 = 0;
	}
	if (s1 && s2) {
		cout << "Yes";
		return 0;
	}

	for (int i = 0; i < N; ++i) {
		if (!A[i]) continue;
		cout << "No";
		return 0;
	}
	cout << "Yes";
	return 0;
}

Subtask #1

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2384 KB	Output is correct
2	Correct	1 ms	2384 KB	Output is correct
3	Correct	1 ms	2384 KB	Output is correct
4	Correct	1 ms	2384 KB	Output is correct
5	Correct	1 ms	2384 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	2384 KB	Output is correct
8	Correct	1 ms	2556 KB	Output is correct
9	Correct	1 ms	2388 KB	Output is correct
10	Correct	1 ms	2388 KB	Output is correct
11	Correct	1 ms	2552 KB	Output is correct
12	Correct	1 ms	2388 KB	Output is correct
13	Correct	1 ms	2388 KB	Output is correct
14	Correct	1 ms	2388 KB	Output is correct
15	Correct	1 ms	2388 KB	Output is correct
16	Correct	1 ms	2388 KB	Output is correct
17	Correct	1 ms	2388 KB	Output is correct
18	Correct	1 ms	2644 KB	Output is correct
19	Correct	1 ms	2520 KB	Output is correct
20	Incorrect	1 ms	2388 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

Subtask #2

0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2384 KB	Output is correct
2	Correct	1 ms	2384 KB	Output is correct
3	Correct	1 ms	2384 KB	Output is correct
4	Correct	1 ms	2384 KB	Output is correct
5	Correct	1 ms	2384 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	2384 KB	Output is correct
8	Correct	1 ms	2556 KB	Output is correct
9	Correct	1 ms	2388 KB	Output is correct
10	Correct	1 ms	2388 KB	Output is correct
11	Correct	1 ms	2552 KB	Output is correct
12	Correct	1 ms	2388 KB	Output is correct
13	Correct	1 ms	2388 KB	Output is correct
14	Correct	1 ms	2388 KB	Output is correct
15	Correct	1 ms	2388 KB	Output is correct
16	Correct	1 ms	2388 KB	Output is correct
17	Correct	1 ms	2388 KB	Output is correct
18	Correct	1 ms	2644 KB	Output is correct
19	Correct	1 ms	2520 KB	Output is correct
20	Incorrect	1 ms	2388 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

Subtask #3

0 / 45.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2384 KB	Output is correct
2	Correct	1 ms	2384 KB	Output is correct
3	Correct	1 ms	2384 KB	Output is correct
4	Correct	1 ms	2384 KB	Output is correct
5	Correct	1 ms	2384 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	2384 KB	Output is correct
8	Correct	1 ms	2556 KB	Output is correct
9	Correct	1 ms	2388 KB	Output is correct
10	Correct	1 ms	2388 KB	Output is correct
11	Correct	1 ms	2552 KB	Output is correct
12	Correct	1 ms	2388 KB	Output is correct
13	Correct	1 ms	2388 KB	Output is correct
14	Correct	1 ms	2388 KB	Output is correct
15	Correct	1 ms	2388 KB	Output is correct
16	Correct	1 ms	2388 KB	Output is correct
17	Correct	1 ms	2388 KB	Output is correct
18	Correct	1 ms	2644 KB	Output is correct
19	Correct	1 ms	2520 KB	Output is correct
20	Incorrect	1 ms	2388 KB	Output isn't correct
21	Halted	0 ms	0 KB	-