| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1281563 | StefanSebez | Bali Sculptures (APIO15_sculpture) | C++20 | 1092 ms | 1864 KiB |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define ll long long
#define ld long double
#define mp make_pair
void chmn(ll &x,ll y){x=min(x,y);}
void chmx(ll &x,ll y){x=max(x,y);}
void chmn(int &x,int y){x=min(x,y);}
void chmx(int &x,int y){x=max(x,y);}
const int N=2050,lg=60;
const ll inf=(1LL<<60)-1;
int n,A,B,a[N];
bool dp[N][N];
bool Check(ll s){
for(int i=0;i<=n;i++) for(int k=0;k<=B;k++) dp[i][k]=0;
dp[0][0]=1;
for(int i=1;i<=n;i++){
for(int k=1;k<=B;k++){
ll sum=0;
for(int j=i-1;j>=0;j--){
sum+=a[j+1];
if(((sum|s)==s)&&dp[j][k-1]){dp[i][k]=1;break;}
}
}
}
for(int k=A;k<=B;k++) if(dp[n][k]) return true;
return false;
}
int main(){
scanf("%i%i%i",&n,&A,&B);
for(int i=1;i<=n;i++) scanf("%i",&a[i]);
ll s=(1LL<<lg)-1;
for(ll i=lg-1;i>=0;i--){
s^=1LL<<i;
if(!Check(s)) s^=1LL<<i;
}
printf("%lld\n",s);
return 0;
}
컴파일 시 표준 에러 (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... | ||||
