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>
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
// #pragma GCC target ("avx,avx2,fma")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define SPEED ios_base::sync_with_stdio(false); cin.tie(0), cout.tie(0)
#define rall(v) (v).rbegin(),(v).rend()
#define all(v) (v).begin(),(v).end()
#define setp fixed<<setprecision
#define OK cerr<<"OK"<<endl<<flush
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define F first
#define S second
#define y0 jahdakdh
#define y1 jahsadakdakdh
#define endl '\n'
const ll MOD=1e9+7;
const ll mod=(1ll<<31)-1;
const ld eps=1e-8;
using namespace std;
mt19937 rng(std::chrono::system_clock::now().time_since_epoch().count());
ll n, a, b, dp[2005][2005], pr[2005], ans;
int main()
{
SPEED;
cin>>n>>a>>b;
for(int i=1; i<=n; i++)
{
ll x;
cin>>x;
pr[i]=pr[i-1]+x;
}
ans=(1ll<<43)-1;
for(int bt=42; bt>=0; bt--)
{
memset(dp, 0, sizeof(dp));
dp[0][0]=1;
ans^=(1ll<<bt);
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
{
for(int k=0; k<i; k++)
{
if(((pr[i]-pr[k])|ans)==ans and dp[k][j-1])
dp[i][j]=1;
}
}
}
bool f=0;
for(int i=a; i<=b; i++)
f|=dp[n][i];
if(!f) ans^=(1ll<<bt);
}
cout<<ans<<endl;
return 0;
}
# | 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... |