oj.uz

답안 #897253

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
897253 2024-01-02T20:20:40 Z TahirAliyev Bali Sculptures (APIO15_sculpture) C++17
9 / 100
 1000 ms 600 KB 
#include <bits/stdc++.h>

#define ll long long
#define oo 1e9
#define pii pair<int, int>

using namespace std;

const int MAX = 105;

int n, a, b;
int arr[MAX];
ll pre[MAX];
ll cur = 0;

int dp[MAX][MAX];

bool rec(int i, int k, int bit){
    if(i == n + 1){
        if(k >= a && k <= b) return 1;
        else return 0;
    }
    if(dp[i][k] != -1) return dp[i][k];
    for(int j = i + 1; j <= n + 1; j++){
        if((cur | (pre[j - 1] - pre[i - 1])) >> bit << bit == cur && rec(j, k + 1, bit)){
            return dp[i][k] = 1;
        }
    }
    return dp[i][k] = 0;
}

int dp2[MAX];

int rec2(int i, int bit){
    if(i == n + 1) return 0;
    if(dp2[i] != -1) return dp2[i];
    int ans = oo;
    for(int j = i + 1; j <= n + 1; j++){
        if((cur | (pre[j - 1] - pre[i - 1])) >> bit << bit == cur){
            ans = min(1 + rec2(j, bit), ans);
        }
    }
    return ans;
}

int main(){
    cin >> n >> a >> b;
    for(int i = 1; i <= n; i++){
        cin >> arr[i];
        pre[i] = pre[i - 1] + arr[i];
    }
    for(int B = 40; B >= 0; B--){
        if(a == 1){
            memset(dp2, -1, sizeof(dp2));
            if(rec2(1, B) > b){
                cur |= (1ll << B);
            }
        }
        else{
            memset(dp, -1, sizeof(dp));
            if(!rec(1, 0, B)){
                cur |= (1ll << B);
            }
        }
    }
    cout << cur << '\n';
}

Compilation message

sculpture.cpp: In function 'bool rec(int, int, int)':
sculpture.cpp:26:29: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   26 |             return dp[i][k] = 1;
      |                    ~~~~~~~~~^~~
sculpture.cpp:29:21: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   29 |     return dp[i][k] = 0;
      |            ~~~~~~~~~^~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 5 ms 348 KB Output is correct
7 Correct 17 ms 348 KB Output is correct
8 Correct 137 ms 348 KB Output is correct
9 Correct 140 ms 412 KB Output is correct
10 Correct 146 ms 408 KB Output is correct
11 Correct 134 ms 348 KB Output is correct
12 Correct 138 ms 416 KB Output is correct
13 Correct 144 ms 412 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 18 ms 436 KB Output is correct
31 Correct 33 ms 348 KB Output is correct
32 Correct 38 ms 344 KB Output is correct
33 Correct 54 ms 348 KB Output is correct
34 Correct 49 ms 420 KB Output is correct
35 Correct 86 ms 412 KB Output is correct
36 Correct 92 ms 420 KB Output is correct

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 348 KB Output is correct
7 Correct 17 ms 348 KB Output is correct
8 Correct 152 ms 348 KB Output is correct
9 Correct 144 ms 596 KB Output is correct
10 Correct 153 ms 348 KB Output is correct
11 Correct 134 ms 348 KB Output is correct
12 Correct 137 ms 344 KB Output is correct
13 Correct 159 ms 500 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 292 ms 412 KB Output is correct
28 Execution timed out 1050 ms 344 KB Time limit exceeded
29 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 600 KB Output is correct
6 Correct 7 ms 348 KB Output is correct
7 Correct 17 ms 348 KB Output is correct
8 Correct 138 ms 348 KB Output is correct
9 Correct 213 ms 412 KB Output is correct
10 Correct 138 ms 596 KB Output is correct
11 Correct 139 ms 412 KB Output is correct
12 Correct 168 ms 412 KB Output is correct
13 Correct 147 ms 412 KB Output is correct
14 Correct 303 ms 412 KB Output is correct
15 Execution timed out 1008 ms 344 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 436 KB Output is correct
6 Correct 5 ms 348 KB Output is correct
7 Correct 17 ms 344 KB Output is correct
8 Correct 139 ms 408 KB Output is correct
9 Correct 140 ms 348 KB Output is correct
10 Correct 145 ms 348 KB Output is correct
11 Correct 140 ms 344 KB Output is correct
12 Correct 148 ms 596 KB Output is correct
13 Correct 139 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 544 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 600 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 18 ms 412 KB Output is correct
31 Correct 33 ms 344 KB Output is correct
32 Correct 33 ms 348 KB Output is correct
33 Correct 57 ms 412 KB Output is correct
34 Correct 57 ms 428 KB Output is correct
35 Correct 94 ms 344 KB Output is correct
36 Correct 87 ms 408 KB Output is correct
37 Correct 273 ms 348 KB Output is correct
38 Execution timed out 1069 ms 348 KB Time limit exceeded
39 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 388 KB Output is correct
4 Correct 0 ms 360 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 436 KB Output is correct
7 Correct 17 ms 348 KB Output is correct
8 Correct 139 ms 408 KB Output is correct
9 Correct 153 ms 416 KB Output is correct
10 Correct 135 ms 344 KB Output is correct
11 Correct 134 ms 412 KB Output is correct
12 Correct 138 ms 344 KB Output is correct
13 Correct 144 ms 428 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 19 ms 348 KB Output is correct
18 Correct 33 ms 440 KB Output is correct
19 Correct 33 ms 344 KB Output is correct
20 Correct 54 ms 348 KB Output is correct
21 Correct 53 ms 596 KB Output is correct
22 Correct 87 ms 348 KB Output is correct
23 Correct 87 ms 348 KB Output is correct
24 Correct 275 ms 408 KB Output is correct
25 Execution timed out 1047 ms 344 KB Time limit exceeded
26 Halted 0 ms 0 KB -