oj.uz

Submission #806798

# Submission time Handle Problem Language Result Execution time Memory
806798 2023-08-04T10:00:19 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 < 100; 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");

    for ( int i = 0; i < n; i++ )
        printf( "%d %d\n", a[i], b[i] );

    return 0;
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 312 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 312 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 312 KB Output isn't correct
2 Halted 0 ms 0 KB -