Submission #43253

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
43253	2018-03-11 15:55:09	hatuank97lhp	Bali Sculptures (APIO15_sculpture)	C++14	100 / 100	97 ms	752 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
#include <bits/stdc++.h>
#define LL long long
using namespace std;
const int N = 2005;
LL n,sum[N], a,b,x, dp[N] ;
bool ok1( LL Mask ) {
    memset(dp,0,sizeof(dp));
    for(int i = 1; i <= n; ++ i) {
        dp[i] = b + 1;
        for(int j = 0; j < i; ++ j) {
            if( ((sum[i] - sum[j]) & ~Mask) == 0 ) {
                dp[i] = min( dp[i], dp[j] + 1 );
            }
        }
    }
    if( dp[n] <= b ) return 1;
    return 0;
}
bool dp2[105][105];
bool ok2(LL Mask) {
    memset(dp2,0,sizeof(dp2));
    dp2[0][0] = 1;
    for(int i = 1; i <= n; ++ i) {
        for(int j = 1; j <= b; ++ j) {
            for(int k = 0; k < i; ++ k){
                if(dp2[k][j - 1] && ((sum[i] - sum[k]) & ~Mask) == 0) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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