oj.uz

Submission #23422

# Submission time Handle Problem Language Result Execution time Memory
23422 2017-05-09T06:32:11 Z rubabredwan Bali Sculptures (APIO15_sculpture) C++14
21 / 100
 133 ms 2036 KB 
/* Bismillahir Rahmanir Rahim */

#include <bits/stdc++.h>

using namespace std;

const int N = 2000;
const int oo = 1e9;

int n, a, b, y[N];
int dp[N];

long long lst(long long mask){
    if(!mask) return -1;
    return 63 - __builtin_clzll(mask);
}

bool OK(long long fixed){
    dp[0] = 0;
    for(int i=1;i<=n;i++){
        dp[i] = oo;
        long long sum = 0;
        for(int j=i;j>=1;j--){
            sum += y[j];
            if(sum & fixed) continue;
            dp[i] = min(dp[i], dp[j-1] + 1);
        }
    }
    if(dp[n] <= b) return true;
    else return false;
}

int main(){
    scanf("%d %d %d", &n, &a, &b);
    for(int i=1;i<=n;i++) scanf("%d", &y[i]);
    long long ret = 0, fixed = 0;
    for(long long bit=45;bit>=0;bit--){
        if(OK(fixed | (1LL << bit))){
            fixed |= (1LL << bit);
        }
    	else{
            ret |= (1LL << bit);
        }
    }
    cout << ret << endl;
	return 0;
}

Compilation message

sculpture.cpp: In function 'int main()':
sculpture.cpp:34:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d", &n, &a, &b);
                                  ^
sculpture.cpp:35:45: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i=1;i<=n;i++) scanf("%d", &y[i]);
                                             ^

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2036 KB Output is correct
2 Correct 0 ms 2036 KB Output is correct
3 Correct 0 ms 2036 KB Output is correct
4 Correct 0 ms 2036 KB Output is correct
5 Correct 0 ms 2036 KB Output is correct
6 Correct 0 ms 2036 KB Output is correct
7 Correct 0 ms 2036 KB Output is correct
8 Correct 0 ms 2036 KB Output is correct
9 Correct 0 ms 2036 KB Output is correct
10 Correct 0 ms 2036 KB Output is correct
11 Correct 0 ms 2036 KB Output is correct
12 Correct 0 ms 2036 KB Output is correct
13 Correct 0 ms 2036 KB Output is correct
14 Correct 0 ms 2036 KB Output is correct
15 Incorrect 0 ms 2036 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2036 KB Output is correct
2 Correct 0 ms 2036 KB Output is correct
3 Correct 0 ms 2036 KB Output is correct
4 Correct 0 ms 2036 KB Output is correct
5 Correct 0 ms 2036 KB Output is correct
6 Correct 0 ms 2036 KB Output is correct
7 Correct 0 ms 2036 KB Output is correct
8 Correct 0 ms 2036 KB Output is correct
9 Correct 0 ms 2036 KB Output is correct
10 Correct 0 ms 2036 KB Output is correct
11 Correct 0 ms 2036 KB Output is correct
12 Correct 0 ms 2036 KB Output is correct
13 Correct 0 ms 2036 KB Output is correct
14 Correct 0 ms 2036 KB Output is correct
15 Incorrect 0 ms 2036 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2036 KB Output is correct
2 Correct 0 ms 2036 KB Output is correct
3 Correct 0 ms 2036 KB Output is correct
4 Correct 0 ms 2036 KB Output is correct
5 Correct 0 ms 2036 KB Output is correct
6 Correct 0 ms 2036 KB Output is correct
7 Correct 0 ms 2036 KB Output is correct
8 Correct 0 ms 2036 KB Output is correct
9 Correct 0 ms 2036 KB Output is correct
10 Correct 0 ms 2036 KB Output is correct
11 Correct 0 ms 2036 KB Output is correct
12 Correct 0 ms 2036 KB Output is correct
13 Correct 0 ms 2036 KB Output is correct
14 Correct 0 ms 2036 KB Output is correct
15 Correct 0 ms 2036 KB Output is correct
16 Correct 0 ms 2036 KB Output is correct
17 Correct 0 ms 2036 KB Output is correct
18 Correct 0 ms 2036 KB Output is correct
19 Correct 0 ms 2036 KB Output is correct
20 Correct 0 ms 2036 KB Output is correct
21 Correct 0 ms 2036 KB Output is correct
22 Correct 0 ms 2036 KB Output is correct
23 Correct 0 ms 2036 KB Output is correct
24 Correct 0 ms 2036 KB Output is correct
25 Correct 0 ms 2036 KB Output is correct
26 Correct 0 ms 2036 KB Output is correct
27 Correct 0 ms 2036 KB Output is correct
28 Correct 0 ms 2036 KB Output is correct
29 Correct 0 ms 2036 KB Output is correct
30 Correct 0 ms 2036 KB Output is correct
31 Correct 0 ms 2036 KB Output is correct
32 Correct 0 ms 2036 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2036 KB Output is correct
2 Correct 0 ms 2036 KB Output is correct
3 Correct 0 ms 2036 KB Output is correct
4 Correct 0 ms 2036 KB Output is correct
5 Correct 0 ms 2036 KB Output is correct
6 Correct 0 ms 2036 KB Output is correct
7 Correct 0 ms 2036 KB Output is correct
8 Correct 0 ms 2036 KB Output is correct
9 Correct 0 ms 2036 KB Output is correct
10 Correct 0 ms 2036 KB Output is correct
11 Correct 0 ms 2036 KB Output is correct
12 Correct 0 ms 2036 KB Output is correct
13 Correct 0 ms 2036 KB Output is correct
14 Correct 0 ms 2036 KB Output is correct
15 Incorrect 0 ms 2036 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2036 KB Output is correct
2 Correct 0 ms 2036 KB Output is correct
3 Correct 0 ms 2036 KB Output is correct
4 Correct 0 ms 2036 KB Output is correct
5 Correct 0 ms 2036 KB Output is correct
6 Correct 0 ms 2036 KB Output is correct
7 Correct 0 ms 2036 KB Output is correct
8 Correct 0 ms 2036 KB Output is correct
9 Correct 0 ms 2036 KB Output is correct
10 Correct 0 ms 2036 KB Output is correct
11 Correct 0 ms 2036 KB Output is correct
12 Correct 0 ms 2036 KB Output is correct
13 Correct 0 ms 2036 KB Output is correct
14 Correct 0 ms 2036 KB Output is correct
15 Correct 0 ms 2036 KB Output is correct
16 Correct 0 ms 2036 KB Output is correct
17 Correct 0 ms 2036 KB Output is correct
18 Correct 0 ms 2036 KB Output is correct
19 Correct 0 ms 2036 KB Output is correct
20 Correct 0 ms 2036 KB Output is correct
21 Correct 0 ms 2036 KB Output is correct
22 Correct 0 ms 2036 KB Output is correct
23 Correct 0 ms 2036 KB Output is correct
24 Correct 0 ms 2036 KB Output is correct
25 Correct 0 ms 2036 KB Output is correct
26 Correct 0 ms 2036 KB Output is correct
27 Correct 0 ms 2036 KB Output is correct
28 Correct 0 ms 2036 KB Output is correct
29 Correct 0 ms 2036 KB Output is correct
30 Correct 0 ms 2036 KB Output is correct
31 Correct 0 ms 2036 KB Output is correct
32 Correct 0 ms 2036 KB Output is correct
33 Correct 0 ms 2036 KB Output is correct
34 Correct 0 ms 2036 KB Output is correct
35 Correct 0 ms 2036 KB Output is correct
36 Correct 0 ms 2036 KB Output is correct
37 Correct 0 ms 2036 KB Output is correct
38 Correct 0 ms 2036 KB Output is correct
39 Correct 0 ms 2036 KB Output is correct
40 Correct 0 ms 2036 KB Output is correct
41 Correct 0 ms 2036 KB Output is correct
42 Correct 0 ms 2036 KB Output is correct
43 Correct 0 ms 2036 KB Output is correct
44 Correct 0 ms 2036 KB Output is correct
45 Correct 0 ms 2036 KB Output is correct
46 Correct 0 ms 2036 KB Output is correct
47 Correct 0 ms 2036 KB Output is correct
48 Correct 0 ms 2036 KB Output is correct
49 Correct 0 ms 2036 KB Output is correct
50 Correct 0 ms 2036 KB Output is correct
51 Correct 0 ms 2036 KB Output is correct
52 Correct 9 ms 2036 KB Output is correct
53 Correct 16 ms 2036 KB Output is correct
54 Correct 33 ms 2036 KB Output is correct
55 Correct 33 ms 2036 KB Output is correct
56 Incorrect 133 ms 2036 KB Output isn't correct
57 Halted 0 ms 0 KB -