# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1266515 | StefanSebez | Remittance (JOI19_remittance) | C++20 | 1 ms | 408 KiB |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define ll long long
#define ld long double
const int N=1e6+50,S=30;
ll a[N],b[N],c[N],x[N];
int main(){
int n;scanf("%i",&n);
for(int i=1;i<=n;i++) scanf("%lld%lld",&a[i],&b[i]),c[i]=a[i]-b[i];
a[0]=a[n],b[0]=b[n],c[0]=a[0]-b[0];
/*ld X=0;
for(int i=n;i>=max(n-40,1);i--){
ll e=1LL<<(n-i+1);
X+=((ld)c[i])/((ld)e);
}
ll tempx=floor(X);*/
//printf("%lld\n",tempx);
bool res=false;
for(ll X1=0;X1<=10000;X1++){
bool moze=true;
x[0]=X1;
for(int i=1;i<=n;i++) x[i]=0;
for(int i=1;i<=n;i++){
if(abs(c[i]+x[i-1])%2==1){moze=false;break;}
x[i]=(c[i]+x[i-1])/2;
if(x[i]<0){moze=false;break;}
}
if(x[n]!=x[0]) moze=false;
if(moze){res=true;break;}
}
//for(int i=1;i<=n;i++) printf("%lld ",x[i]);printf("\n");
if(res) printf("Yes\n");
else printf("No\n");
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... |