oj.uz

Submission #25027

# Submission time Handle Problem Language Result Execution time Memory
25027 2017-06-20T04:34:33 Z 서규호(#1053) Bali Sculptures (APIO15_sculpture) C++
21 / 100
 1000 ms 2068 KB 
#include <bits/stdc++.h>

#define lld long long
#define pp pair<int,int>
#define pb push_back
#define MOD 10007
#define left lleft
#define right rright
#define INF 2000000000
#define LINF 1000000000000000000LL
#define next nnext

using namespace std;

int N,A,B;
lld a[2002],sum[2002],ans;
int d[2002];
bool check[102][102];

bool process(lld big,lld divide){
	lld notbig;
	notbig = big/divide;
	notbig = (1LL<<42)/divide-1-notbig;
	if(A == 1){
		for(int i=1; i<=N; i++){
			d[i] = INF;
			for(int j=i; j>=1; j--){
				if(sum[i]-sum[j-1] >= big+divide) break;
				if((((sum[i]-sum[j-1])/divide)&notbig) != 0) continue;
				d[i] = min(d[i],d[j-1]+1);
			}
		}
		return d[N] <= B;
	}
	return false;
}

int main(){
	scanf("%d %d %d",&N,&A,&B);
	for(int i=1; i<=N; i++){
		scanf("%lld",&a[i]);
		sum[i] = sum[i-1]+a[i];
	}
	for(int i=41; i>=0; i--){
		if(!process(ans,(1LL<<i))){
			ans += (1LL<<i);
		}
	}
	printf("%lld\n",ans);

	return 0;
}

Compilation message

sculpture.cpp: In function 'int main()':
sculpture.cpp:39:28: 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:41:22: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld",&a[i]);
                      ^

Subtask #1
0 / 9.0

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

Subtask #2
0 / 16.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
0 / 25.0

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

Subtask #5
0 / 29.0

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