Submission #397739

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
397739	2021-05-03T02:08:14 Z	timmyfeng	Remittance (JOI19_remittance)	C++17	0 / 100	1 ms	336 KB

remittance

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

const int N = 1000000;

int a[N], b[N];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;

    for (int i = 0; i < n; ++i) {
        cin >> a[i] >> b[i];
    }

    while (true) {
        bool delta = false;

        for (int i = 0; i < n; ++i) {
            if (a[i] > b[i]) {
                int send = (a[i] - b[i] + 1) / 2;
                a[(i + 1) % n] += send;
                a[i] -= 2 * send;
                delta = true;
            }
        }

        if (!delta) {
            break;
        }
    }

    cout << (equal(a, a + n, b) ? "Yes" : "No") << "\n";
}

Subtask #1

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	324 KB	Output is correct
13	Correct	1 ms	208 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	1 ms	324 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Incorrect	1 ms	332 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	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	324 KB	Output is correct
13	Correct	1 ms	208 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	1 ms	324 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Incorrect	1 ms	332 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	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	324 KB	Output is correct
13	Correct	1 ms	208 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	1 ms	324 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	332 KB	Output is correct
19	Correct	1 ms	332 KB	Output is correct
20	Incorrect	1 ms	332 KB	Output isn't correct
21	Halted	0 ms	0 KB	-