답안 #21954 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
21954	2017-04-27T18:56:29 Z	Hiasat	Bali Sculptures (APIO15_sculpture)	C++14	71 / 100	69 ms	2080 KB

sculpture

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> plli;
typedef pair<double, double> pdd;
typedef pair<string, int> psi;

const int MOD = 1e9 + 7;

const ll oo = 1e15;

typedef long long ll;

const ll LOGN = 50;
int dp[110][110];

int n,a,b;
ll v[2010];

string ans = "";
bool check(ll num ){
	for (int i = 0; i < ans.size(); ++i){
		bool one = (((1ll << (LOGN - i - 1))&num)>0);
		if(one && (ans[i]-'0') == 0){
			return false;
		}
	}
	return ((num&(1ll << (LOGN - ans.size()-1))) == 0);
}
int can(int idx , int used){
	if(used > b)
		return 0;
	if(idx == n){
		return used >= a ? 1 : 0;
	}
	int &ret = dp[idx][used];
	if(ret != -1)
		return ret;
	ret = 0;
	ll sum = 0;
	for (int i = idx ; i < n; ++i){
		sum += v[i];

		if(check(sum)){
			ret = ret || can(i+1,used+1);
		}
	}
	return ret;
}
int main() {
 //	freopen("input.txt","r",stdin);
 	scanf("%d%d%d",&n,&a,&b);
 	for (int i = 0; i < n; ++i){
 		scanf("%lld",&v[i]);
 	}
 	while(ans.size() < LOGN){
 		memset(dp,-1,sizeof dp);
		if(can(0,0)){
			ans += '0';
		}else{
			ans += '1';
		}
 	}
 	ll sum = 0;
 	for (int i = 0; i < ans.size(); ++i){
 		sum += (1ll << (LOGN - i - 1)) * (ans[i]-'0');
 	}
 	cout << sum << endl;
	return 0;
}

Compilation message

sculpture.cpp: In function 'bool check(ll)':
sculpture.cpp:26:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < ans.size(); ++i){
                    ^
sculpture.cpp: In function 'int main()':
sculpture.cpp:69:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < ans.size(); ++i){
                     ^
sculpture.cpp:56:27: 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:58:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%lld",&v[i]);
                       ^

Subtask #1
9.0 / 9.0

#	결과	메모리	Grader output
1	Correct	2080 KB	Output is correct
2	Correct	2080 KB	Output is correct
3	Correct	2080 KB	Output is correct
4	Correct	2080 KB	Output is correct
5	Correct	2080 KB	Output is correct
6	Correct	2080 KB	Output is correct
7	Correct	2080 KB	Output is correct
8	Correct	2080 KB	Output is correct
9	Correct	2080 KB	Output is correct
10	Correct	2080 KB	Output is correct
11	Correct	2080 KB	Output is correct
12	Correct	2080 KB	Output is correct
13	Correct	2080 KB	Output is correct
14	Correct	2080 KB	Output is correct
15	Correct	2080 KB	Output is correct
16	Correct	2080 KB	Output is correct
17	Correct	2080 KB	Output is correct
18	Correct	2080 KB	Output is correct
19	Correct	2080 KB	Output is correct
20	Correct	2080 KB	Output is correct
21	Correct	2080 KB	Output is correct
22	Correct	2080 KB	Output is correct
23	Correct	2080 KB	Output is correct
24	Correct	2080 KB	Output is correct
25	Correct	2080 KB	Output is correct
26	Correct	2080 KB	Output is correct
27	Correct	2080 KB	Output is correct
28	Correct	2080 KB	Output is correct
29	Correct	2080 KB	Output is correct
30	Correct	2080 KB	Output is correct
31	Correct	2080 KB	Output is correct
32	Correct	2080 KB	Output is correct
33	Correct	2080 KB	Output is correct
34	Correct	2080 KB	Output is correct
35	Correct	2080 KB	Output is correct
36	Correct	2080 KB	Output is correct

Subtask #2
16.0 / 16.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
25.0 / 25.0

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

Subtask #5
0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	2080 KB	Output is correct
2	Correct	0 ms	2080 KB	Output is correct
3	Correct	0 ms	2080 KB	Output is correct
4	Correct	0 ms	2080 KB	Output is correct
5	Correct	0 ms	2080 KB	Output is correct
6	Correct	0 ms	2080 KB	Output is correct
7	Correct	0 ms	2080 KB	Output is correct
8	Correct	0 ms	2080 KB	Output is correct
9	Correct	0 ms	2080 KB	Output is correct
10	Correct	0 ms	2080 KB	Output is correct
11	Correct	0 ms	2080 KB	Output is correct
12	Correct	0 ms	2080 KB	Output is correct
13	Correct	0 ms	2080 KB	Output is correct
14	Correct	0 ms	2080 KB	Output is correct
15	Correct	0 ms	2080 KB	Output is correct
16	Correct	0 ms	2080 KB	Output is correct
17	Correct	0 ms	2080 KB	Output is correct
18	Correct	0 ms	2080 KB	Output is correct
19	Correct	0 ms	2080 KB	Output is correct
20	Correct	0 ms	2080 KB	Output is correct
21	Correct	0 ms	2080 KB	Output is correct
22	Correct	0 ms	2080 KB	Output is correct
23	Correct	0 ms	2080 KB	Output is correct
24	Correct	0 ms	2080 KB	Output is correct
25	Correct	0 ms	2080 KB	Output is correct
26	Correct	0 ms	2080 KB	Output is correct
27	Correct	0 ms	2080 KB	Output is correct
28	Correct	3 ms	2080 KB	Output is correct
29	Correct	3 ms	2080 KB	Output is correct
30	Correct	0 ms	2080 KB	Output is correct
31	Correct	3 ms	2080 KB	Output is correct
32	Correct	0 ms	2080 KB	Output is correct
33	Correct	3 ms	2080 KB	Output is correct
34	Correct	0 ms	2080 KB	Output is correct
35	Correct	3 ms	2080 KB	Output is correct
36	Correct	9 ms	2080 KB	Output is correct
37	Correct	6 ms	2080 KB	Output is correct
38	Correct	6 ms	2080 KB	Output is correct
39	Correct	6 ms	2080 KB	Output is correct
40	Correct	6 ms	2080 KB	Output is correct
41	Correct	16 ms	2080 KB	Output is correct
42	Correct	6 ms	2080 KB	Output is correct
43	Correct	0 ms	2080 KB	Output is correct
44	Correct	9 ms	2080 KB	Output is correct
45	Correct	3 ms	2080 KB	Output is correct
46	Correct	0 ms	2080 KB	Output is correct
47	Correct	3 ms	2080 KB	Output is correct
48	Correct	0 ms	2080 KB	Output is correct
49	Correct	6 ms	2080 KB	Output is correct
50	Correct	19 ms	2080 KB	Output is correct
51	Correct	6 ms	2080 KB	Output is correct
52	Incorrect	69 ms	2080 KB	Output isn't correct
53	Halted	0 ms	0 KB	-

답안 #21954

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 16.0 / 16.0

Subtask #3 21.0 / 21.0

Subtask #4 25.0 / 25.0

Subtask #5 0 / 29.0

Subtask #1
9.0 / 9.0

Subtask #2
16.0 / 16.0

Subtask #3
21.0 / 21.0

Subtask #4
25.0 / 25.0

Subtask #5
0 / 29.0