oj.uz

답안 #107698

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
107698 2019-04-25T13:35:42 Z oolimry Bali Sculptures (APIO15_sculpture) C++14
100 / 100
 164 ms 512 KB 
#include <bits/stdc++.h>

using namespace std;

long long target = 0ll; ///1's at that bit means that we want to keep that bit with a value of 0

int main()
{
    //freopen("i.txt","r",stdin);
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n, a, b;
    cin >> n >> a >> b;
    long long arr[n];
    for(int i = 0;i < n;i++){
        cin >> arr[i];
    }
    long long all = (1ll << 51) - 1;
    for(int i = 1;i < n;i++){
        arr[i] += arr[i-1];
    }
    if(n <= 200){
        bool dp[n][b];
        for(long long bit = 50;bit >= 0;bit--){
            ///check if we can keep that value at 0
            target ^= (1ll << bit);
            for(int i = 0;i < n;i++){
                for(int k = 0;k < b;k++){
                    dp[i][k] = false;
                }
            }
            for(int i = 0;i < n;i++){ ///end
                for(int k = 0;k < b;k++){ ///no. of groups;
                    if(k == 0){
                        if((arr[i] & target) == 0){
                            dp[i][k] = true;
                        }
                        continue;
                    }
                    for(int j = 0;j < i;j++){ ///choosing where to break of the previous group
                        long long presum = arr[i];
                        presum -= arr[j];
                        if(((presum & target) == 0) && dp[j][k-1]){

                            dp[i][k] = true;
                            break;
                        }
                    }
                }
            }

            bool can = false;
            for(int k = a-1;k < b;k++){
                if(dp[n-1][k]){
                    can = true;
                    break;
                }
            }
            if(!can){
                target ^= (1ll << bit);
                //cout << target << "\n";
            }

        }

        cout << (target ^ all) << "\n";
    }
    else{
        int dp[n];

        for(long long bit = 50;bit >= 0;bit--){
            ///check if we can keep that value at 0
            target ^= (1ll << bit);
            for(int i = 0;i < n;i++){
                dp[i] = 102345;
            }
            for(int i = 0;i < n;i++){
                if((arr[i] & target) == 0){
                    dp[i] = 1;
                }
                for(int j = 0;j < i;j++){
                    long long presum = arr[i];
                    presum -= arr[j];
                    if((presum & target) == 0){
                        dp[i] = min(dp[i], dp[j] + 1);
                    }
                }
            }
            if(dp[n-1] > b){
                target ^= (1ll << bit);
            }
        }

        cout << (target ^ all) << "\n";


    }




    return 0;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 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 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 332 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 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 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 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 2 ms 384 KB Output is correct
35 Correct 2 ms 384 KB Output is correct
36 Correct 2 ms 384 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 3 ms 256 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 3 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 3 ms 384 KB Output is correct
26 Correct 2 ms 300 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 384 KB Output is correct
31 Correct 3 ms 384 KB Output is correct
32 Correct 3 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 2 ms 384 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 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 256 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 3 ms 412 KB Output is correct
8 Correct 2 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 3 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 384 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 3 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 3 ms 384 KB Output is correct
22 Correct 3 ms 384 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 4 ms 380 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 4 ms 384 KB Output is correct
27 Correct 12 ms 384 KB Output is correct
28 Correct 25 ms 384 KB Output is correct
29 Correct 24 ms 384 KB Output is correct
30 Correct 2 ms 384 KB Output is correct
31 Correct 9 ms 384 KB Output is correct
32 Correct 16 ms 384 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 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 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 3 ms 384 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 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 3 ms 256 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 3 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 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 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 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 256 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 2 ms 256 KB Output is correct
35 Correct 2 ms 384 KB Output is correct
36 Correct 2 ms 384 KB Output is correct
37 Correct 2 ms 384 KB Output is correct
38 Correct 2 ms 384 KB Output is correct
39 Correct 2 ms 256 KB Output is correct
40 Correct 2 ms 384 KB Output is correct
41 Correct 3 ms 384 KB Output is correct
42 Correct 3 ms 384 KB Output is correct
43 Correct 2 ms 384 KB Output is correct
44 Correct 3 ms 384 KB Output is correct
45 Correct 0 ms 384 KB Output is correct
46 Correct 3 ms 384 KB Output is correct
47 Correct 4 ms 384 KB Output is correct
48 Correct 3 ms 384 KB Output is correct
49 Correct 3 ms 384 KB Output is correct
50 Correct 13 ms 384 KB Output is correct
51 Correct 32 ms 300 KB Output is correct
52 Correct 24 ms 384 KB Output is correct
53 Correct 2 ms 384 KB Output is correct
54 Correct 9 ms 384 KB Output is correct
55 Correct 17 ms 384 KB Output is correct
56 Correct 4 ms 384 KB Output is correct
57 Correct 5 ms 384 KB Output is correct
58 Correct 12 ms 384 KB Output is correct
59 Correct 33 ms 384 KB Output is correct
60 Correct 23 ms 384 KB Output is correct
61 Correct 2 ms 384 KB Output is correct
62 Correct 29 ms 504 KB Output is correct
63 Correct 27 ms 384 KB Output is correct
64 Correct 20 ms 384 KB Output is correct
65 Correct 3 ms 256 KB Output is correct
66 Correct 3 ms 384 KB Output is correct
67 Correct 5 ms 384 KB Output is correct
68 Correct 13 ms 384 KB Output is correct
69 Correct 32 ms 384 KB Output is correct
70 Correct 26 ms 384 KB Output is correct
71 Correct 2 ms 384 KB Output is correct
72 Correct 27 ms 384 KB Output is correct
73 Correct 20 ms 384 KB Output is correct
74 Correct 22 ms 384 KB Output is correct

Subtask #5
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 4 ms 432 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 300 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 3 ms 384 KB Output is correct
14 Correct 2 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 2 ms 384 KB Output is correct
19 Correct 3 ms 384 KB Output is correct
20 Correct 3 ms 384 KB Output is correct
21 Correct 3 ms 384 KB Output is correct
22 Correct 2 ms 256 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 2 ms 256 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 3 ms 384 KB Output is correct
29 Correct 3 ms 384 KB Output is correct
30 Correct 3 ms 384 KB Output is correct
31 Correct 3 ms 256 KB Output is correct
32 Correct 4 ms 384 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 4 ms 384 KB Output is correct
37 Correct 11 ms 384 KB Output is correct
38 Correct 29 ms 384 KB Output is correct
39 Correct 27 ms 384 KB Output is correct
40 Correct 3 ms 300 KB Output is correct
41 Correct 10 ms 384 KB Output is correct
42 Correct 20 ms 384 KB Output is correct
43 Correct 4 ms 384 KB Output is correct
44 Correct 5 ms 384 KB Output is correct
45 Correct 12 ms 384 KB Output is correct
46 Correct 23 ms 384 KB Output is correct
47 Correct 24 ms 512 KB Output is correct
48 Correct 2 ms 384 KB Output is correct
49 Correct 27 ms 384 KB Output is correct
50 Correct 27 ms 416 KB Output is correct
51 Correct 6 ms 384 KB Output is correct
52 Correct 14 ms 384 KB Output is correct
53 Correct 23 ms 384 KB Output is correct
54 Correct 41 ms 384 KB Output is correct
55 Correct 37 ms 384 KB Output is correct
56 Correct 138 ms 384 KB Output is correct
57 Correct 164 ms 404 KB Output is correct
58 Correct 140 ms 404 KB Output is correct
59 Correct 126 ms 396 KB Output is correct
60 Correct 145 ms 408 KB Output is correct
61 Correct 7 ms 384 KB Output is correct
62 Correct 21 ms 384 KB Output is correct
63 Correct 39 ms 504 KB Output is correct
64 Correct 35 ms 384 KB Output is correct
65 Correct 69 ms 392 KB Output is correct
66 Correct 95 ms 384 KB Output is correct
67 Correct 131 ms 384 KB Output is correct
68 Correct 132 ms 504 KB Output is correct
69 Correct 133 ms 416 KB Output is correct