Submission #797187

#TimeUsernameProblemLanguageResultExecution timeMemory
797187Sohsoh84Remittance (JOI19_remittance)C++17
100 / 100
571 ms36500 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<ll, ll> pll; #define all(x) (x).begin(),(x).end() #define X first #define Y second #define sep ' ' #define endl '\n' #define debug(x) cerr << #x << ": " << x << endl; const ll MAXN = 1e6 + 10; const ll LIM = 100; ll A[MAXN], B[MAXN], n; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n; for (int i = 0; i < n; i++) cin >> A[i] >> B[i]; for (int t = 0; t < LIM; t++) { bool flag = true; for (int i = 0; i < n; i++) { if (A[i] != B[i]) flag = false; if (A[i] > B[i]) { int r = (A[i] - B[i]) / 2; if (A[i] - 2 * r > max(B[i], 1ll)) r++; A[i] -= 2 * r; A[(i + 1) % n] += r; } } if (flag) return cout << "Yes" << endl, 0; } cout << "No" << endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...