Submission #528296

#TimeUsernameProblemLanguageResultExecution timeMemory
528296AdamGSRemittance (JOI19_remittance)C++17
0 / 100
1 ms328 KiB
#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';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...