oj.uz

Submission #25044

# Submission time Handle Problem Language Result Execution time Memory
25044 2017-06-20T04:55:15 Z 김종범(#1056) Bali Sculptures (APIO15_sculpture) C++14
71 / 100
 99 ms 3208 KB 
#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define REPO(i,n) for(int (i)=1; (i)<=(int)(n); (i)++)
#define SZ(v) ((int)(v).size())
#define ALL(v) (v).begin(),(v).end()
#define one first
#define two second
typedef long long ll;
typedef pair<int, int> pi;
const int INF = 0x3f2f1f0f;
const ll LINF = 1ll * INF * INF;

const int MAX_N = 1e3 + 100, LOG_NR = 43;
int N, A, B, Nr[MAX_N];
bool Dy4[MAX_N][MAX_N]; int Dy5[MAX_N];
int main() {
	cin >> N >> A >> B;
	for(int i=1; i<=N; i++) scanf("%d", &Nr[i]);

	ll memo = 0, ans = 0;
	for(int s=LOG_NR-1; s>=0; s--) {
		if(N <= 100 && A != 1) {
			for(int i=0; i<=N; i++) for(int j=0; j<=N; j++) Dy4[i][j] = false;
			Dy4[0][0] = true;
			for(int i=1; i<=N; i++) {
				ll now = 0;
				for(int j=i; j>=1; j--) {
					now += Nr[j];
					if(now & memo) continue;
					if( (now & (1ll << s)) == 0)
						for(int k=0; k<=min(B, j-1); k++) 
							if(Dy4[k][j-1])
								Dy4[k+1][i] = true;
				}
			}
			bool isZero = false;
			for(int k=A; k<=B; k++) 
				if(Dy4[k][N]) {
					memo += (1ll << s);
					isZero = true;
					break;
				}
			if(!isZero) ans += (1ll << s);
		} else {
			for(int i=0; i<=N; i++) Dy5[i] = INF;
			Dy5[0] = 0;
			for(int i=1; i<=N; i++) {
				ll now = 0;
				for(int j=i; j>=1; j--) {
					now += Nr[j];
					if(now & memo) continue;
					if((now & (1ll << s)) == 0)
						Dy5[i] = min(Dy5[i], Dy5[j-1] + 1);
				}
			}
			bool isZero = false;
			if(Dy5[N] <= B) {
				memo += (1ll << s);
				isZero = true;
			}
			if(!isZero) ans += (1ll << s);
		}
	}
	printf("%lld\n", ans);
	return 0;
}

Compilation message

sculpture.cpp: In function 'int main()':
sculpture.cpp:21:45: 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("%d", &Nr[i]);
                                             ^

Subtask #1
9.0 / 9.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
25.0 / 25.0

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

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3208 KB Output is correct
2 Correct 0 ms 3208 KB Output is correct
3 Correct 0 ms 3208 KB Output is correct
4 Correct 0 ms 3208 KB Output is correct
5 Correct 0 ms 3208 KB Output is correct
6 Correct 0 ms 3208 KB Output is correct
7 Correct 0 ms 3208 KB Output is correct
8 Correct 0 ms 3208 KB Output is correct
9 Correct 0 ms 3208 KB Output is correct
10 Correct 0 ms 3208 KB Output is correct
11 Correct 0 ms 3208 KB Output is correct
12 Correct 0 ms 3208 KB Output is correct
13 Correct 0 ms 3208 KB Output is correct
14 Correct 0 ms 3208 KB Output is correct
15 Correct 0 ms 3208 KB Output is correct
16 Correct 0 ms 3208 KB Output is correct
17 Correct 0 ms 3208 KB Output is correct
18 Correct 0 ms 3208 KB Output is correct
19 Correct 0 ms 3208 KB Output is correct
20 Correct 0 ms 3208 KB Output is correct
21 Correct 0 ms 3208 KB Output is correct
22 Correct 0 ms 3208 KB Output is correct
23 Correct 0 ms 3208 KB Output is correct
24 Correct 0 ms 3208 KB Output is correct
25 Correct 0 ms 3208 KB Output is correct
26 Correct 0 ms 3208 KB Output is correct
27 Correct 0 ms 3208 KB Output is correct
28 Correct 0 ms 3208 KB Output is correct
29 Correct 0 ms 3208 KB Output is correct
30 Correct 0 ms 3208 KB Output is correct
31 Correct 0 ms 3208 KB Output is correct
32 Correct 0 ms 3208 KB Output is correct
33 Correct 0 ms 3208 KB Output is correct
34 Correct 0 ms 3208 KB Output is correct
35 Correct 0 ms 3208 KB Output is correct
36 Correct 0 ms 3208 KB Output is correct
37 Correct 0 ms 3208 KB Output is correct
38 Correct 0 ms 3208 KB Output is correct
39 Correct 0 ms 3208 KB Output is correct
40 Correct 0 ms 3208 KB Output is correct
41 Correct 0 ms 3208 KB Output is correct
42 Correct 0 ms 3208 KB Output is correct
43 Correct 0 ms 3208 KB Output is correct
44 Correct 0 ms 3208 KB Output is correct
45 Correct 0 ms 3208 KB Output is correct
46 Correct 0 ms 3208 KB Output is correct
47 Correct 0 ms 3208 KB Output is correct
48 Correct 0 ms 3208 KB Output is correct
49 Correct 0 ms 3208 KB Output is correct
50 Correct 0 ms 3208 KB Output is correct
51 Correct 0 ms 3208 KB Output is correct
52 Correct 9 ms 3208 KB Output is correct
53 Correct 13 ms 3208 KB Output is correct
54 Correct 33 ms 3208 KB Output is correct
55 Correct 29 ms 3208 KB Output is correct
56 Runtime error 99 ms 3208 KB Execution timed out (wall clock limit exceeded)
57 Halted 0 ms 0 KB -