oj.uz

Submission #109884

# Submission time Handle Problem Language Result Execution time Memory
109884 2019-05-08T09:36:46 Z Saboon Bali Sculptures (APIO15_sculpture) C++14
50 / 100
 927 ms 8356 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int maxn = 2000 + 10;
const ll inf = 1e18;

bool g[maxn][maxn], cp[maxn][maxn];
ll a[maxn], dp[110][110];
int pd[maxn];

int shortest_path(int n, int A, int B){
	if (A == 1){
		for (int i = 1; i <= n; i++)
			pd[i] = n + 1;
		pd[0] = 0;
		for (int i = 1; i <= n; i++)
			for (int j = 0; j < i; j++)
				if (g[j][i])
					pd[i] = min(pd[i], pd[j] + 1);
		return pd[n] <= B;
	}
	memset(dp, 0, sizeof dp);
	dp[0][0] = 1;
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= B; j++)
			for (int k = i - 1; k >= 0; k--)
				dp[i][j] |= dp[k][j - 1];
	int ret = 0;
	for (int i = A; i <= B; i++)
		ret |= dp[n][i];
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false);
	int n, A, B;
	cin >> n >> A >> B;
	for (int i = 1; i <= n; i++){
		cin >> a[i];
		a[i] += a[i - 1];
	}
	for (int i = 0; i <= n; i++)
		for (int j = i + 1; j <= n; j++)
			g[i][j] = 1;
	ll untilnow = 0;
	for (int i = 60; i >= 0; i--){
		for (int j = 0; j <= n; j++)
			for (int k = 0; k <= n; k++)
				cp[j][k] = g[j][k];
		for (int j = 0; j <= n; j++)
			for (int k = j + 1; k <= n; k++)
				if ((a[k] - a[j]) & (1ll << i))
					g[j][k] = 0;
		if (!shortest_path(n, A, B)){
			untilnow += (1ll << i);
			for (int j = 0; j <= n; j++)
				for (int k = 0; k <= n; k++)
					g[j][k] = cp[j][k];
		}
	}
	cout << untilnow << endl;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Incorrect 3 ms 512 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 4 ms 460 KB Output is correct
8 Correct 3 ms 512 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 27 ms 384 KB Output is correct
13 Correct 3 ms 256 KB Output is correct
14 Incorrect 3 ms 512 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #3
21.0 / 21.0

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

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Incorrect 2 ms 512 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #5
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 3 ms 428 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 3 ms 556 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 2 ms 300 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 7 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 2 ms 512 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 3 ms 512 KB Output is correct
27 Correct 3 ms 512 KB Output is correct
28 Correct 3 ms 512 KB Output is correct
29 Correct 3 ms 512 KB Output is correct
30 Correct 3 ms 512 KB Output is correct
31 Correct 3 ms 512 KB Output is correct
32 Correct 4 ms 640 KB Output is correct
33 Correct 3 ms 512 KB Output is correct
34 Correct 3 ms 512 KB Output is correct
35 Correct 4 ms 640 KB Output is correct
36 Correct 4 ms 640 KB Output is correct
37 Correct 5 ms 640 KB Output is correct
38 Correct 5 ms 768 KB Output is correct
39 Correct 4 ms 768 KB Output is correct
40 Correct 4 ms 768 KB Output is correct
41 Correct 4 ms 768 KB Output is correct
42 Correct 4 ms 768 KB Output is correct
43 Correct 4 ms 640 KB Output is correct
44 Correct 4 ms 640 KB Output is correct
45 Correct 4 ms 640 KB Output is correct
46 Correct 5 ms 768 KB Output is correct
47 Correct 4 ms 768 KB Output is correct
48 Correct 3 ms 768 KB Output is correct
49 Correct 5 ms 768 KB Output is correct
50 Correct 4 ms 768 KB Output is correct
51 Correct 6 ms 768 KB Output is correct
52 Correct 69 ms 2560 KB Output is correct
53 Correct 126 ms 3452 KB Output is correct
54 Correct 195 ms 4344 KB Output is correct
55 Correct 239 ms 4352 KB Output is correct
56 Correct 895 ms 8192 KB Output is correct
57 Correct 927 ms 8284 KB Output is correct
58 Correct 724 ms 8312 KB Output is correct
59 Correct 624 ms 8292 KB Output is correct
60 Correct 595 ms 8316 KB Output is correct
61 Correct 4 ms 768 KB Output is correct
62 Correct 94 ms 3328 KB Output is correct
63 Correct 209 ms 4344 KB Output is correct
64 Correct 185 ms 4344 KB Output is correct
65 Correct 407 ms 6008 KB Output is correct
66 Correct 522 ms 7416 KB Output is correct
67 Correct 715 ms 8356 KB Output is correct
68 Correct 882 ms 8316 KB Output is correct
69 Correct 794 ms 8284 KB Output is correct