Submission #564210

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
564210	2022-05-18T18:10:46 Z	4fecta	Remittance (JOI19_remittance)	C++17	0 / 100	7 ms	384 KB

remittance

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define ld long double
#define pii pair<int, int>
#define f first
#define s second
#define boost() cin.tie(0), cin.sync_with_stdio(0)

const int MN = 1000005;

int n;
pii a[MN * 2];

int32_t main() {
    boost();

    cin >> n;
    for (int i = 0; i < n; i++) cin >> a[i].f >> a[i].s;
    for (int t = 0; t < 32; t++) { //wtf???
        for (int i = 0; i < n; i++) {
            if (a[i].s < a[i].f) {
                int d = (a[i].f - a[i].s + 1) / 2;
                a[i].f -= d * 2;
                a[(i + 1) % n].f += d;
            }
        }
    }

    for (int i = 0; i < MN * 2; i++) if (a[i].f != a[i].s) return 0 * printf("No\n");
    printf("Yes\n");

    return 0;
}

Subtask #1

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	5 ms	340 KB	Output is correct
4	Correct	5 ms	340 KB	Output is correct
5	Correct	5 ms	340 KB	Output is correct
6	Correct	5 ms	372 KB	Output is correct
7	Correct	5 ms	360 KB	Output is correct
8	Correct	5 ms	340 KB	Output is correct
9	Correct	5 ms	368 KB	Output is correct
10	Correct	7 ms	340 KB	Output is correct
11	Correct	5 ms	340 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	5 ms	332 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Incorrect	5 ms	328 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

Subtask #2

0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	5 ms	340 KB	Output is correct
4	Correct	5 ms	340 KB	Output is correct
5	Correct	5 ms	340 KB	Output is correct
6	Correct	5 ms	372 KB	Output is correct
7	Correct	5 ms	360 KB	Output is correct
8	Correct	5 ms	340 KB	Output is correct
9	Correct	5 ms	368 KB	Output is correct
10	Correct	7 ms	340 KB	Output is correct
11	Correct	5 ms	340 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	5 ms	332 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Incorrect	5 ms	328 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

Subtask #3

0 / 45.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	5 ms	340 KB	Output is correct
4	Correct	5 ms	340 KB	Output is correct
5	Correct	5 ms	340 KB	Output is correct
6	Correct	5 ms	372 KB	Output is correct
7	Correct	5 ms	360 KB	Output is correct
8	Correct	5 ms	340 KB	Output is correct
9	Correct	5 ms	368 KB	Output is correct
10	Correct	7 ms	340 KB	Output is correct
11	Correct	5 ms	340 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	5 ms	332 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Incorrect	5 ms	328 KB	Output isn't correct
21	Halted	0 ms	0 KB	-