# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
299497 | Muhammetali | Bali Sculptures (APIO15_sculpture) | C++11 | 1 ms | 384 KiB |
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>
#define mp make_pair
#define f first
#define s second
#define sz(x) (int)(x).size()
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pf push_front
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
int n,a,b,res;
ll y[10001],jem[10001];
vi v;
void func(int k)
{
if (k==n)
{
if (sz(v)>=a && sz(v)<=b)
{
int sum=0;
for (int i=0;i<sz(v);i++) sum|=v[i];
res=max(res,sum);
}
return;
}
for (int i=k;i<n;i++)
{
v.pb(jem[i]-jem[k-1]);
func(i+1);
v.pop_back();
}
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
cin >> n >> a >> b;
for (int i=0;i<n;i++) cin >> y[i];
jem[-1]=0;
jem[0]=y[0];
for (int i=1;i<n;i++) jem[i]=jem[i-1]+y[i];
func(0);
cout << res;
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |