# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
253813 | kshitij_sodani | Remittance (JOI19_remittance) | C++14 | 412 ms | 18936 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define mp make_pair
#define pb push_back
#define a first
#define b second
llo n;
pair<llo,llo> it[1000001];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n;
int tt=1;
for(llo i=0;i<n;i++){
cin>>it[i].a>>it[i].b;
}
for(int i=0;i<40;i++){
for(int j=0;j<n;j++){
if(it[j].a>it[j].b){
int x=(it[j].a-it[j].b+1)/2;
if(it[j].a-x*2<0){
x-=1;
}
it[j].a-=x*2;
it[(j+1)%n].a+=x;
}
}
}
for(int i=0;i<n;i++){
if(it[i].a!=it[i].b){
cout<<"No"<<endl;
return 0;
}
}
cout<<"Yes"<<endl;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |