oj.uz

Submission #197269

# Submission time Handle Problem Language Result Execution time Memory
197269 2020-01-19T20:15:00 Z loK10 Remittance (JOI19_remittance) C++17
0 / 100
 2 ms 376 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast")
using namespace std;

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

    int n;
    cin >> n;
    int a[n], b[n];
    for(int i = 0; i < n; i++){
        cin >> a[i] >> b[i];
    }
    for(int k = 0; k < 10; k++){
        for(int i = 0; i < n; i++){
            if(a[i] > b[i]){
                int delta = min(a[i] / 2, (a[i] - b[i] + 1) / 2);
                a[i] -= 2 * delta;
                a[(i + 1) % n] += delta;
            }
        }
    }
    for(int i = 0; i < n; i++){
        if(a[i] != b[i]){
            cout << "NO";
            return 0;
        }
    }
    cout << "YES";


    return 0;
}

Subtask #1
0 / 15.0

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

Subtask #2
0 / 40.0

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

Subtask #3
0 / 45.0

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