Submission #140473

#TimeUsernameProblemLanguageResultExecution timeMemory
140473blueRemittance (JOI19_remittance)C++11
0 / 100
2 ms376 KiB
#include <iostream> using namespace std; int main() { long long n; cin >> n; long long A[n], B[n]; long long s, sv = -4000000000000000000; for(long long i = 0; i < n; i++) { cin >> A[i] >> B[i]; if(A[i] - B[i] > sv) { sv = A[i] - B[i]; s = i; } } if(sv < 0) { cout << "No\n"; return 0; } for(long long t = 1; t <= 40; t++) { if(A[s] - B[s] > 1) { A[(s+1) % n] += (A[s] - B[s]) / 2; A[s] -= 2*((A[s] - B[s]) / 2); } for(long long i = (s+1)%n; i != s; i = (i+1)%n) { if(A[i] - B[i] <= 0) continue; A[(i+1)%n] += (A[i] - B[i]) / 2; A[i] -= 2*((A[i] - B[i]) / 2); } } for(long long i = 0; i < n; i++) { if(A[i] == B[i]) continue; 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...