Submission #1266523

#TimeUsernameProblemLanguageResultExecution timeMemory
1266523StefanSebezRemittance (JOI19_remittance)C++20
0 / 100
1 ms328 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=true; for(int i=0;i<n;i++){ ll sum=0; for(int j=i+1,ct=0;ct<n;j=(j+1)%n,ct++){ sum+=c[j]*(1LL<<ct); } ll e=(1LL<<n)-1; x[i]=sum/e; if(x[i]<0||x[i]*e!=sum) res=false; } /*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]=(c[i]+x[i-1])/2; if(x[i]<0||2*x[i]!=c[i]+x[i-1]){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)

remittance.cpp: In function 'int main()':
remittance.cpp:11:16: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |     int n;scanf("%i",&n);
      |           ~~~~~^~~~~~~~~
remittance.cpp:12:32: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |     for(int i=1;i<=n;i++) scanf("%lld%lld",&a[i],&b[i]),c[i]=a[i]-b[i];
      |                           ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...