Submission #1136834

#TimeUsernameProblemLanguageResultExecution timeMemory
1136834onbertRemittance (JOI19_remittance)C++20
0 / 100
1 ms328 KiB
#include <bits/stdc++.h> using namespace std; #define int long long const int maxn = 1e6 + 5; int n; int a[maxn], b[maxn]; signed main() { cin >> n; for (int i=0;i<n;i++) cin >> a[i] >> b[i]; for (int ii=0;ii<=1;ii++) { for (int i=0;i<n;i++) { int trans = max(a[i] - b[i], (int)0) / 2; a[(i+1) % n] += trans; a[i] -= trans * 2; // cout << i << endl; // for (int j=0;j<n;j++) cout << a[j] << " "; cout << endl; } } for (int i=0;i<n;i++) if (a[i] != b[i]) { cout << "No\n"; return 0; } cout << "Yes\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...