oj.uz

Submission #241001

# Submission time Handle Problem Language Result Execution time Memory
241001 2020-06-22T05:10:25 Z pavement Bali Sculptures (APIO15_sculpture) C++17
71 / 100
 1000 ms 4600 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#ifdef TEST
#define getchar_unlocked _getchar_nolock
#endif
#define int long long
#define ins insert
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define pf push_front
#define pp pop
#define ppb pop_back
#define ppf pop_front
#define eb emplace_back
#define g0(a) get<0>(a)
#define g1(a) get<1>(a)
#define g2(a) get<2>(a)
#define g3(a) get<3>(a)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef double db;
typedef long long ll;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef tree<pair<int, int>, null_type, less<pair<int, int> >, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef tree<pair<int, int>, null_type, less<pair<int, int> >, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
 
int ans, N, A, B, Y[2005], P[2005], mem2[2005];
char mem[2005][2005];
set<int> S;

bool dp(int n, int x) {
	if (x < 0) return 0;
	if (n == 0) return x == 0;
	if (mem[n][x] != -1) return mem[n][x];
	bool r = 0;
	for (int i = 0; i < n; i++) {
		bool inv = 0;
		for (int j : S)
			if ((P[n] - P[i]) & (1ll << j)) {
				inv = 1;
				break;
			}
		if (!inv) r |= dp(i, x - 1);
	}
	return mem[n][x] = r;
}

int dp2(int n) {
	if (n == 0) return 0;
	if (mem2[n] != -1) return mem2[n];
	int r = 1e9;
	for (int i = 0; i < n; i++) {
		bool inv = 0;
		for (int j : S)
			if ((P[n] - P[i]) & (1ll << j)) {
				inv = 1;
				break;
			}
		if (!inv) r = min(r, dp2(i) + 1);
	}
	return mem2[n] = r;
}

main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> N >> A >> B;
	for (int i = 1; i <= N; i++) cin >> Y[i], P[i] = Y[i] + P[i - 1];
	for (int i = 41; i >= 0; i--) {
		for (int i = 1; i <= N; i++) {
			for (int j = 1; j <= B; j++)
				mem[i][j] = -1;
			mem2[i] = -1;
		}
		S.insert(i);
		bool yes = 0;
		if (A > 1) {
			for (int j = A; j <= B; j++)
				if (dp(N, j)) {
					yes = 1;
					break;
				}
		} else {
			yes = dp2(N) <= B;
		}
		if (!yes) S.erase(i), ans |= (1ll << i);
	}
	cout << ans << '\n';
}

Compilation message

sculpture.cpp: In function 'bool dp(long long int, long long int)':
sculpture.cpp:49:19: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
  return mem[n][x] = r;
         ~~~~~~~~~~^~~
sculpture.cpp: At global scope:
sculpture.cpp:68:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 7 ms 384 KB Output is correct
20 Correct 6 ms 384 KB Output is correct
21 Correct 7 ms 384 KB Output is correct
22 Correct 7 ms 384 KB Output is correct
23 Correct 7 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 6 ms 384 KB Output is correct
26 Correct 7 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 5 ms 416 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Correct 5 ms 384 KB Output is correct
36 Correct 5 ms 384 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 6 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 7 ms 384 KB Output is correct
20 Correct 6 ms 384 KB Output is correct
21 Correct 7 ms 384 KB Output is correct
22 Correct 7 ms 384 KB Output is correct
23 Correct 7 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 6 ms 384 KB Output is correct
26 Correct 7 ms 384 KB Output is correct
27 Correct 6 ms 384 KB Output is correct
28 Correct 6 ms 384 KB Output is correct
29 Correct 7 ms 384 KB Output is correct
30 Correct 8 ms 384 KB Output is correct
31 Correct 9 ms 512 KB Output is correct
32 Correct 9 ms 512 KB Output is correct
33 Correct 9 ms 384 KB Output is correct
34 Correct 9 ms 512 KB Output is correct
35 Correct 9 ms 512 KB Output is correct
36 Correct 9 ms 512 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 6 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 6 ms 384 KB Output is correct
16 Correct 9 ms 384 KB Output is correct
17 Correct 8 ms 512 KB Output is correct
18 Correct 9 ms 384 KB Output is correct
19 Correct 9 ms 384 KB Output is correct
20 Correct 9 ms 512 KB Output is correct
21 Correct 9 ms 384 KB Output is correct
22 Correct 9 ms 512 KB Output is correct
23 Correct 9 ms 512 KB Output is correct
24 Correct 9 ms 512 KB Output is correct
25 Correct 11 ms 512 KB Output is correct
26 Correct 14 ms 512 KB Output is correct
27 Correct 17 ms 512 KB Output is correct
28 Correct 19 ms 512 KB Output is correct
29 Correct 19 ms 512 KB Output is correct
30 Correct 21 ms 512 KB Output is correct
31 Correct 19 ms 512 KB Output is correct
32 Correct 20 ms 512 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 7 ms 384 KB Output is correct
20 Correct 6 ms 384 KB Output is correct
21 Correct 7 ms 384 KB Output is correct
22 Correct 7 ms 384 KB Output is correct
23 Correct 7 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 6 ms 384 KB Output is correct
26 Correct 7 ms 384 KB Output is correct
27 Correct 4 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Correct 6 ms 384 KB Output is correct
36 Correct 5 ms 384 KB Output is correct
37 Correct 5 ms 384 KB Output is correct
38 Correct 6 ms 384 KB Output is correct
39 Correct 7 ms 384 KB Output is correct
40 Correct 8 ms 384 KB Output is correct
41 Correct 9 ms 512 KB Output is correct
42 Correct 9 ms 640 KB Output is correct
43 Correct 9 ms 512 KB Output is correct
44 Correct 9 ms 512 KB Output is correct
45 Correct 9 ms 512 KB Output is correct
46 Correct 9 ms 512 KB Output is correct
47 Correct 9 ms 384 KB Output is correct
48 Correct 13 ms 512 KB Output is correct
49 Correct 14 ms 512 KB Output is correct
50 Correct 17 ms 512 KB Output is correct
51 Correct 20 ms 512 KB Output is correct
52 Correct 19 ms 640 KB Output is correct
53 Correct 21 ms 512 KB Output is correct
54 Correct 21 ms 512 KB Output is correct
55 Correct 20 ms 512 KB Output is correct
56 Correct 5 ms 512 KB Output is correct
57 Correct 6 ms 512 KB Output is correct
58 Correct 6 ms 512 KB Output is correct
59 Correct 6 ms 512 KB Output is correct
60 Correct 8 ms 512 KB Output is correct
61 Correct 6 ms 512 KB Output is correct
62 Correct 7 ms 512 KB Output is correct
63 Correct 7 ms 512 KB Output is correct
64 Correct 419 ms 608 KB Output is correct
65 Correct 8 ms 512 KB Output is correct
66 Correct 7 ms 512 KB Output is correct
67 Correct 13 ms 512 KB Output is correct
68 Correct 37 ms 512 KB Output is correct
69 Correct 41 ms 512 KB Output is correct
70 Correct 119 ms 512 KB Output is correct
71 Correct 5 ms 512 KB Output is correct
72 Correct 43 ms 512 KB Output is correct
73 Correct 61 ms 512 KB Output is correct
74 Correct 58 ms 512 KB Output is correct

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 6 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 6 ms 384 KB Output is correct
26 Correct 7 ms 384 KB Output is correct
27 Correct 8 ms 384 KB Output is correct
28 Correct 11 ms 384 KB Output is correct
29 Correct 9 ms 512 KB Output is correct
30 Correct 9 ms 512 KB Output is correct
31 Correct 9 ms 512 KB Output is correct
32 Correct 9 ms 384 KB Output is correct
33 Correct 9 ms 512 KB Output is correct
34 Correct 9 ms 384 KB Output is correct
35 Correct 11 ms 512 KB Output is correct
36 Correct 14 ms 512 KB Output is correct
37 Correct 17 ms 512 KB Output is correct
38 Correct 21 ms 640 KB Output is correct
39 Correct 19 ms 512 KB Output is correct
40 Correct 27 ms 512 KB Output is correct
41 Correct 19 ms 512 KB Output is correct
42 Correct 19 ms 640 KB Output is correct
43 Correct 5 ms 512 KB Output is correct
44 Correct 6 ms 512 KB Output is correct
45 Correct 6 ms 512 KB Output is correct
46 Correct 6 ms 640 KB Output is correct
47 Correct 8 ms 512 KB Output is correct
48 Correct 6 ms 512 KB Output is correct
49 Correct 7 ms 512 KB Output is correct
50 Correct 7 ms 512 KB Output is correct
51 Correct 7 ms 512 KB Output is correct
52 Correct 67 ms 1536 KB Output is correct
53 Correct 51 ms 1792 KB Output is correct
54 Correct 268 ms 2304 KB Output is correct
55 Correct 192 ms 2552 KB Output is correct
56 Correct 300 ms 4352 KB Output is correct
57 Correct 280 ms 4492 KB Output is correct
58 Correct 382 ms 4472 KB Output is correct
59 Execution timed out 1058 ms 4600 KB Time limit exceeded
60 Halted 0 ms 0 KB -