제출 #284165

#제출 시각아이디문제언어결과실행 시간메모리
284165jainbot27송금 (JOI19_remittance)C++17
55 / 100
1081 ms8192 KiB
#include <bits/stdc++.h> using namespace std; int main(){ int n; cin >> n; vector<int> a(n), b(n); for(int i=0; i < n; i++) cin >> a[i] >> b[i]; if(*max_element(b.begin(), b.end())==0) { cout << (*max_element(a.begin(), a.end())==0?"Yes":"No")<< "\n"; return 0; } int g = 1; while(g){ g=0; for(int i=0; i < n; i++){ if(a[i] > b[i]){ a[(i+1)%n] += (a[i] - b[i] + 1)/2; a[i] -= (a[i]-b[i]+1)/2*2; g=1; } } } g=1; for(int i=0; i < n; i++){ g &= a[i] == b[i]; } cout << (g?"Yes":"No") << "\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...