제출 #17637

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
17637	2016-01-06 07:43:00	Namnamseo	Bali Sculptures (APIO15_sculpture)	C++14	100 / 100	103 ms	1828 KiB

sculpture

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
// explained in namnamseo.tistory.com
#include <iostream>
using namespace std;
typedef long long ll;
ll data[5010], pref[5010], ans;
int n;
int A, B;
void in(){
    cin>>n>>A>>B;
    int i;
    for(i=1; i<=n; ++i) cin>>data[i], pref[i]=pref[i-1]+data[i];
}
int dp[5010];
int min(int a,int b){ return a>b?b:a; }
bool chk_no_lb(int k){
    ll mask = (~ans) & (~((1ll<<k)-1));
    int i,j;
    for(i=1; i<=n; ++i){
        dp[i]=1e9;
        for(j=0; j<i; ++j){
            if(((pref[i]-pref[j])&mask) == 0){
                dp[i]=min(dp[i],dp[j]+1);
            }
        }
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 9 / 9
• Subtask 2: 16 / 16
• Subtask 3: 21 / 21
• Subtask 4: 25 / 25
• Subtask 5: 29 / 29