답안 #972596

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
972596	2024-04-30T17:27:52 Z	Halym2007	Bali Sculptures (APIO15_sculpture)	C++17	50 / 100	62 ms	856 KB

sculpture

#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 2e3 + 5;
ll n, A, B, dp[N], a[N], dp1[105][105];
bool check (ll x) {
	for (int i = 1; i <= n; ++i) {
		dp[i] = 1e9;
	}
	for (int i = 1; i <= n; ++i) {
		ll sum = 0;
		for (int j = i; j > 0; j--) {
			sum += a[j];
			if ((sum & x) == sum) {
				dp[i] = min (dp[i], dp[j - 1] + 1);
			}
		}
	}
	return dp[n] <= B;
}



bool check1 (ll x) {
	for (int i = 0; i <= n; ++i) {
		for (int j = 0; j <= n; ++j) {
			dp1[i][j] = 1e9;
		}
	}
	dp1[0][0] = 0;
//	if (x == 5) {
//		cout << dp1[2][1]
//	}
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= i; ++j) {
			ll sum = 0;
			for (int k = i; k > 0; k--) {
				sum += a[k];
				
				if ((sum & x) == sum) {
					dp1[i][j] = min (dp1[i][j], dp1[k - 1][j - 1] + 1);
//					if (x == 5 and i == 2 and j == 1) {
//						cout << "men : " << k << " " << sum;
//						exit(0);
//					}	
				}
			}
		}
	}
//	if (x == 5) {
//		for (int i = 1; i <= n; ++i) {
//			for (int j = 1; j <= i; ++j) {
//				cout << i << " " << j << " -- >"  << dp1[i][j] << "\n";
//			}
//		}
//		exit(0);
//	}
//	return 0;
	for (int i = A; i <= B; ++i) {
		if (dp1[n][i] != 1e9) return 1;
		return 0; 
	}
}

int main () {
//	freopen ("input.txt", "r", stdin);
	cin >> n >> A >> B;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i];
	}
	ll x = (1LL << 42) - 1;
	for (int i = 41; i >= 0; i--) {
		x ^= (1LL << i);
		if ((A == 1 and !check(x)) or (A > 1 and !check1(x))) {
			x ^= (1LL << i);
		}
	}
	cout << x << "\n";
}

Compilation message

sculpture.cpp: In function 'bool check1(long long int)':
sculpture.cpp:63:1: warning: control reaches end of non-void function [-Wreturn-type]
   63 | }
      | ^

Subtask #1

0 / 9.0

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

Subtask #2

0 / 16.0

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

Subtask #3

21.0 / 21.0

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

Subtask #4

0 / 25.0

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

Subtask #5

29.0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	1 ms	344 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	344 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	1 ms	348 KB	Output is correct
38	Correct	0 ms	344 KB	Output is correct
39	Correct	1 ms	348 KB	Output is correct
40	Correct	1 ms	344 KB	Output is correct
41	Correct	1 ms	344 KB	Output is correct
42	Correct	1 ms	348 KB	Output is correct
43	Correct	0 ms	356 KB	Output is correct
44	Correct	1 ms	352 KB	Output is correct
45	Correct	1 ms	348 KB	Output is correct
46	Correct	1 ms	348 KB	Output is correct
47	Correct	1 ms	348 KB	Output is correct
48	Correct	1 ms	348 KB	Output is correct
49	Correct	1 ms	348 KB	Output is correct
50	Correct	1 ms	348 KB	Output is correct
51	Correct	1 ms	348 KB	Output is correct
52	Correct	6 ms	344 KB	Output is correct
53	Correct	9 ms	464 KB	Output is correct
54	Correct	17 ms	348 KB	Output is correct
55	Correct	16 ms	464 KB	Output is correct
56	Correct	58 ms	344 KB	Output is correct
57	Correct	58 ms	348 KB	Output is correct
58	Correct	56 ms	344 KB	Output is correct
59	Correct	56 ms	348 KB	Output is correct
60	Correct	59 ms	452 KB	Output is correct
61	Correct	1 ms	344 KB	Output is correct
62	Correct	9 ms	468 KB	Output is correct
63	Correct	18 ms	348 KB	Output is correct
64	Correct	15 ms	348 KB	Output is correct
65	Correct	30 ms	348 KB	Output is correct
66	Correct	47 ms	348 KB	Output is correct
67	Correct	58 ms	344 KB	Output is correct
68	Correct	62 ms	344 KB	Output is correct
69	Correct	57 ms	344 KB	Output is correct