# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
225403 | MKopchev | Remittance (JOI19_remittance) | C++14 | 430 ms | 28664 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 nmax=1e6+42;
int n;
int inp[nmax],outp[nmax];
void print(int ok)
{
if(ok)printf("Yes\n");
else printf("No\n");
exit(0);
}
int main()
{
scanf("%i",&n);
int mx_a=0,mx_b=0;
for(int i=1;i<=n;i++)
{
scanf("%i%i",&inp[i],&outp[i]);
mx_a=max(mx_a,inp[i]);
mx_b=max(mx_b,outp[i]);
}
if(mx_b==0)
{
if(mx_a==0)print(1);
print(0);
}
for(int step=1;step<=50;step++)
for(int i=1;i<=n;i++)
{
int nxt=i+1;
if(nxt>n)nxt=nxt-n;
if(inp[i]>outp[i])
{
int send=(inp[i]-outp[i]+1)/2;
inp[i]=inp[i]-2*send;
inp[nxt]=inp[nxt]+send;
}
}
for(int i=1;i<=n;i++)
if(inp[i]!=outp[i])print(0);
print(1);
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... |