답안 #41385 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
41385	2018-02-17T06:30:45 Z	fest	Bali Sculptures (APIO15_sculpture)	C++14	71 / 100	322 ms	32928 KB

sculpture

// fest
#include <bits/stdc++.h>	

#define pb push_back
#define F first
#define S second
#define y1 dasdasfasfas
#define x1 wqdadfasfasfas
#define All(c) c.begin(), c.end()
#define SZ(A) (int((A).size()))
#define umap unordered_map
#define FILENAME ""
#define __ fflush(stdout)

typedef long long ll;
typedef long double ld;    

using namespace std;

void FREOPEN() {
	#ifdef COMP
		freopen(".in", "r", stdin);
		freopen("1.out", "w", stdout);
	#else
		freopen(FILENAME".in", "r", stdin);
		freopen(FILENAME".out", "w", stdout);
	#endif
}                           

inline double Time() {return (clock() * 1.0) / CLOCKS_PER_SEC; }             

const int N = 101, inf = 1e9 * 2, MOD = (int)1e9 + 7;

char CH[N];

const ll INF = 1e18;

const int dx[] = {1, -1, 0, 0, -1, 1, -1, 1};
const int dy[] = {0, 0, 1, -1, -1, 1, 1, -1};

ll a[N];

map<ll, bool> dp[N][N];

int main() {
  
	int n, l, r;
	cin >> n >> l >> r;
	for (int i = 1; i <= n; i++) scanf("%lld ", a + i);
	ll should = INF;
	for (int i = 50; i >= 0; i--) {
		int bl = 0;
		for (int j = 1; j <= n;) {
			ll now = a[j];
			int rig = j + 1;
			while (rig <= n && now + a[rig] < (1ll << i)) now += a[rig], rig++;
			if (now >= (1ll << i)) {
				bl = r + 1;
				break;
			}
			bl++;
			j = rig;	
		}
		if (bl <= r) should = (1ll << i);
		else break;
	}
	dp[0][0][0] = 1;
	for (int i = 1; i <= n; i++) {
		for (int k = 1; k <= r; k++) {
			ll sum = a[i];
			for (int j = i - 1; j >= 0; j--) {
				if (sum >= should) break;
				for (auto m : dp[j][k - 1]) if ((m.F | sum) < should) dp[i][k][(m.F | sum)] = 1;
				sum += a[j];	
			}
		}
	}
	ll ans = INF;
	for (int k = l; k <= r; k++) for (auto m : dp[n][k]) ans = min(ans, m.F);
	cout << ans;	
	return 0;	
}

Compilation message

sculpture.cpp: In function 'void FREOPEN()':
sculpture.cpp:25:37: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen(FILENAME".in", "r", stdin);
                                     ^
sculpture.cpp:26:39: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen(FILENAME".out", "w", stdout);
                                       ^
sculpture.cpp: In function 'int main()':
sculpture.cpp:49:52: 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("%lld ", a + i);
                                                    ^

Subtask #1
9.0 / 9.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
25.0 / 25.0

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

Subtask #5
0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	26064 KB	Output is correct
2	Correct	2 ms	26064 KB	Output is correct
3	Correct	2 ms	26064 KB	Output is correct
4	Correct	2 ms	26064 KB	Output is correct
5	Correct	2 ms	26064 KB	Output is correct
6	Correct	2 ms	26064 KB	Output is correct
7	Correct	2 ms	26064 KB	Output is correct
8	Correct	2 ms	26064 KB	Output is correct
9	Correct	2 ms	26064 KB	Output is correct
10	Correct	2 ms	26064 KB	Output is correct
11	Correct	2 ms	26064 KB	Output is correct
12	Correct	2 ms	26064 KB	Output is correct
13	Correct	2 ms	26064 KB	Output is correct
14	Correct	2 ms	26064 KB	Output is correct
15	Correct	2 ms	26064 KB	Output is correct
16	Correct	2 ms	26064 KB	Output is correct
17	Correct	2 ms	26064 KB	Output is correct
18	Correct	2 ms	26064 KB	Output is correct
19	Correct	2 ms	26064 KB	Output is correct
20	Correct	2 ms	26064 KB	Output is correct
21	Correct	2 ms	26064 KB	Output is correct
22	Correct	2 ms	26064 KB	Output is correct
23	Correct	2 ms	26064 KB	Output is correct
24	Correct	2 ms	26064 KB	Output is correct
25	Correct	2 ms	26064 KB	Output is correct
26	Correct	2 ms	26064 KB	Output is correct
27	Correct	2 ms	26064 KB	Output is correct
28	Correct	2 ms	26064 KB	Output is correct
29	Correct	2 ms	26064 KB	Output is correct
30	Correct	2 ms	26064 KB	Output is correct
31	Correct	2 ms	26064 KB	Output is correct
32	Correct	2 ms	26064 KB	Output is correct
33	Correct	2 ms	26064 KB	Output is correct
34	Correct	2 ms	26064 KB	Output is correct
35	Correct	5 ms	26064 KB	Output is correct
36	Correct	3 ms	26064 KB	Output is correct
37	Correct	2 ms	26064 KB	Output is correct
38	Correct	2 ms	26064 KB	Output is correct
39	Correct	2 ms	26064 KB	Output is correct
40	Correct	2 ms	26064 KB	Output is correct
41	Correct	3 ms	26064 KB	Output is correct
42	Correct	2 ms	26064 KB	Output is correct
43	Correct	2 ms	26064 KB	Output is correct
44	Correct	3 ms	26064 KB	Output is correct
45	Correct	2 ms	26064 KB	Output is correct
46	Correct	2 ms	26064 KB	Output is correct
47	Correct	2 ms	26064 KB	Output is correct
48	Correct	2 ms	26064 KB	Output is correct
49	Correct	56 ms	26064 KB	Output is correct
50	Correct	322 ms	26096 KB	Output is correct
51	Runtime error	175 ms	32928 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
52	Halted	0 ms	0 KB	-

답안 #41385

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