Submission #564154

# Submission time Handle Problem Language Result Execution time Memory
564154 2022-05-18T15:47:48 Z 4fecta Remittance (JOI19_remittance) C++17
15 / 100
24 ms 16008 KB
#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 i = 0; i < MN; i++) {
        if (a[i].s > a[i].f) {
            int d = a[i].s - a[i].f;
            a[i].s -= d;
            a[i + n].s += d;
        }
        int d = a[i].f - a[i].s;
        int tk = min(a[i].f / 2, (d + 1) / 2);
        a[i].f -= tk * 2;
        a[i + 1].f += tk;
        if (a[i].s > a[i].f) {
            int d = a[i].s - a[i].f;
            a[i].s -= d;
            a[i + n].s += d;
        }
        if (a[i].f > a[i].s) {
            int d = a[i].f - a[i].s;
            a[i].f -= d;
            a[i + n].f += d;
        }
    }
    int was = (1ll << n) - 1;
    for (int i = 0; i < MN * 2; i++) {
        assert(a[i].f >= 0 && a[i].s >= 0);
        if (a[i].f < a[i].s || (a[i].f - a[i].s) % was > 0) return 0 * printf("No\n");
    }
    printf("Yes\n");

    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 18 ms 15956 KB Output is correct
2 Correct 22 ms 15988 KB Output is correct
3 Correct 23 ms 15924 KB Output is correct
4 Correct 23 ms 16000 KB Output is correct
5 Correct 23 ms 15972 KB Output is correct
6 Correct 23 ms 15956 KB Output is correct
7 Correct 22 ms 15956 KB Output is correct
8 Correct 22 ms 15956 KB Output is correct
9 Correct 23 ms 15992 KB Output is correct
10 Correct 23 ms 15956 KB Output is correct
11 Correct 22 ms 15984 KB Output is correct
12 Correct 17 ms 15956 KB Output is correct
13 Correct 17 ms 15956 KB Output is correct
14 Correct 16 ms 15976 KB Output is correct
15 Correct 17 ms 15956 KB Output is correct
16 Correct 17 ms 15864 KB Output is correct
17 Correct 18 ms 15956 KB Output is correct
18 Correct 22 ms 15988 KB Output is correct
19 Correct 17 ms 15972 KB Output is correct
20 Correct 16 ms 15964 KB Output is correct
21 Correct 16 ms 15956 KB Output is correct
22 Correct 17 ms 15916 KB Output is correct
23 Correct 16 ms 15956 KB Output is correct
24 Correct 22 ms 16008 KB Output is correct
25 Correct 17 ms 15984 KB Output is correct
26 Correct 18 ms 15920 KB Output is correct
27 Correct 18 ms 15984 KB Output is correct
28 Correct 23 ms 16000 KB Output is correct
29 Correct 23 ms 15956 KB Output is correct
30 Correct 18 ms 15980 KB Output is correct
31 Correct 17 ms 15928 KB Output is correct
32 Correct 24 ms 15940 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 18 ms 15956 KB Output is correct
2 Correct 22 ms 15988 KB Output is correct
3 Correct 23 ms 15924 KB Output is correct
4 Correct 23 ms 16000 KB Output is correct
5 Correct 23 ms 15972 KB Output is correct
6 Correct 23 ms 15956 KB Output is correct
7 Correct 22 ms 15956 KB Output is correct
8 Correct 22 ms 15956 KB Output is correct
9 Correct 23 ms 15992 KB Output is correct
10 Correct 23 ms 15956 KB Output is correct
11 Correct 22 ms 15984 KB Output is correct
12 Correct 17 ms 15956 KB Output is correct
13 Correct 17 ms 15956 KB Output is correct
14 Correct 16 ms 15976 KB Output is correct
15 Correct 17 ms 15956 KB Output is correct
16 Correct 17 ms 15864 KB Output is correct
17 Correct 18 ms 15956 KB Output is correct
18 Correct 22 ms 15988 KB Output is correct
19 Correct 17 ms 15972 KB Output is correct
20 Correct 16 ms 15964 KB Output is correct
21 Correct 16 ms 15956 KB Output is correct
22 Correct 17 ms 15916 KB Output is correct
23 Correct 16 ms 15956 KB Output is correct
24 Correct 22 ms 16008 KB Output is correct
25 Correct 17 ms 15984 KB Output is correct
26 Correct 18 ms 15920 KB Output is correct
27 Correct 18 ms 15984 KB Output is correct
28 Correct 23 ms 16000 KB Output is correct
29 Correct 23 ms 15956 KB Output is correct
30 Correct 18 ms 15980 KB Output is correct
31 Correct 17 ms 15928 KB Output is correct
32 Correct 24 ms 15940 KB Output is correct
33 Correct 17 ms 15920 KB Output is correct
34 Correct 23 ms 16000 KB Output is correct
35 Correct 23 ms 15924 KB Output is correct
36 Incorrect 17 ms 15984 KB Output isn't correct
37 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 18 ms 15956 KB Output is correct
2 Correct 22 ms 15988 KB Output is correct
3 Correct 23 ms 15924 KB Output is correct
4 Correct 23 ms 16000 KB Output is correct
5 Correct 23 ms 15972 KB Output is correct
6 Correct 23 ms 15956 KB Output is correct
7 Correct 22 ms 15956 KB Output is correct
8 Correct 22 ms 15956 KB Output is correct
9 Correct 23 ms 15992 KB Output is correct
10 Correct 23 ms 15956 KB Output is correct
11 Correct 22 ms 15984 KB Output is correct
12 Correct 17 ms 15956 KB Output is correct
13 Correct 17 ms 15956 KB Output is correct
14 Correct 16 ms 15976 KB Output is correct
15 Correct 17 ms 15956 KB Output is correct
16 Correct 17 ms 15864 KB Output is correct
17 Correct 18 ms 15956 KB Output is correct
18 Correct 22 ms 15988 KB Output is correct
19 Correct 17 ms 15972 KB Output is correct
20 Correct 16 ms 15964 KB Output is correct
21 Correct 16 ms 15956 KB Output is correct
22 Correct 17 ms 15916 KB Output is correct
23 Correct 16 ms 15956 KB Output is correct
24 Correct 22 ms 16008 KB Output is correct
25 Correct 17 ms 15984 KB Output is correct
26 Correct 18 ms 15920 KB Output is correct
27 Correct 18 ms 15984 KB Output is correct
28 Correct 23 ms 16000 KB Output is correct
29 Correct 23 ms 15956 KB Output is correct
30 Correct 18 ms 15980 KB Output is correct
31 Correct 17 ms 15928 KB Output is correct
32 Correct 24 ms 15940 KB Output is correct
33 Correct 17 ms 15920 KB Output is correct
34 Correct 23 ms 16000 KB Output is correct
35 Correct 23 ms 15924 KB Output is correct
36 Incorrect 17 ms 15984 KB Output isn't correct
37 Halted 0 ms 0 KB -