oj.uz

Submission #113658

# Submission time Handle Problem Language Result Execution time Memory
113658 2019-05-27T13:22:12 Z Akashi Bali Sculptures (APIO15_sculpture) C++14
100 / 100
 216 ms 512 KB 
#include <bits/stdc++.h>
using namespace std;

int n, a, b;
long long x[2005];

int d[2005];
bool dp[105][105];

inline bool check(long long mask){
    if(n <= 100){
        memset(dp, 0, sizeof(dp));
        ///can we divide first i elements into j groups
        dp[0][0] = 1;
        for(int i = 1; i <= n ; ++i){
            for(int j = 0; j < i ; ++j){
                for(int k = 1; k <= b ; ++k){
                    if(dp[j][k - 1] && (x[i] - x[j]) - ((x[i] - x[j]) & mask) == 0)
                        dp[i][k] = 1;
                }
            }
        }

        for(int k = a; k <= b ; ++k)
            if(dp[n][k]) return 1;
    }
    else{
        memset(d, 0x3f, sizeof(d));
        d[0] = 0;
        for(int i = 1; i <= n ; ++i){
            for(int j = 0; j < i ; ++j){
                if(x[i] - x[j] - ((x[i] - x[j]) & mask) == 0)
                    d[i] = min(d[j] + 1, d[i]);
            }
        }

        if(d[n] <= b) return 1;
    }

    return 0;
}

int main()
{
    scanf("%d%d%d", &n, &a, &b);

    for(int i = 1; i <= n ; ++i) scanf("%lld", &x[i]), x[i] += x[i - 1];

    long long Sol = (1LL << 63) - 1;

    for(long long bit = (1LL << 62); bit >= 1 ; bit >>= 1) if(check(Sol ^ bit)) Sol ^= bit;

    printf("%lld", Sol);

    return 0;
}

/*
    6 1 3
    8 1 2 1 5 4
*/

Compilation message

sculpture.cpp: In function 'int main()':
sculpture.cpp:49:33: warning: integer overflow in expression [-Woverflow]
     long long Sol = (1LL << 63) - 1;
                     ~~~~~~~~~~~~^~~
sculpture.cpp:45:10: 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:47:54: 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("%lld", &x[i]), x[i] += x[i - 1];
                                  ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 428 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 256 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 3 ms 384 KB Output is correct
29 Correct 2 ms 384 KB Output is correct
30 Correct 2 ms 384 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 3 ms 384 KB Output is correct
35 Correct 3 ms 384 KB Output is correct
36 Correct 3 ms 384 KB Output is correct
37 Correct 2 ms 256 KB Output is correct
38 Correct 2 ms 384 KB Output is correct
39 Correct 2 ms 384 KB Output is correct
40 Correct 3 ms 384 KB Output is correct
41 Correct 4 ms 384 KB Output is correct
42 Correct 4 ms 384 KB Output is correct
43 Correct 2 ms 256 KB Output is correct
44 Correct 4 ms 384 KB Output is correct
45 Correct 3 ms 256 KB Output is correct
46 Correct 3 ms 384 KB Output is correct
47 Correct 4 ms 384 KB Output is correct
48 Correct 4 ms 384 KB Output is correct
49 Correct 7 ms 384 KB Output is correct
50 Correct 19 ms 384 KB Output is correct
51 Correct 34 ms 384 KB Output is correct
52 Correct 35 ms 256 KB Output is correct
53 Correct 2 ms 384 KB Output is correct
54 Correct 20 ms 384 KB Output is correct
55 Correct 29 ms 384 KB Output is correct
56 Correct 5 ms 384 KB Output is correct
57 Correct 10 ms 384 KB Output is correct
58 Correct 19 ms 384 KB Output is correct
59 Correct 34 ms 384 KB Output is correct
60 Correct 35 ms 384 KB Output is correct
61 Correct 2 ms 384 KB Output is correct
62 Correct 36 ms 376 KB Output is correct
63 Correct 37 ms 384 KB Output is correct
64 Correct 28 ms 512 KB Output is correct
65 Correct 5 ms 256 KB Output is correct
66 Correct 4 ms 384 KB Output is correct
67 Correct 8 ms 384 KB Output is correct
68 Correct 23 ms 384 KB Output is correct
69 Correct 34 ms 384 KB Output is correct
70 Correct 35 ms 384 KB Output is correct
71 Correct 3 ms 256 KB Output is correct
72 Correct 35 ms 376 KB Output is correct
73 Correct 29 ms 384 KB Output is correct
74 Correct 28 ms 404 KB Output is correct

Subtask #5
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 256 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 2 ms 356 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 3 ms 384 KB Output is correct
28 Correct 4 ms 384 KB Output is correct
29 Correct 4 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 4 ms 428 KB Output is correct
33 Correct 3 ms 384 KB Output is correct
34 Correct 4 ms 256 KB Output is correct
35 Correct 4 ms 384 KB Output is correct
36 Correct 7 ms 384 KB Output is correct
37 Correct 20 ms 384 KB Output is correct
38 Correct 35 ms 384 KB Output is correct
39 Correct 35 ms 376 KB Output is correct
40 Correct 1 ms 384 KB Output is correct
41 Correct 21 ms 384 KB Output is correct
42 Correct 30 ms 384 KB Output is correct
43 Correct 4 ms 256 KB Output is correct
44 Correct 9 ms 384 KB Output is correct
45 Correct 20 ms 384 KB Output is correct
46 Correct 35 ms 384 KB Output is correct
47 Correct 34 ms 384 KB Output is correct
48 Correct 3 ms 384 KB Output is correct
49 Correct 35 ms 256 KB Output is correct
50 Correct 38 ms 384 KB Output is correct
51 Correct 3 ms 384 KB Output is correct
52 Correct 19 ms 384 KB Output is correct
53 Correct 30 ms 384 KB Output is correct
54 Correct 58 ms 384 KB Output is correct
55 Correct 52 ms 384 KB Output is correct
56 Correct 192 ms 380 KB Output is correct
57 Correct 202 ms 420 KB Output is correct
58 Correct 216 ms 504 KB Output is correct
59 Correct 187 ms 504 KB Output is correct
60 Correct 199 ms 504 KB Output is correct
61 Correct 2 ms 384 KB Output is correct
62 Correct 29 ms 256 KB Output is correct
63 Correct 52 ms 376 KB Output is correct
64 Correct 49 ms 376 KB Output is correct
65 Correct 95 ms 384 KB Output is correct
66 Correct 144 ms 384 KB Output is correct
67 Correct 193 ms 384 KB Output is correct
68 Correct 196 ms 384 KB Output is correct
69 Correct 190 ms 384 KB Output is correct