Submission #806810

# Submission time Handle Problem Language Result Execution time Memory
806810 2023-08-04T10:02:33 Z LucaIlie Remittance (JOI19_remittance) C++17
0 / 100
1 ms 312 KB
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 1e6;
const long long INF = 1e17;
int a[MAX_N], b[MAX_N];

int main() {
    int n;

    cin >> n;
    for ( int i = 0; i < n; i++ )
        cin >> a[i] >> b[i];
  
    for ( int p = 0; p < 1000; p++ ) {
        for ( int i = 0; i < n; i++ ) {
            if ( a[i] > b[i] ) {
                int x = (a[i] - b[i]) / 2;
                a[(i + 1) % n] += x;
                a[i] -= 2 * x;
            }
        }
    }

    bool ans = true;
    for ( int i = 0; i < n; i++ )
        ans &= (a[i] == b[i]);
    cout << (ans ? "Yes" : "No");

    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 0 ms 312 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Incorrect 0 ms 212 KB Output isn't correct
9 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 0 ms 312 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Incorrect 0 ms 212 KB Output isn't correct
9 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 0 ms 312 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Incorrect 0 ms 212 KB Output isn't correct
9 Halted 0 ms 0 KB -