oj.uz

Submission #1100918

# Submission time Handle Problem Language Result Execution time Memory
1100918 2024-10-15T03:17:42 Z IBory Remittance (JOI19_remittance) C++17
0 / 100
 1 ms 336 KB 
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

const int MAX = 1000007;
ll A[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;
	}

	for (int t = 0; t < 32; ++t) for (int i = 0; i < N; ++i) {
		if (A[i] < 0) {
			ll z = abs(A[i]) / 2LL;
			A[i] += z * 2;
			A[(i + 1) % N] -= z;
		}
	}

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

	cout << "Yes";
	return 0;
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Incorrect 0 ms 336 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Incorrect 0 ms 336 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Incorrect 0 ms 336 KB Output isn't correct
9 Halted 0 ms 0 KB -