oj.uz

Submission #25035

# Submission time Handle Problem Language Result Execution time Memory
25035 2017-06-20T04:47:01 Z 김종범(#1056) Bali Sculptures (APIO15_sculpture) C++14
37 / 100
 6 ms 3204 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 = 31;
int N, A, B, Nr[MAX_N];
bool Dy4[MAX_N][MAX_N];
int main() {
	cin >> N >> A >> B;
	for(int i=1; i<=N; i++) scanf("%d", &Nr[i]);

	int memo = 0, ans = 0;
	for(int s=LOG_NR-1; s>=0; s--) {
		if(N <= 100) {
			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++) {
				int now = 0;
				for(int j=i; j>=1; j--) {
					now += Nr[j];
					if(now > 1e9) break;
					if(now & memo) continue;
					if( (now & (1<<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 += (1 << s);
					isZero = true;
					break;
				}
			if(!isZero) ans += (1 << s);
		} else {
			puts("Sorry");
		}
	}
	printf("%d\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
0 / 9.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
0 / 25.0

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

Subtask #5
0 / 29.0

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