# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
331280 | jainbot27 | Remittance (JOI19_remittance) | C++17 | 1 ms | 364 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>
int main(){
int n;scanf("%d",&n);std::vector<int>a(n),b(n);
for(int i=0;i<n;i++)scanf("%d%d",&a[i],&b[i]);
if(*std::max_element(b.begin(),b.end())==0){
puts("Yes");exit(0);
}
int g=1;
while(g){
g=0;
for(int i=0;i<n;i++){
if(a[i]>b[i]){
int r=(a[i]-b[i]+1)/2;
a[(i+1)%n]+=r;
a[i]-=r*2;
g=1;
}
}
}
g=1;
for(int i=0; i < n; i++){
g&=a[i]==b[i];
}
puts(g?"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... |