Submission #961831

#TimeUsernameProblemLanguageResultExecution timeMemory
961831Angus_YeungRemittance (JOI19_remittance)C++17
0 / 100
1 ms2400 KiB
#include <bits/stdc++.h> #define x first #define y second #define pii pair<ll, ll> typedef long long ll; const ll MOD = 1000000007LL; const ll INF = 1e15; using namespace std; ll n, a[1000010], b[1000010]; int main() { cin.tie(0); cout.tie(0); ios::sync_with_stdio(0); cin >> n; for (int i = 1; i <= n; i++) cin >> a[i] >> b[i]; for (int j = 1; j <= 50; j++) { for (int i = 1; i <= n; i++) { if (a[i] > b[i]) { a[i%n+1] += (a[i]-b[i])/2; a[i] -= (a[i]-b[i])/2*2; } } } for (int i = 1; i <= n; i++) { if (a[i] != b[i]) { cout << "No\n"; return 0; } } cout << "Yes\n"; return 0; } /* */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...