Submission #110625

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
110625	2019-05-11T15:20:39 Z	dwik	Bali Sculptures (APIO15_sculpture)	C++11	21 / 100	24 ms	1168 KB

sculpture

#include <bits/stdc++.h>
using namespace std;
int n,a,b;
int arr[109];
int dp[109][2009];
int main(){
    cin>>n>>a>>b;
    for(int i=1;i<=n;i++){
        cin>>arr[i];

    }
    for(int j=0;j<=n;j++)
        for(int i=0;i<=2000;i++){
            dp[j][i]=1000000009;
        }
    dp[0][0] = 0;
    for(int i=1;i<=n;i++){
        int sum = 0;
        for(int j=i;j>=1;j--){
            sum += arr[j];
            for(int k=0;k<=2000;k++){
                dp[i][sum|k] = min(dp[i][sum|k],dp[j-1][k]+1);
            }    
        }
    }
    for(int i=0;i<=2000;i++){
        if(dp[n][i]<=b){
            cout<<i<<endl;
            exit(0);
        }
        
    }
}

Subtask #1

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 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	3 ms	384 KB	Output is correct
6	Correct	3 ms	384 KB	Output is correct
7	Correct	2 ms	512 KB	Output is correct
8	Correct	3 ms	512 KB	Output is correct
9	Correct	4 ms	512 KB	Output is correct
10	Correct	3 ms	512 KB	Output is correct
11	Correct	3 ms	512 KB	Output is correct
12	Correct	3 ms	512 KB	Output is correct
13	Correct	3 ms	512 KB	Output is correct
14	Correct	3 ms	384 KB	Output is correct
15	Incorrect	2 ms	384 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #2

0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	3 ms	384 KB	Output is correct
3	Correct	3 ms	432 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	3 ms	384 KB	Output is correct
6	Correct	3 ms	512 KB	Output is correct
7	Correct	3 ms	512 KB	Output is correct
8	Correct	2 ms	512 KB	Output is correct
9	Correct	3 ms	512 KB	Output is correct
10	Correct	3 ms	512 KB	Output is correct
11	Correct	3 ms	512 KB	Output is correct
12	Correct	3 ms	512 KB	Output is correct
13	Correct	3 ms	512 KB	Output is correct
14	Correct	3 ms	384 KB	Output is correct
15	Incorrect	3 ms	384 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	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	3 ms	512 KB	Output is correct
7	Correct	3 ms	512 KB	Output is correct
8	Correct	3 ms	512 KB	Output is correct
9	Correct	2 ms	512 KB	Output is correct
10	Correct	2 ms	512 KB	Output is correct
11	Correct	3 ms	512 KB	Output is correct
12	Correct	4 ms	512 KB	Output is correct
13	Correct	3 ms	512 KB	Output is correct
14	Correct	3 ms	512 KB	Output is correct
15	Correct	4 ms	640 KB	Output is correct
16	Correct	6 ms	768 KB	Output is correct
17	Correct	5 ms	640 KB	Output is correct
18	Correct	8 ms	768 KB	Output is correct
19	Correct	7 ms	768 KB	Output is correct
20	Correct	9 ms	768 KB	Output is correct
21	Correct	6 ms	768 KB	Output is correct
22	Correct	8 ms	768 KB	Output is correct
23	Correct	6 ms	768 KB	Output is correct
24	Correct	10 ms	768 KB	Output is correct
25	Correct	9 ms	896 KB	Output is correct
26	Correct	12 ms	896 KB	Output is correct
27	Correct	21 ms	1024 KB	Output is correct
28	Correct	20 ms	1168 KB	Output is correct
29	Correct	16 ms	1152 KB	Output is correct
30	Correct	24 ms	1152 KB	Output is correct
31	Correct	18 ms	1152 KB	Output is correct
32	Correct	22 ms	1152 KB	Output is correct

Subtask #4

0 / 25.0

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

Subtask #5

0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	384 KB	Output is correct
2	Correct	3 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	384 KB	Output is correct
6	Correct	4 ms	512 KB	Output is correct
7	Correct	3 ms	512 KB	Output is correct
8	Correct	4 ms	512 KB	Output is correct
9	Correct	3 ms	512 KB	Output is correct
10	Correct	3 ms	512 KB	Output is correct
11	Correct	3 ms	512 KB	Output is correct
12	Correct	3 ms	512 KB	Output is correct
13	Correct	3 ms	512 KB	Output is correct
14	Runtime error	3 ms	512 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
15	Halted	0 ms	0 KB	-