# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
200525 | 2020-02-07T06:14:49 Z | HellAngel | Remittance (JOI19_remittance) | C++14 | 31 ms | 16380 KB |
#include <bits/stdc++.h> #define int long long using namespace std; const int maxn = 1000007; int a[maxn], b[maxn], n; struct cmp { bool operator()(const pair<int, int> &a, const pair<int, int> &b) { if(a.first == b.first) return ::a[a.second] < ::a[b.second]; return a.first < b.first; } }; void AnsNo() { cout << "No"; exit(0); } void AnsYes() { cout << "Yes"; exit(0); } void Change(int pos, int val) { a[pos] -= 2 * val; pos++; if(pos == n) pos = 0; a[pos] += val; } int32_t main() { auto start = chrono::steady_clock::now(); ios_base::sync_with_stdio(0); cin.tie(0); if(fopen("test.inp", "r")) freopen("test.inp", "r", stdin); cin >> n; for(int i = 0; i < n; i++) cin >> a[i] >> b[i]; while(true) { bool ok = false; for(int i = 0; i < n; i++) { if(a[i] > b[i]) { int nxt = a[i] - b[i] >> 1; if(nxt == 0 && a[i] > 1) Change(a[i], 1), ok = 1; if(nxt > 0) Change(a[i], nxt), ok = 1; } } if(!ok) break; } for(int i = 0; i < n; i++) if(a[i] != b[i]) AnsNo(); AnsYes(); auto finish = chrono::steady_clock::now(); cerr << '\n'<< chrono::duration_cast<chrono::milliseconds>(finish - start).count(); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 31 ms | 16380 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 31 ms | 16380 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 31 ms | 16380 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |