제출 #787455

#제출 시각아이디문제언어결과실행 시간메모리
787455anton송금 (JOI19_remittance)C++17
0 / 100
1 ms308 KiB
#include<bits/stdc++.h> using namespace std; #define int long long const int MAX_N = 1e6; int n,a[MAX_N], b[MAX_N]; signed main(){ cin>>n; for(int i = 0; i<n; i++){ cin>>a[i]; cin>>b[i]; } for(int turn = 0; turn<35; turn++){ for(int i = 0; i<n; i++){ //cout<<"a: "<<a[i]<<" b: "<<b[i]<<endl; int dif= (a[i]-b[i]+1)/2; if(dif>0){ a[i]-=2*dif; a[(i+1)%n] += dif; } //cout<<"a: "<<a[i]<<" b: "<<b[i]<<endl; } } bool ok = true; for(int i = 0; i<n; i++){ ok &= a[i]==b[i]; } if(ok){ cout<<"Yes"<<endl; } else{ cout<<"No"<<endl; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...