oj.uz

Submission #469967

# Submission time Handle Problem Language Result Execution time Memory
469967 2021-09-02T13:00:00 Z luciocf Bali Sculptures (APIO15_sculpture) C++14
71 / 100
 1000 ms 736 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int maxn = 2e3+10;
const int inf = 1e9;

int n;
int a[maxn];

ll pref[maxn];

int dp[maxn][maxn];

bool bad(ll s, ll mask, int pos)
{
	for (int i = 60; i >= pos; i--)
		if ((!(mask&(1ll<<i))) && (s&(1ll<<i)))
			return 1;

	return 0;
}

int main(void)
{
	int A, B;
	scanf("%d %d %d", &n, &A, &B);

	for (int i = 1; i <= n; i++)
	{
		scanf("%d", &a[i]);

		pref[i] = pref[i-1] + 1ll*a[i]; 
	}

	if (A != 1)
	{
		ll mask = 0;

		for (int b = 60; b >= 0; b--)
		{
			dp[0][0] = 1;

			for (int i = 0; i <= n; i++)
				for (int j = 1; j <= n; j++)
					dp[i][j] = 0;

			for (int k = 1; k <= n; k++)
			{
				for (int i = 1; i <= n; i++)
				{
					for (int j = i; j >= 1; j--)
					{
						ll s = pref[i] - pref[j-1];

						if (dp[k-1][j-1] && !bad(s, mask, b))
							dp[k][i] = 1;
					}
				}
			}


			bool ok = 0;
			for (int i = A; i <= B; i++)
				if (dp[i][n])
					ok = 1;

			if (!ok) mask += (1ll<<b);
		}

		printf("%lld\n", mask);

		return 0;
	}


	ll mask = 0;

	for (int b = 60; b >= 0; b--)
	{
		for (int i = 1; i <= n; i++)
			dp[0][i] = inf;

		for (int i = 1; i <= n; i++)
		{
			for (int j = i; j >= 1; j--)
			{
				ll s = pref[i] - pref[j-1];

				if (dp[0][j-1] != inf && !bad(s, mask, b))
					dp[0][i] = min(dp[0][i], dp[0][j-1] + 1);
			}
		}

		if (dp[0][n] > B) mask += (1ll<<b);
	}

	printf("%lld\n", mask);
}

Compilation message

sculpture.cpp: In function 'int main()':
sculpture.cpp:29:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |  scanf("%d %d %d", &n, &A, &B);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
sculpture.cpp:33:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |   scanf("%d", &a[i]);
      |   ~~~~~^~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
25.0 / 25.0

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

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 2 ms 204 KB Output is correct
27 Correct 2 ms 204 KB Output is correct
28 Correct 3 ms 204 KB Output is correct
29 Correct 3 ms 204 KB Output is correct
30 Correct 3 ms 204 KB Output is correct
31 Correct 3 ms 204 KB Output is correct
32 Correct 3 ms 204 KB Output is correct
33 Correct 3 ms 204 KB Output is correct
34 Correct 3 ms 204 KB Output is correct
35 Correct 4 ms 204 KB Output is correct
36 Correct 6 ms 308 KB Output is correct
37 Correct 7 ms 304 KB Output is correct
38 Correct 8 ms 300 KB Output is correct
39 Correct 9 ms 204 KB Output is correct
40 Correct 10 ms 300 KB Output is correct
41 Correct 9 ms 304 KB Output is correct
42 Correct 8 ms 304 KB Output is correct
43 Correct 2 ms 204 KB Output is correct
44 Correct 4 ms 204 KB Output is correct
45 Correct 3 ms 204 KB Output is correct
46 Correct 3 ms 204 KB Output is correct
47 Correct 6 ms 204 KB Output is correct
48 Correct 3 ms 204 KB Output is correct
49 Correct 5 ms 204 KB Output is correct
50 Correct 6 ms 204 KB Output is correct
51 Correct 6 ms 204 KB Output is correct
52 Correct 162 ms 204 KB Output is correct
53 Correct 118 ms 312 KB Output is correct
54 Correct 696 ms 312 KB Output is correct
55 Correct 469 ms 324 KB Output is correct
56 Correct 994 ms 332 KB Output is correct
57 Correct 785 ms 332 KB Output is correct
58 Execution timed out 1086 ms 332 KB Time limit exceeded
59 Halted 0 ms 0 KB -