답안 #531024

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
531024	2022-02-27T11:14:14 Z	new_acc	Bali Sculptures (APIO15_sculpture)	C++14	50 / 100	165 ms	456 KB

sculpture

#include<bits/stdc++.h>
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<ll> vl;
const int N=2e3+10;
int dp[N];
int dp2[N][N],t[N];
ll sum[N][N];
int n,a,b;
int single(ll curr){
	for(int i=n;i>=1;i--){
		ll sum=0;
		dp[i]=n+1;
		for(int j=i;j<=n;j++){
			sum+=t[j];
			if((sum|curr)==curr) dp[i]=min(dp[i],dp[j+1]+1);
		}
	}
	return dp[1];
}
int single2(ll curr){
	for(int i=1;i<=n;i++) dp2[n+1][i]=n+1;
	for(int i=n;i>=1;i--){
		for(int j=1;j<=(n-i+1);j++){
			dp2[i][j]=n+1;
			ll sum=0;
			for(int k=i;k<=n;k++){
				sum+=t[k];
				if((sum|curr)==curr){
					if(j-1==0){
						if(k+1==n+1) dp2[i][j]=1;
						else dp2[i][j]=min(dp2[i][j],dp2[k+1][1]);
					}else dp2[i][j]=min(dp2[i][j],dp2[k+1][j-1]);
				}
			}
		}
	}
	return dp2[1][a];
}
void solve(){
	cin>>n>>a>>b;
	for(int i=1;i<=n;i++) cin>>t[i];
	if(a==1){
		ll curr=(1LL<<50)-1;
		for(int i=49;i>=0;i--) if(single(curr-(1LL<<i))<=b) curr-=(1LL<<i);
		cout<<curr<<"\n";
	}else{
		ll curr=(1LL<<50)-1;
		for(int i=49;i>=0;i--) if(single2(curr-(1LL<<i))<=b) curr-=(1LL<<i);
		cout<<curr<<"\n";
	}
}
int main(){
	ios_base::sync_with_stdio(0),cin.tie(0);
	solve();
}

Subtask #1
0 / 9.0

#	결과	실행 시간	메모리	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	1 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	1 ms	384 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 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	0 ms	204 KB	Output is correct
14	Incorrect	1 ms	332 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #2
0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	0 ms	332 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	1 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	332 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Incorrect	0 ms	332 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #3
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	280 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	332 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	1 ms	332 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 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	1 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	332 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	332 KB	Output is correct
21	Correct	1 ms	204 KB	Output is correct
22	Correct	1 ms	220 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	332 KB	Output is correct
27	Correct	1 ms	204 KB	Output is correct
28	Correct	2 ms	204 KB	Output is correct
29	Correct	1 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	1 ms	204 KB	Output is correct

Subtask #4
0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	332 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	0 ms	332 KB	Output is correct
6	Correct	0 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	1 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	0 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Incorrect	1 ms	332 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #5
29.0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	332 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	332 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	1 ms	204 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	332 KB	Output is correct
18	Correct	0 ms	204 KB	Output is correct
19	Correct	1 ms	332 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	332 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	332 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	332 KB	Output is correct
30	Correct	1 ms	204 KB	Output is correct
31	Correct	1 ms	204 KB	Output is correct
32	Correct	1 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	332 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	1 ms	204 KB	Output is correct
41	Correct	1 ms	204 KB	Output is correct
42	Correct	1 ms	204 KB	Output is correct
43	Correct	1 ms	332 KB	Output is correct
44	Correct	1 ms	204 KB	Output is correct
45	Correct	1 ms	204 KB	Output is correct
46	Correct	1 ms	204 KB	Output is correct
47	Correct	1 ms	204 KB	Output is correct
48	Correct	1 ms	332 KB	Output is correct
49	Correct	1 ms	204 KB	Output is correct
50	Correct	1 ms	332 KB	Output is correct
51	Correct	1 ms	204 KB	Output is correct
52	Correct	16 ms	336 KB	Output is correct
53	Correct	20 ms	340 KB	Output is correct
54	Correct	36 ms	336 KB	Output is correct
55	Correct	35 ms	336 KB	Output is correct
56	Correct	132 ms	336 KB	Output is correct
57	Correct	129 ms	332 KB	Output is correct
58	Correct	125 ms	332 KB	Output is correct
59	Correct	125 ms	340 KB	Output is correct
60	Correct	165 ms	332 KB	Output is correct
61	Correct	1 ms	204 KB	Output is correct
62	Correct	20 ms	332 KB	Output is correct
63	Correct	42 ms	336 KB	Output is correct
64	Correct	45 ms	332 KB	Output is correct
65	Correct	67 ms	328 KB	Output is correct
66	Correct	104 ms	336 KB	Output is correct
67	Correct	131 ms	336 KB	Output is correct
68	Correct	131 ms	456 KB	Output is correct
69	Correct	128 ms	332 KB	Output is correct

답안 #531024

Compilation message

Subtask #1 0 / 9.0

Subtask #2 0 / 16.0

Subtask #3 21.0 / 21.0

Subtask #4 0 / 25.0

Subtask #5 29.0 / 29.0

Subtask #1
0 / 9.0

Subtask #2
0 / 16.0

Subtask #3
21.0 / 21.0

Subtask #4
0 / 25.0

Subtask #5
29.0 / 29.0