oj.uz

Submission #528296

# Submission time Handle Problem Language Result Execution time Memory
528296 2022-02-19T20:22:45 Z AdamGS Remittance (JOI19_remittance) C++17
0 / 100
 1 ms 328 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(a, b) for(int a = 0; a < (b); ++a)
const int LIM=1e6+7;
ll A[LIM], B[LIM];
int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    ll n;
    cin >> n;
    rep(i, n) cin >> A[i] >> B[i];
    rep(i, 30) rep(j, n) if(A[j]>B[j]) {
        ll x=A[j]-B[j];
        x/=2;
        A[j]-=2*x;
        A[(j+1)%n]+=x;
    }
    bool ok=true;
    rep(i, n) if(A[i]!=B[i]) ok=false;
    cout << (ok?"Yes":"No") << '\n';
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 324 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Incorrect 0 ms 208 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 324 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Incorrect 0 ms 208 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 324 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Incorrect 0 ms 208 KB Output isn't correct
9 Halted 0 ms 0 KB -