| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1341216 | Almonther | Bali Sculptures (APIO15_sculpture) | C++20 | 343 ms | 948 KiB |
#include<bits/stdc++.h>
#define ll long long
#define co cout<<
using namespace std;
// stuff
void solve(){
ll n,l,r;
cin>>n>>l>>r;
ll arr[n+5];
for(int i=0;i<n;i++) cin>>arr[i];
ll ans=0;
for(int bit=41;bit>=0;bit--){
bitset<2001>curs[n+5];
curs[n][0]=1;
for(int i=n-1;i>=0;i--){
ll sum=0;
for(int j=i;j<n;j++){
sum+=arr[j];
if(((sum|ans)>>bit)==(ans>>bit)) curs[i]|=(curs[j+1]<<1);
}
}
bool good=0;
for(int i=l;i<=r;i++) if(curs[0][i]==1) good=1;
if(!good) ans|=1ll<<bit;
}
co ans;
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int _=1;
// cin>>_;
while(_--) solve();
}| # | 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... | ||||
