Submission #542865

#TimeUsernameProblemLanguageResultExecution timeMemory
542865colossal_pepeRemittance (JOI19_remittance)C++17
100 / 100
703 ms36428 KiB
#include <iostream> using namespace std; typedef long long ll; const int MAXN = 1e6; int n; ll a[MAXN + 5], b[MAXN + 5]; bool isEqual() { for (int i = 0; i < n; i++) { if (a[i] != b[i]) return 0; } return 1; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n; for (int i = 0; i < n; i++) { cin >> a[i] >> b[i]; } for (int i = 0; i < 100; i++) { for (int j = 0; j < n; j++) { int k = (j + 1) % n; if (a[j] > b[j]) { ll x = min(a[j] / 2, ((a[j] - b[j]) / 2) + ((a[j] - b[j]) % 2)); a[j] -= (2 * x); a[k] += x; } } } cout << (isEqual() ? "Yes" : "No") << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...