Submission #492582

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
492582	2021-12-08T04:19:53 Z	PoPularPlusPlus	Bali Sculptures (APIO15_sculpture)	C++17	71 / 100	42 ms	388 KB

sculpture

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long 
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const int mod = 1000000007; 
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;
bool remender(ll a , ll b){return a%b;}

void solve(){
	int n;
	cin >> n;
	int a , b;
	cin >> a >> b;
	ll arr[n + 1];
	for(int i = 1; i <= n; i++)cin >> arr[i];
	if(n <= 100){
		ll dp[n + 1][b + 1];
		ll cur = 0;
		ll ans = 0;
		ll sum;
		for(ll bit = 39; bit >= 0; bit--){
			memset(dp,-1,sizeof dp);
			dp[0][0] = 1;
			cur += 1LL << bit;
			for(int i = 1; i <= n; i++){
				sum = 0;
				for(int j = 1; j <= min(i , b); j++){
					sum = 0;
					for(int k = i; k > 0; k--){
						sum += arr[k];
						if((sum & cur) == 0)dp[i][j] = max(dp[i][j] , dp[k-1][j-1]);
					}
				}
			}
			int possible = 0;
			for(int j = a; j <= b; j++){
				if(dp[n][j] != -1){
					possible = 1;
				}
			}
			if(possible == 0){
				cur -= 1LL << bit;
				ans += 1LL << bit;
			}
		}
		cout << ans << '\n';
	}
	else {
		ll ans = 0;
		ll cur = 0;
		ll sum;
		int dp[n + 1];
		memset(dp,-1,sizeof dp);
		for(ll bit = 39; bit >= 0; bit--){
			cur += 1LL << bit;
			memset(dp,-1,sizeof dp);
			dp[0] = 0;
			for(int i = 1; i <= n; i++){
				sum = 0;
				for(int j = i; j > 0; j--){
					sum += arr[j];
					if((sum & cur) == 0 && dp[j-1] != -1){
						if(dp[i]!=-1)dp[i] = min(dp[i] , dp[j-1] + 1);
						else dp[i] = dp[j] + 1;
					}
				}
			}
			if(dp[n] > b || dp[n] == -1){
				cur -= 1LL << bit;
				ans += 1LL << bit;
			}
		}
		cout << ans << '\n';
	}
}

int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
	//int t;cin >> t;while(t--)
	solve();
	return 0;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
25.0 / 25.0

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

Subtask #5
0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	224 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	0 ms	204 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	1 ms	204 KB	Output is correct
24	Correct	1 ms	204 KB	Output is correct
25	Correct	1 ms	204 KB	Output is correct
26	Correct	1 ms	204 KB	Output is correct
27	Correct	2 ms	204 KB	Output is correct
28	Correct	3 ms	312 KB	Output is correct
29	Correct	3 ms	204 KB	Output is correct
30	Correct	1 ms	204 KB	Output is correct
31	Correct	3 ms	204 KB	Output is correct
32	Correct	2 ms	204 KB	Output is correct
33	Correct	3 ms	204 KB	Output is correct
34	Correct	3 ms	204 KB	Output is correct
35	Correct	3 ms	204 KB	Output is correct
36	Correct	7 ms	204 KB	Output is correct
37	Correct	22 ms	344 KB	Output is correct
38	Correct	41 ms	360 KB	Output is correct
39	Correct	38 ms	332 KB	Output is correct
40	Correct	1 ms	204 KB	Output is correct
41	Correct	23 ms	340 KB	Output is correct
42	Correct	32 ms	332 KB	Output is correct
43	Correct	2 ms	204 KB	Output is correct
44	Correct	4 ms	204 KB	Output is correct
45	Correct	11 ms	332 KB	Output is correct
46	Correct	17 ms	380 KB	Output is correct
47	Correct	17 ms	380 KB	Output is correct
48	Correct	1 ms	204 KB	Output is correct
49	Correct	20 ms	384 KB	Output is correct
50	Correct	20 ms	332 KB	Output is correct
51	Incorrect	1 ms	204 KB	Output isn't correct
52	Halted	0 ms	0 KB	-

Submission #492582

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 16.0 / 16.0

Subtask #3 21.0 / 21.0

Subtask #4 25.0 / 25.0

Subtask #5 0 / 29.0

Subtask #1
9.0 / 9.0

Subtask #2
16.0 / 16.0

Subtask #3
21.0 / 21.0

Subtask #4
25.0 / 25.0

Subtask #5
0 / 29.0