Submission #379441

#TimeUsernameProblemLanguageResultExecution timeMemory
379441reymontada61Remittance (JOI19_remittance)C++14
0 / 100
1 ms512 KiB
#include <bits/stdc++.h> using namespace std; #define int long long int n; const int MXN = 1000005; int a[MXN], b[MXN]; signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> n; for (int i=1; i<=n; i++) { cin >> a[i] >> b[i]; } int cr = 0; for (int i=1; i<=30*n; i++) { cr++; if (cr == n + 1) cr = 1; if (a[cr] > b[cr] && a[cr] > 1) { int diff = (a[cr] - b[cr]); int spl = (diff + 1) / 2; a[cr] -= spl * 2; if (cr < n) a[(cr+1)] += spl; else a[1] += spl; } } bool ok = true, c = false; for (int i=1; i<=n; i++) { if (a[i] != b[i]) ok = false; if (b[i] > 0) c = true; } if (c && ok) cout << "Yes" << endl; else cout << "No" << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...