# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
548234 | MilosMilutinovic | Remittance (JOI19_remittance) | C++14 | 575 ms | 36432 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;
const int N=1000050;
int n;
long long a[N],b[N];
bool ok(){
bool is=true;
for(int i=0;i<n;i++)is&=(a[i]==b[i]);
if(is)return true;
is=true;
for(int i=0;i<n;i++)is&=(a[i]==b[i]+1);
if(!is)return false;
is=false;
for(int i=0;i<n;i++)is|=(b[i]>0);
return is;
}
int main(){
scanf("%i",&n);
for(int i=0;i<n;i++)scanf("%lld%lld",&a[i],&b[i]);
for(int j=0;j<60;j++)for(int i=0;i<n;i++){
if(a[i]>b[i]){
long long x=(a[i]-b[i])/2;
a[i]-=2*x,a[(i+1)%n]+=x;
}
}
puts(ok()?"Yes":"No");
}
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... |