답안 #32674 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
32674	2017-10-14T01:50:51 Z	minimario	Bali Sculptures (APIO15_sculpture)	C++14	50 / 100	759 ms	2048 KB

sculpture

#include <bits/stdc++.h>
using namespace std;
 
const int MAX = 2005;
 
typedef long long ll;
 
int y[MAX];
 
int dp[MAX];
ll p[MAX];
bool in[50];

// minimum number of parts that we need to cut 1...i into
// in order to have some kth bit off
 
vector<int> nesc;
bool works(ll x, int k) {
	for (int i : nesc) {
		if (x & (1LL<<i)) { return false; }
	}
	if (x & (1LL<<k)) { return false; }
	return true;
}
 
int main() {
	//freopen("a.in", "r", stdin);
	//freopen("a.out", "w", stdout);
	int n, a, b; scanf("%d %d %d", &n, &a, &b);
	for (int i=1; i<=n; i++) {
		scanf("%d", &y[i]);
		p[i] = p[i-1] + (ll)y[i];
	}
	for (int k=45; k>=0; k--) {
		for (int i=1; i<MAX; i++) { dp[i] = 2005; }
		for (int i=1; i<=n; i++) {
			for (int j=1; j<=i; j++) {
				ll sum = p[i] - p[j-1];
				if (works(sum, k)) {
					dp[i] = min(dp[i], dp[j-1] + 1);
				}
			}
		}
		if (dp[n] <= b) { nesc.push_back(k); }
	}
	ll sum = 0;
	
	for (int i : nesc) { in[i] = true; }
	for (int i=0; i<=45; i++) {
		if (!in[i]) { sum += 1LL<<i; }
	}
	printf("%lld\n", sum);
}

Compilation message

sculpture.cpp: In function 'int main()':
sculpture.cpp:29:44: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  int n, a, b; scanf("%d %d %d", &n, &a, &b);
                                            ^
sculpture.cpp:31:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &y[i]);
                     ^

Subtask #1
0 / 9.0

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

Subtask #2
0 / 16.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
0 / 25.0

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

Subtask #5
29.0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	2048 KB	Output is correct
2	Correct	0 ms	2048 KB	Output is correct
3	Correct	0 ms	2048 KB	Output is correct
4	Correct	0 ms	2048 KB	Output is correct
5	Correct	0 ms	2048 KB	Output is correct
6	Correct	0 ms	2048 KB	Output is correct
7	Correct	0 ms	2048 KB	Output is correct
8	Correct	0 ms	2048 KB	Output is correct
9	Correct	0 ms	2048 KB	Output is correct
10	Correct	0 ms	2048 KB	Output is correct
11	Correct	0 ms	2048 KB	Output is correct
12	Correct	0 ms	2048 KB	Output is correct
13	Correct	0 ms	2048 KB	Output is correct
14	Correct	0 ms	2048 KB	Output is correct
15	Correct	0 ms	2048 KB	Output is correct
16	Correct	0 ms	2048 KB	Output is correct
17	Correct	0 ms	2048 KB	Output is correct
18	Correct	0 ms	2048 KB	Output is correct
19	Correct	0 ms	2048 KB	Output is correct
20	Correct	0 ms	2048 KB	Output is correct
21	Correct	0 ms	2048 KB	Output is correct
22	Correct	0 ms	2048 KB	Output is correct
23	Correct	0 ms	2048 KB	Output is correct
24	Correct	0 ms	2048 KB	Output is correct
25	Correct	0 ms	2048 KB	Output is correct
26	Correct	0 ms	2048 KB	Output is correct
27	Correct	0 ms	2048 KB	Output is correct
28	Correct	0 ms	2048 KB	Output is correct
29	Correct	0 ms	2048 KB	Output is correct
30	Correct	0 ms	2048 KB	Output is correct
31	Correct	0 ms	2048 KB	Output is correct
32	Correct	0 ms	2048 KB	Output is correct
33	Correct	0 ms	2048 KB	Output is correct
34	Correct	0 ms	2048 KB	Output is correct
35	Correct	3 ms	2048 KB	Output is correct
36	Correct	3 ms	2048 KB	Output is correct
37	Correct	3 ms	2048 KB	Output is correct
38	Correct	6 ms	2048 KB	Output is correct
39	Correct	3 ms	2048 KB	Output is correct
40	Correct	3 ms	2048 KB	Output is correct
41	Correct	3 ms	2048 KB	Output is correct
42	Correct	3 ms	2048 KB	Output is correct
43	Correct	0 ms	2048 KB	Output is correct
44	Correct	0 ms	2048 KB	Output is correct
45	Correct	0 ms	2048 KB	Output is correct
46	Correct	3 ms	2048 KB	Output is correct
47	Correct	3 ms	2048 KB	Output is correct
48	Correct	3 ms	2048 KB	Output is correct
49	Correct	3 ms	2048 KB	Output is correct
50	Correct	3 ms	2048 KB	Output is correct
51	Correct	3 ms	2048 KB	Output is correct
52	Correct	73 ms	2048 KB	Output is correct
53	Correct	119 ms	2048 KB	Output is correct
54	Correct	206 ms	2048 KB	Output is correct
55	Correct	203 ms	2048 KB	Output is correct
56	Correct	723 ms	2048 KB	Output is correct
57	Correct	759 ms	2048 KB	Output is correct
58	Correct	669 ms	2048 KB	Output is correct
59	Correct	646 ms	2048 KB	Output is correct
60	Correct	653 ms	2048 KB	Output is correct
61	Correct	3 ms	2048 KB	Output is correct
62	Correct	119 ms	2048 KB	Output is correct
63	Correct	229 ms	2048 KB	Output is correct
64	Correct	199 ms	2048 KB	Output is correct
65	Correct	363 ms	2048 KB	Output is correct
66	Correct	599 ms	2048 KB	Output is correct
67	Correct	643 ms	2048 KB	Output is correct
68	Correct	716 ms	2048 KB	Output is correct
69	Correct	739 ms	2048 KB	Output is correct

답안 #32674

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