제출 #336844

#제출 시각아이디문제언어결과실행 시간메모리
336844blue송금 (JOI19_remittance)C++11
0 / 100
1 ms384 KiB
#include <iostream> using namespace std; int main() { int N; cin >> N; int A[N], B[N]; for(int i = 0; i < N; i++) { cin >> A[i] >> B[i]; } bool only0 = 0; for(int i = 0; i < N; i++) only0 &= !A[i]; if(only0) { for(int i = 0; i < N; i++) if(B[i]) { cout << "No\n"; return 0; } } for(int r = 0; r < N; r++) { for(int i = 0; i < N; i++) { if(A[i] <= B[i]) continue; int t = max((A[i] - B[i])/2, 1); A[i] -= 2*t; A[(i+1)%N] += t; } } for(int i = 0; i < N; i++) if(A[i] != B[i]) { cout << "No\n"; return 0; } cout << "Yes\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...