Submission #549157

#TimeUsernameProblemLanguageResultExecution timeMemory
549157CyberSleeperBali Sculptures (APIO15_sculpture)C++14
50 / 100
151 ms360 KiB
#include <bits/stdc++.h> #define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL) #define debug(x) cout << "Line " << __LINE__ << ", " << #x << " is " << x << endl #define all(x) x.begin(), x.end() #define fi first #define se second #define mp make_pair #define pb push_back #define ll long long #define ull unsigned long long #define pll pair<ll, ll> #define pii pair<ll, ll> #define ld long double #define nl endl #define tb '\t' #define sp ' ' #define sqr(x) (x)*(x) using namespace std; const ll MX=2002, MOD=1000000007, BLOCK=327, INF=2e9+7, LG=62; const ll INFF=1000000000000000007; const ld ERR=1e-6, pi=3.14159265358979323846; ll N, L, R, A[MX], pref[MX], ans, DP[2005]; ll getp(ll le, ll ri){ return pref[ri]-pref[le-1]; } int main(){ fastio; cin >> N >> L >> R; for(ll i=1; i<=N; i++){ cin >> A[i]; pref[i]=pref[i-1]+A[i]; } for(ll bit=LG; bit>=0; bit--){ for(int i=0; i<=2002; i++) DP[i]=INF; DP[1]=0; for(ll i=1; i<=N; i++){ for(ll k=i; k<=N; k++){ ll tmp=(getp(i, k)>>bit); tmp=tmp<<bit; if((tmp|ans)==ans) DP[k+1]=min(DP[k+1], DP[i]+1); } } if(DP[N+1]>R) ans+=(1ll<<bit); } cout << ans << nl; }
#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...