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;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}());
const ll mod=1000000007;
const ll mod2=998244353;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head
const int N=2010;
int n,a,b,y[N],dp[N];
ll pf[N],ans;
bool can[N][N];
ll get(int l,int r) {
return pf[r]-pf[l-1];
}
bool check1() {
rep(i,1,n+1) dp[i]=N*2;
rep(i,1,n+1) rep(j,i,n+1) {
if ((get(i,j)|ans)==ans) {
dp[j]=min(dp[j],dp[i-1]+1);
}
}
return dp[n]<=b;
}
bool check2() {
rep(i,1,n+1) rep(j,1,n+1) can[i][j]=false;
can[0][0]=true;
rep(i,1,n+1) rep(j,i,n+1) rep(x,0,n) {
if ((get(i,j)|ans)==ans&&can[i-1][x]) {
can[j][x+1]=true;
}
}
rep(i,a,b+1) if (can[n][i]) return true;
return false;
}
int main() {
scanf("%d%d%d",&n,&a,&b);
rep(i,1,n+1) scanf("%d",y+i),pf[i]=pf[i-1]+y[i];
if (a==1) {
ans=(1ll<<61)-1;
per(i,0,61) {
ans^=(1ll<<i);
if (!check1()) ans|=(1ll<<i);
}
printf("%lld",ans);
} else {
ans=(1ll<<61)-1;
per(i,0,61) {
ans^=(1ll<<i);
if (!check2()) ans|=(1ll<<i);
}
printf("%lld",ans);
}
}
/*6 1 3
8 1 2 1 5 4
*/
Compilation message (stderr)
sculpture.cpp: In function 'int main()':
sculpture.cpp:55:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
55 | scanf("%d%d%d",&n,&a,&b);
| ~~~~~^~~~~~~~~~~~~~~~~~~
sculpture.cpp:56:20: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
56 | rep(i,1,n+1) scanf("%d",y+i),pf[i]=pf[i-1]+y[i];
| ~~~~~^~~~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |