Submission #133566

#TimeUsernameProblemLanguageResultExecution timeMemory
133566junodeveloperBali Sculptures (APIO15_sculpture)C++14
71 / 100
101 ms632 KiB
#include <bits/stdc++.h> #define sz(x) (int)x.size() #define fi first #define se second using namespace std; typedef long long ll; int n, A, B; ll a[2010]; bool chk[2010][2010], chk2[2010]; inline bool f(ll x,ll sum,int p) { return (~x&sum)/(1ll<<p)==0; } bool Check1 (ll x, int p) { int i,j,k;ll sum; for(i=1;i<=n;i++) { chk[i][1]=f(x,a[i],p); for(j=2;j<=i;j++) { chk[i][j]=false; for(k=i-1;k>=j-1;k--) { sum=a[i]-a[k]; if(f(x,sum,p)) { chk[i][j]|=chk[k][j-1]; } } } } bool res=false; for(i=A;i<=B;i++) res|=chk[n][i]; return res; } bool Check2(ll x, int p) { int i,j,k;ll sum; for(i=1;i<=n;i++) { chk2[i]=f(x,a[i],p); for(k=i-1;k>=1;k--) { sum=a[i]-a[k]; if(f(x,sum,p)) { chk2[i]|=chk2[k]; } } } return chk2[n]; } int main() { int task; scanf("%d%d%d",&n,&A,&B); if(n<=100) task=0; else task=1; int i; for(i=1;i<=n;i++) { scanf("%lld",a+i); a[i]+=a[i-1]; } ll res=0; for(i=43;i>=0;i--) { if(task) { if(!Check2(res,i)) res|=1ll<<i; } else { if(!Check1(res,i)) res|=1ll<<i; } } printf("%lld",res); return 0; }

Compilation message (stderr)

sculpture.cpp: In function 'bool Check2(ll, int)':
sculpture.cpp:32:8: warning: unused variable 'j' [-Wunused-variable]
  int i,j,k;ll sum;
        ^
sculpture.cpp: In function 'int main()':
sculpture.cpp:46:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d",&n,&A,&B);
  ~~~~~^~~~~~~~~~~~~~~~~~~
sculpture.cpp:51:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld",a+i);
   ~~~~~^~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...