Submission #897587

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
897587	2024-01-03T13:04:48 Z	NK_	Remittance (JOI19_remittance)	C++17	0 / 100	31 ms	452 KB

remittance

// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>
 
using namespace std;
 
#define nl '\n'
 
using ll = long long;
template<class T> using V = vector<T>;
using vi = V<int>;
using vl = V<ll>;
 
 
const int MX = 3e7;
int main() {
	cin.tie(0)->sync_with_stdio(0);
	
	int N; cin >> N;
	vl A(N), B(N); for(int i = 0; i < N; i++) cin >> A[i] >> B[i];
 
	for(int t = 0; t < MX / N; t++) {
		for(int x = 0; x < N; x++) if (A[x] > B[x]) {
			ll amt = (A[x] - B[x] + 1) / 2;
			A[x] -= 2 * amt;
			A[(x + 1) % N] += amt;
		}
	}
 
	cout << (A == B ? "Yes" : "No") << nl;
 
	exit(0-0);
}

Subtask #1

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	22 ms	348 KB	Output is correct
2	Correct	25 ms	344 KB	Output is correct
3	Correct	23 ms	344 KB	Output is correct
4	Correct	23 ms	348 KB	Output is correct
5	Correct	30 ms	348 KB	Output is correct
6	Correct	22 ms	344 KB	Output is correct
7	Correct	23 ms	348 KB	Output is correct
8	Correct	27 ms	452 KB	Output is correct
9	Correct	24 ms	452 KB	Output is correct
10	Correct	30 ms	448 KB	Output is correct
11	Correct	23 ms	452 KB	Output is correct
12	Correct	31 ms	344 KB	Output is correct
13	Correct	20 ms	348 KB	Output is correct
14	Correct	31 ms	344 KB	Output is correct
15	Correct	22 ms	448 KB	Output is correct
16	Correct	30 ms	348 KB	Output is correct
17	Correct	28 ms	348 KB	Output is correct
18	Correct	31 ms	348 KB	Output is correct
19	Correct	22 ms	344 KB	Output is correct
20	Incorrect	24 ms	348 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

Subtask #2

0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	22 ms	348 KB	Output is correct
2	Correct	25 ms	344 KB	Output is correct
3	Correct	23 ms	344 KB	Output is correct
4	Correct	23 ms	348 KB	Output is correct
5	Correct	30 ms	348 KB	Output is correct
6	Correct	22 ms	344 KB	Output is correct
7	Correct	23 ms	348 KB	Output is correct
8	Correct	27 ms	452 KB	Output is correct
9	Correct	24 ms	452 KB	Output is correct
10	Correct	30 ms	448 KB	Output is correct
11	Correct	23 ms	452 KB	Output is correct
12	Correct	31 ms	344 KB	Output is correct
13	Correct	20 ms	348 KB	Output is correct
14	Correct	31 ms	344 KB	Output is correct
15	Correct	22 ms	448 KB	Output is correct
16	Correct	30 ms	348 KB	Output is correct
17	Correct	28 ms	348 KB	Output is correct
18	Correct	31 ms	348 KB	Output is correct
19	Correct	22 ms	344 KB	Output is correct
20	Incorrect	24 ms	348 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

Subtask #3

0 / 45.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	22 ms	348 KB	Output is correct
2	Correct	25 ms	344 KB	Output is correct
3	Correct	23 ms	344 KB	Output is correct
4	Correct	23 ms	348 KB	Output is correct
5	Correct	30 ms	348 KB	Output is correct
6	Correct	22 ms	344 KB	Output is correct
7	Correct	23 ms	348 KB	Output is correct
8	Correct	27 ms	452 KB	Output is correct
9	Correct	24 ms	452 KB	Output is correct
10	Correct	30 ms	448 KB	Output is correct
11	Correct	23 ms	452 KB	Output is correct
12	Correct	31 ms	344 KB	Output is correct
13	Correct	20 ms	348 KB	Output is correct
14	Correct	31 ms	344 KB	Output is correct
15	Correct	22 ms	448 KB	Output is correct
16	Correct	30 ms	348 KB	Output is correct
17	Correct	28 ms	348 KB	Output is correct
18	Correct	31 ms	348 KB	Output is correct
19	Correct	22 ms	344 KB	Output is correct
20	Incorrect	24 ms	348 KB	Output isn't correct
21	Halted	0 ms	0 KB	-