oj.uz

Submission #25493

# Submission time Handle Problem Language Result Execution time Memory
25493 2017-06-22T12:44:07 Z gabrielsimoes Bali Sculptures (APIO15_sculpture) C++14
100 / 100
 149 ms 9864 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef signed char sc;
typedef long long ll;
 
const int MAXN = 2001;
const sc MINLOG = -1;
const sc MAXLOG = 44;
#define most(a) (63 - __builtin_clzll(a))
#define sum(i, j) (v[j] - v[i-1])
 
int N, A, B;
ll v[MAXN]; 
ll x;

sc cost(int i, int j) {
	ll a = sum(i,j)&~x;
	if (a != 0) return most(a);
	else return MINLOG;
}

bool ok[MAXN][MAXN];
sc dp[MAXN][MAXN]; 
sc f(int i, int g) {
	if (i > N)
		return (g < A | g > B)?MAXLOG:MINLOG;
 
	if (ok[i][g]) return dp[i][g];
	ok[i][g] = 1;
 
	dp[i][g] = MAXLOG;
	for (int j = i; j <= N; j++)
		dp[i][g] = min(dp[i][g], max(cost(i, j), f(j+1, g+1)));
 
	return dp[i][g];
}

bool oka1[MAXN];
int dpa1[MAXN];
int fa1(int i) {
	if (i > N) return 0;
	if (oka1[i]) return dpa1[i];
	oka1[i] = 1;
 
	dpa1[i] = MAXN;
	for (int j = i; j <= N; j++)
		if ((sum(i,j)|x) == x)
			dpa1[i] = min(dpa1[i], 1 + fa1(j+1));
 
	return dpa1[i];
}
 
int main()
{
	scanf("%d %d %d", &N, &A, &B);
	for (int i = 1; i <= N; i++)
		scanf("%d", &x), v[i] = v[i-1] + x;
		
	if (A != 1) {
		sc lim = most(v[N]) + 1;
		x = 0;		
		while (lim > 0) {
			memset(ok, 0, sizeof(ok));
			lim = f(1,0);
			if (lim != MINLOG)
				x |= (1LL << lim);
		}
	} else {
		sc lim = most(v[N]) + 1;
		x = (1LL << lim) - 1;
		for (int i = lim-1; i >= 0; i--) {
			memset(oka1, 0, sizeof(oka1));
			x ^= (1LL << i);
			if (fa1(1) > B)
				x ^= (1LL << i);
		}
	}
			
	printf("%lld\n", x);
}

Compilation message

sculpture.cpp: In function 'sc f(int, int)':
sculpture.cpp:27:13: warning: suggest parentheses around comparison in operand of '|' [-Wparentheses]
   return (g < A | g > B)?MAXLOG:MINLOG;
             ^
sculpture.cpp: In function 'int main()':
sculpture.cpp:58:17: warning: format '%d' expects argument of type 'int*', but argument 2 has type 'll* {aka long long int*}' [-Wformat=]
   scanf("%d", &x), v[i] = v[i-1] + x;
                 ^
sculpture.cpp:56:31: 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:37: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &x), v[i] = v[i-1] + x;
                                     ^

Subtask #1
9.0 / 9.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
25.0 / 25.0

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

Subtask #5
29.0 / 29.0

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