oj.uz

답안 #104797

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
104797 2019-04-09T09:31:45 Z ekrem Bali Sculptures (APIO15_sculpture) C++
50 / 100
 186 ms 640 KB 
#include <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define inf 1000000007
#define N 1000005
using namespace std;

typedef long long ll;

ll n, X, y, ans, a[N], dp[N], dpp[105][105], pre[N];

bool bak(ll x){
	for(int i = 1; i <= n; i++)
		dp[i] = inf;

	for(int i = 0; i < 105; i++)
		for(int j = 0; j < 105; j++)
			dpp[i][j] = 0;
	dpp[0][0] = 1;

	for(int i = 1; i <= n; i++)
		for(int j = 0; j < n; j++){
			ll su = pre[i] - pre[j];
			if(su - (x&su) == 0 ){


				if(n <= 100){
					for(int k = 1; k < 105; k++)
						dpp[i][k] |= dpp[j][k - 1];
				}
				dp[i] = min(dp[i], dp[j] + 1);
			}
		}
	if(n <= 100)
		for(int i = X; i <= y; i++)
			if(dpp[n][i])
				return 1;
	// cout << x << " " << dpp[n] << endl;
	return dp[n] <= y;
}

int main() {
	// freopen("in.txt", "r", stdin);
	// freopen("out.txt", "w", stdout);
	scanf("%lld %lld %lld",&n ,&X ,&y);
	for(int i = 1; i <= n; i++){
		scanf("%lld",a + i);
		pre[i] = pre[i - 1] + a[i];
	}
	ans = (1ll<<45) - 1;
	for(int i = 44; i >= 0; i--){
		if(bak(ans - (1ll<<i))){
			// cout << ans << " " << i << endl;
			ans -= (1ll<<i);
		}
	}
	printf("%lld\n", ans);
	return 0;
}

Compilation message

sculpture.cpp: In function 'int main()':
sculpture.cpp:47:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld %lld %lld",&n ,&X ,&y);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sculpture.cpp:49:8: 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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 4 ms 512 KB Output is correct
8 Correct 4 ms 512 KB Output is correct
9 Correct 4 ms 512 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 5 ms 512 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Incorrect 2 ms 512 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 4 ms 512 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 4 ms 256 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 5 ms 512 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Incorrect 3 ms 384 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 3 ms 640 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 4 ms 512 KB Output is correct
8 Correct 4 ms 512 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 7 ms 384 KB Output is correct
17 Correct 6 ms 384 KB Output is correct
18 Correct 8 ms 512 KB Output is correct
19 Correct 9 ms 484 KB Output is correct
20 Correct 10 ms 512 KB Output is correct
21 Correct 8 ms 512 KB Output is correct
22 Correct 7 ms 512 KB Output is correct
23 Correct 7 ms 384 KB Output is correct
24 Correct 7 ms 384 KB Output is correct
25 Correct 10 ms 512 KB Output is correct
26 Correct 13 ms 512 KB Output is correct
27 Correct 23 ms 512 KB Output is correct
28 Correct 20 ms 512 KB Output is correct
29 Correct 18 ms 512 KB Output is correct
30 Correct 25 ms 504 KB Output is correct
31 Correct 24 ms 512 KB Output is correct
32 Correct 24 ms 512 KB Output is correct

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 18 ms 512 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 4 ms 512 KB Output is correct
9 Correct 4 ms 512 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 4 ms 512 KB Output is correct
13 Correct 4 ms 356 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Incorrect 3 ms 384 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #5
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 512 KB Output is correct
2 Correct 3 ms 540 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 4 ms 512 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 3 ms 512 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 3 ms 512 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 3 ms 512 KB Output is correct
18 Correct 3 ms 512 KB Output is correct
19 Correct 4 ms 512 KB Output is correct
20 Correct 4 ms 512 KB Output is correct
21 Correct 3 ms 512 KB Output is correct
22 Correct 3 ms 384 KB Output is correct
23 Correct 5 ms 512 KB Output is correct
24 Correct 4 ms 512 KB Output is correct
25 Correct 4 ms 384 KB Output is correct
26 Correct 6 ms 384 KB Output is correct
27 Correct 8 ms 512 KB Output is correct
28 Correct 8 ms 484 KB Output is correct
29 Correct 8 ms 640 KB Output is correct
30 Correct 9 ms 384 KB Output is correct
31 Correct 8 ms 512 KB Output is correct
32 Correct 9 ms 512 KB Output is correct
33 Correct 7 ms 512 KB Output is correct
34 Correct 8 ms 512 KB Output is correct
35 Correct 13 ms 512 KB Output is correct
36 Correct 15 ms 512 KB Output is correct
37 Correct 18 ms 512 KB Output is correct
38 Correct 26 ms 384 KB Output is correct
39 Correct 19 ms 476 KB Output is correct
40 Correct 30 ms 384 KB Output is correct
41 Correct 19 ms 504 KB Output is correct
42 Correct 25 ms 512 KB Output is correct
43 Correct 5 ms 512 KB Output is correct
44 Correct 7 ms 512 KB Output is correct
45 Correct 8 ms 512 KB Output is correct
46 Correct 9 ms 384 KB Output is correct
47 Correct 8 ms 512 KB Output is correct
48 Correct 8 ms 512 KB Output is correct
49 Correct 10 ms 512 KB Output is correct
50 Correct 10 ms 384 KB Output is correct
51 Correct 3 ms 384 KB Output is correct
52 Correct 19 ms 384 KB Output is correct
53 Correct 26 ms 384 KB Output is correct
54 Correct 46 ms 512 KB Output is correct
55 Correct 44 ms 384 KB Output is correct
56 Correct 155 ms 632 KB Output is correct
57 Correct 139 ms 512 KB Output is correct
58 Correct 183 ms 512 KB Output is correct
59 Correct 157 ms 632 KB Output is correct
60 Correct 140 ms 512 KB Output is correct
61 Correct 4 ms 512 KB Output is correct
62 Correct 25 ms 512 KB Output is correct
63 Correct 44 ms 512 KB Output is correct
64 Correct 39 ms 384 KB Output is correct
65 Correct 80 ms 504 KB Output is correct
66 Correct 111 ms 544 KB Output is correct
67 Correct 149 ms 548 KB Output is correct
68 Correct 186 ms 632 KB Output is correct
69 Correct 150 ms 512 KB Output is correct