# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
609916 | 2022-07-28T03:13:43 Z | penguinhacker | Remittance (JOI19_remittance) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; #define ll long long #define ar array const int mxN=1e6; int n, a[mxN], b[mxN]; int main() { ios::sync_with_stdio(0); cin.tie(0); cin >> n; for (int i=0; i<n; ++i) cin >> a[i] >> b[i]; for (int i=0, change=0; change<n+2; i=i+1<n?i+1:0, ++change) { if (a[i]>b[i]&&a[i]>=2) { int x=min(a[i]/2 (a[i]-b[i]+1)/2); a[i+1<n?i+1:0]+=x; a[i]-=2*x; change=0; } } for (int i=0; i<n; ++i) if (a[i]!=b[i]) { cout << "No"; return 0; } cout << "Yes"; return 0; }