# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
677646 | 2023-01-04T06:04:08 Z | Cross_Ratio | Remittance (JOI19_remittance) | C++14 | 1 ms | 468 KB |
#include <bits/stdc++.h> #define int long long using namespace std; typedef pair<int,int> P; int A[1000005]; int B[1000005]; signed main() { cin.sync_with_stdio(false); cin.tie(0); cout.tie(0); int N; cin >> N; int i, j; for(i=0;i<N;i++) cin >> A[i] >> B[i]; priority_queue<P> PQ; for(i=0;i<N;i++) { if(A[i] > B[i]+1) { PQ.push(P(A[i] - B[i], i)); } } while(!PQ.empty()) { P k = PQ.top(); PQ.pop(); int id = k.second; if(A[id] <= B[id]+1) continue; int v = A[id] - B[id]; v /= 2; A[id] -= v*2; A[(id+1)%N] += v; if(A[(id+1)%N]>B[(id+1)%N]+1) { PQ.push(P(A[(id+1)%N]-B[(id+1)%N], (id+1)%N)); } } bool isPos1 = true; bool isPos2 = true; for(i=0;i<N;i++) { if(A[i]!=B[i]) isPos1 = false; if(A[i]!=B[i]+1) isPos2 = false; assert(A[i]>=B[i]+2); } cout << (isPos1||isPos2?"Yes":"No"); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 468 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 468 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 468 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |