oj.uz

Submission #21958

# Submission time Handle Problem Language Result Execution time Memory
21958 2017-04-27T19:48:40 Z mohammad_kilani Bali Sculptures (APIO15_sculpture) C++14
71 / 100
 236 ms 3224 KB 
#include<bits/stdc++.h>
using namespace std;
const int N = 111;
int n , a , b , arr[N];
bool dp[N][N][50];
bool vis[N][N][50];
bool canbit[55];
void printbinary(long long num){
    for(int i=32;i>=0;i--){
        cout << ((num>>i)&1);
    }
    cout << endl;

}

bool check(long long num,int curbit){
    for(int i=46;i>=curbit;i--){
        if(canbit[i] == 1)
           continue;
        if(((num >> i)&1) == 1)
            return false;
    }
    return true;
}

bool solve(int i,int j,int bit){
    if(j > b)
        return false;
    if(i == n){
        if(j >= a)
            return true;
        return false;
    }
    if(vis[i][j][bit] == true)
        return dp[i][j][bit];
    vis[i][j][bit] = true;
    long long sum = 0 ;
    bool can = false;
    for(int k = i;k<n;k++){
        sum += (long long)arr[k];
        if(check(sum,bit) == 0)
            continue;
        if(solve(k+1,j+1,bit) == true){
            can = true;
        }

    }
    return dp[i][j][bit] = can;
}

int main(){
    //freopen("in.txt","r",stdin);
    memset(dp,-1,sizeof(dp));
    scanf("%d%d%d",&n,&a,&b);
    for(int i=0;i<n;i++){
        scanf("%d",&arr[i]);
    }
    long long ans = 0 ;
    for(int i=46;i>=0;i--){
        if(!solve(0,0,i)){
            ans += ((long long)1 << (long long)i);
            canbit[i] = 1;
        }

    }
    cout << ans << endl;
    return 0;
}

Compilation message

sculpture.cpp: In function 'int main()':
sculpture.cpp:54:29: 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:56:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&arr[i]);
                            ^

Subtask #1
9.0 / 9.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
25.0 / 25.0

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

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3224 KB Output is correct
2 Correct 0 ms 3224 KB Output is correct
3 Correct 0 ms 3224 KB Output is correct
4 Correct 0 ms 3224 KB Output is correct
5 Correct 0 ms 3224 KB Output is correct
6 Correct 0 ms 3224 KB Output is correct
7 Correct 0 ms 3224 KB Output is correct
8 Correct 0 ms 3224 KB Output is correct
9 Correct 0 ms 3224 KB Output is correct
10 Correct 0 ms 3224 KB Output is correct
11 Correct 0 ms 3224 KB Output is correct
12 Correct 0 ms 3224 KB Output is correct
13 Correct 0 ms 3224 KB Output is correct
14 Correct 0 ms 3224 KB Output is correct
15 Correct 0 ms 3224 KB Output is correct
16 Correct 0 ms 3224 KB Output is correct
17 Correct 0 ms 3224 KB Output is correct
18 Correct 0 ms 3224 KB Output is correct
19 Correct 0 ms 3224 KB Output is correct
20 Correct 0 ms 3224 KB Output is correct
21 Correct 0 ms 3224 KB Output is correct
22 Correct 0 ms 3224 KB Output is correct
23 Correct 0 ms 3224 KB Output is correct
24 Correct 0 ms 3224 KB Output is correct
25 Correct 3 ms 3224 KB Output is correct
26 Correct 3 ms 3224 KB Output is correct
27 Correct 13 ms 3224 KB Output is correct
28 Correct 19 ms 3224 KB Output is correct
29 Correct 19 ms 3224 KB Output is correct
30 Correct 0 ms 3224 KB Output is correct
31 Correct 19 ms 3224 KB Output is correct
32 Correct 16 ms 3224 KB Output is correct
33 Correct 13 ms 3224 KB Output is correct
34 Correct 19 ms 3224 KB Output is correct
35 Correct 19 ms 3224 KB Output is correct
36 Correct 59 ms 3224 KB Output is correct
37 Correct 133 ms 3224 KB Output is correct
38 Correct 236 ms 3224 KB Output is correct
39 Correct 213 ms 3224 KB Output is correct
40 Correct 3 ms 3224 KB Output is correct
41 Correct 169 ms 3224 KB Output is correct
42 Correct 186 ms 3224 KB Output is correct
43 Correct 3 ms 3224 KB Output is correct
44 Correct 16 ms 3224 KB Output is correct
45 Correct 29 ms 3224 KB Output is correct
46 Correct 43 ms 3224 KB Output is correct
47 Correct 43 ms 3224 KB Output is correct
48 Correct 0 ms 3224 KB Output is correct
49 Correct 46 ms 3224 KB Output is correct
50 Correct 66 ms 3224 KB Output is correct
51 Correct 29 ms 3224 KB Output is correct
52 Runtime error 213 ms 3224 KB Execution timed out (wall clock limit exceeded)
53 Halted 0 ms 0 KB -