oj.uz

Submission #564141

# Submission time Handle Problem Language Result Execution time Memory
564141 2022-05-18T15:31:50 Z 4fecta Remittance (JOI19_remittance) C++17
0 / 100
 15 ms 15956 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;
        }
    }
    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 15 ms 15956 KB Output is correct
2 Correct 15 ms 15908 KB Output is correct
3 Correct 15 ms 15932 KB Output is correct
4 Incorrect 12 ms 15956 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 15956 KB Output is correct
2 Correct 15 ms 15908 KB Output is correct
3 Correct 15 ms 15932 KB Output is correct
4 Incorrect 12 ms 15956 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 15956 KB Output is correct
2 Correct 15 ms 15908 KB Output is correct
3 Correct 15 ms 15932 KB Output is correct
4 Incorrect 12 ms 15956 KB Output isn't correct
5 Halted 0 ms 0 KB -