답안 #43658 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
43658	2018-03-19T07:33:15 Z	top34051	Bali Sculptures (APIO15_sculpture)	C++14	50 / 100	145 ms	748 KB

sculpture

#include<bits/stdc++.h>
using namespace std;
const int maxn = 2e3 + 5;
const long long inf = 2e16 + 5;
int n,a,b;
int p[maxn];
int dp1[maxn], dp2[maxn][maxn];
bool check1(long long bit) {
//    printf("check %lld\n",bit);
    for(int x=1;x<=n;x++) {
        long long cur = 0;
        dp1[x] = n+1;
        for(int y=x;y>=1;y--) {
            cur += p[y];
            if((cur|bit) == bit) dp1[x] = min(dp1[x], dp1[y-1] + 1);
        }
//        printf("\tdp %d = %d\n",x,dp[x]);
    }
    return dp1[n]<=b;
}
bool check2(long long bit) {
//    printf("check %lld\n",bit);
    dp2[0][0] = 1;
    for(int x=1;x<=n;x++) {
        for(int k=1;k<=n;k++) {
            long long cur = 0;
            for(int y=x;y>=1;y--) {
                cur += p[y];
                if((cur|bit) == bit) dp2[x][k] |= dp2[y-1][k-1];
            }
        }
    }
    for(int k=a;k<=b;k++) if(dp2[n][k]) return 1;
    return 0;
}
bool check(long long bit) {
    if(a==1) return check1(bit);
    return check2(bit);
}
int main() {
	scanf("%d%d%d",&n,&a,&b);
	for(int i=1;i<=n;i++) scanf("%d",&p[i]);
	long long res = (1LL<<41)-1;
	for(int i=40;i>=0;i--) {
        if(check(res-(1LL<<i))) res -= (1LL<<i);
	}
	printf("%lld",res);
}

Compilation message

sculpture.cpp: In function 'int main()':
sculpture.cpp:41:26: 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:42:41: 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("%d",&p[i]);
                                         ^

Subtask #1
0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	352 KB	Output is correct
3	Correct	2 ms	556 KB	Output is correct
4	Correct	2 ms	556 KB	Output is correct
5	Correct	2 ms	556 KB	Output is correct
6	Correct	1 ms	564 KB	Output is correct
7	Correct	2 ms	688 KB	Output is correct
8	Correct	2 ms	688 KB	Output is correct
9	Correct	2 ms	688 KB	Output is correct
10	Correct	2 ms	688 KB	Output is correct
11	Correct	2 ms	688 KB	Output is correct
12	Correct	2 ms	688 KB	Output is correct
13	Correct	2 ms	688 KB	Output is correct
14	Incorrect	1 ms	688 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #2
0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	688 KB	Output is correct
2	Correct	1 ms	688 KB	Output is correct
3	Correct	2 ms	688 KB	Output is correct
4	Correct	2 ms	688 KB	Output is correct
5	Correct	2 ms	688 KB	Output is correct
6	Correct	1 ms	688 KB	Output is correct
7	Correct	2 ms	688 KB	Output is correct
8	Correct	1 ms	688 KB	Output is correct
9	Correct	2 ms	688 KB	Output is correct
10	Correct	2 ms	688 KB	Output is correct
11	Correct	1 ms	688 KB	Output is correct
12	Correct	2 ms	688 KB	Output is correct
13	Correct	2 ms	688 KB	Output is correct
14	Incorrect	2 ms	688 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #3
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	688 KB	Output is correct
2	Correct	1 ms	688 KB	Output is correct
3	Correct	2 ms	688 KB	Output is correct
4	Correct	2 ms	688 KB	Output is correct
5	Correct	2 ms	688 KB	Output is correct
6	Correct	2 ms	688 KB	Output is correct
7	Correct	1 ms	688 KB	Output is correct
8	Correct	1 ms	688 KB	Output is correct
9	Correct	2 ms	744 KB	Output is correct
10	Correct	2 ms	744 KB	Output is correct
11	Correct	2 ms	744 KB	Output is correct
12	Correct	1 ms	744 KB	Output is correct
13	Correct	2 ms	744 KB	Output is correct
14	Correct	1 ms	744 KB	Output is correct
15	Correct	1 ms	744 KB	Output is correct
16	Correct	2 ms	744 KB	Output is correct
17	Correct	2 ms	744 KB	Output is correct
18	Correct	2 ms	744 KB	Output is correct
19	Correct	2 ms	744 KB	Output is correct
20	Correct	2 ms	744 KB	Output is correct
21	Correct	2 ms	744 KB	Output is correct
22	Correct	2 ms	744 KB	Output is correct
23	Correct	2 ms	744 KB	Output is correct
24	Correct	2 ms	744 KB	Output is correct
25	Correct	2 ms	744 KB	Output is correct
26	Correct	2 ms	744 KB	Output is correct
27	Correct	2 ms	744 KB	Output is correct
28	Correct	3 ms	744 KB	Output is correct
29	Correct	2 ms	744 KB	Output is correct
30	Correct	2 ms	744 KB	Output is correct
31	Correct	3 ms	744 KB	Output is correct
32	Correct	2 ms	744 KB	Output is correct

Subtask #4
0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	744 KB	Output is correct
2	Correct	1 ms	744 KB	Output is correct
3	Correct	1 ms	744 KB	Output is correct
4	Correct	2 ms	744 KB	Output is correct
5	Correct	1 ms	744 KB	Output is correct
6	Correct	1 ms	744 KB	Output is correct
7	Correct	1 ms	744 KB	Output is correct
8	Correct	1 ms	744 KB	Output is correct
9	Correct	2 ms	744 KB	Output is correct
10	Correct	1 ms	744 KB	Output is correct
11	Correct	1 ms	744 KB	Output is correct
12	Correct	2 ms	744 KB	Output is correct
13	Correct	1 ms	744 KB	Output is correct
14	Incorrect	2 ms	744 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #5
29.0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	744 KB	Output is correct
2	Correct	2 ms	744 KB	Output is correct
3	Correct	2 ms	744 KB	Output is correct
4	Correct	2 ms	744 KB	Output is correct
5	Correct	2 ms	744 KB	Output is correct
6	Correct	2 ms	744 KB	Output is correct
7	Correct	2 ms	744 KB	Output is correct
8	Correct	2 ms	744 KB	Output is correct
9	Correct	2 ms	744 KB	Output is correct
10	Correct	1 ms	744 KB	Output is correct
11	Correct	1 ms	744 KB	Output is correct
12	Correct	2 ms	744 KB	Output is correct
13	Correct	2 ms	744 KB	Output is correct
14	Correct	2 ms	744 KB	Output is correct
15	Correct	2 ms	744 KB	Output is correct
16	Correct	1 ms	744 KB	Output is correct
17	Correct	1 ms	744 KB	Output is correct
18	Correct	2 ms	744 KB	Output is correct
19	Correct	1 ms	744 KB	Output is correct
20	Correct	1 ms	744 KB	Output is correct
21	Correct	1 ms	744 KB	Output is correct
22	Correct	1 ms	744 KB	Output is correct
23	Correct	2 ms	744 KB	Output is correct
24	Correct	1 ms	744 KB	Output is correct
25	Correct	1 ms	744 KB	Output is correct
26	Correct	2 ms	744 KB	Output is correct
27	Correct	2 ms	744 KB	Output is correct
28	Correct	2 ms	744 KB	Output is correct
29	Correct	2 ms	744 KB	Output is correct
30	Correct	2 ms	744 KB	Output is correct
31	Correct	2 ms	744 KB	Output is correct
32	Correct	2 ms	744 KB	Output is correct
33	Correct	2 ms	744 KB	Output is correct
34	Correct	2 ms	744 KB	Output is correct
35	Correct	2 ms	744 KB	Output is correct
36	Correct	2 ms	744 KB	Output is correct
37	Correct	2 ms	744 KB	Output is correct
38	Correct	2 ms	744 KB	Output is correct
39	Correct	2 ms	744 KB	Output is correct
40	Correct	2 ms	744 KB	Output is correct
41	Correct	2 ms	744 KB	Output is correct
42	Correct	2 ms	744 KB	Output is correct
43	Correct	2 ms	744 KB	Output is correct
44	Correct	2 ms	744 KB	Output is correct
45	Correct	2 ms	744 KB	Output is correct
46	Correct	2 ms	744 KB	Output is correct
47	Correct	2 ms	744 KB	Output is correct
48	Correct	2 ms	744 KB	Output is correct
49	Correct	2 ms	744 KB	Output is correct
50	Correct	2 ms	744 KB	Output is correct
51	Correct	2 ms	744 KB	Output is correct
52	Correct	13 ms	744 KB	Output is correct
53	Correct	20 ms	744 KB	Output is correct
54	Correct	36 ms	744 KB	Output is correct
55	Correct	35 ms	744 KB	Output is correct
56	Correct	128 ms	744 KB	Output is correct
57	Correct	127 ms	744 KB	Output is correct
58	Correct	120 ms	748 KB	Output is correct
59	Correct	124 ms	748 KB	Output is correct
60	Correct	132 ms	748 KB	Output is correct
61	Correct	3 ms	748 KB	Output is correct
62	Correct	20 ms	748 KB	Output is correct
63	Correct	36 ms	748 KB	Output is correct
64	Correct	33 ms	748 KB	Output is correct
65	Correct	61 ms	748 KB	Output is correct
66	Correct	103 ms	748 KB	Output is correct
67	Correct	128 ms	748 KB	Output is correct
68	Correct	133 ms	748 KB	Output is correct
69	Correct	145 ms	748 KB	Output is correct

답안 #43658

Compilation message

Subtask #1 0 / 9.0

Subtask #2 0 / 16.0

Subtask #3 21.0 / 21.0

Subtask #4 0 / 25.0

Subtask #5 29.0 / 29.0

Subtask #1
0 / 9.0

Subtask #2
0 / 16.0

Subtask #3
21.0 / 21.0

Subtask #4
0 / 25.0

Subtask #5
29.0 / 29.0