oj.uz

Submission #25011

# Submission time Handle Problem Language Result Execution time Memory
25011 2017-06-20T03:56:26 Z 김동현(#1052) Bali Sculptures (APIO15_sculpture) C++
37 / 100
 3 ms 3620 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const ll inf = 1e18;
int n, a, b;
ll s[2010], dp[101][2010], ans = inf;

int main(){
	scanf("%d%d%d", &n, &a, &b);
	for(int i = 1; i <= n; i++){ scanf("%lld", s + i); s[i] += s[i - 1]; }
	if(n <= 100){
		ans = (1LL << 50) - 1;
		for(int u = 49; u >= 0; u--){
			fill(dp[0] + 1, dp[0] + n + 1, 0);
			dp[0][0] = 1;
			ans -= (1LL << u);
			for(int i = 1; i <= b; i++){
				for(int j = i; j <= n; j++){
					dp[i][j] = 0;
					for(int k = i - 1; k < j; k++){
						if(dp[i - 1][k] && (ans | (s[j] - s[k])) == ans){ dp[i][j] = 1; break; }
					}
				}
			}
			int fl = 0;
			for(int i = a; i <= b; i++) if(dp[i][n]){ fl = 1; break; }
			if(!fl) ans += (1 << u);
		}
		printf("%lld\n", ans);
	}
	else{
		puts("0");
	}
}

Compilation message

sculpture.cpp: In function 'int main()':
sculpture.cpp:10:29: 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:11:51: 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", s + i); s[i] += s[i - 1]; }
                                                   ^

Subtask #1
0 / 9.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
0 / 25.0

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

Subtask #5
0 / 29.0

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