답안 #260968

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
260968	2020-08-11T08:52:27 Z	user202729	Bali Sculptures (APIO15_sculpture)	C++17	37 / 100	1 ms	512 KB

sculpture

// 4
#ifndef LOCAL
#define NDEBUG 1
#endif
#include<bits/stdc++.h>

int main(){
	std::ios::sync_with_stdio(0);std::cin.tie(0);
	int number, least, most; std::cin>>number>>least>>most;
	std::vector<int64_t> sum(number+1);
	for(auto [index, last]=std::pair(1,(int64_t)0); index<=number; ++index){
		int value; std::cin>>value;
		sum[index]=last+=value;
	}

	auto const check=[&](int64_t const mask){
		if(least!=1){
			std::vector<std::vector<char>> f(number+1, std::vector<char>(most+1));
			f[0][0]=true;
			for(int index=0; index<number; ++index)
				for(int next=index+1; next<=number; ++next)
					if(((~ mask)&(sum[next]-sum[index]))==0){
						for(int numComponent=0; numComponent<most; ++numComponent)
							if(f[index][numComponent]) f[next][numComponent+1]=true;
					}

			return std::any_of(f.back().begin()+least, f.back().end(),[&](auto it){return it;});
		}else{
			std::vector<int> least(number+1, INT_MAX);
			least[0]=0;
			for(int index=0; index<number; ++index) if(auto const curNumber=least[index]; curNumber<most)
				for(int next=index+1; next<=number; ++next)
					if(((~ mask)&(sum[next]-sum[index]))==0){
						least[next]=std::min(least[next], curNumber+1);
					}
			return least.back()<=most;
		}
	};

	int const numBit=1+(63^__builtin_clzll(sum.back()));
	int64_t value=((int64_t)1<<numBit)-1;
	for(int bit=numBit; bit--;){
		if(check(value-(1<<bit))) value-=1<<bit;
	}
	std::cout<<value<<'\n';
}

Subtask #1
0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	0 ms	384 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	0 ms	384 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	1 ms	384 KB	Output is correct
21	Correct	1 ms	384 KB	Output is correct
22	Correct	0 ms	384 KB	Output is correct
23	Correct	0 ms	384 KB	Output is correct
24	Correct	1 ms	384 KB	Output is correct
25	Correct	0 ms	384 KB	Output is correct
26	Correct	1 ms	384 KB	Output is correct
27	Incorrect	0 ms	384 KB	Output isn't correct
28	Halted	0 ms	0 KB	-

Subtask #2
16.0 / 16.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	0 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	0 ms	384 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	0 ms	384 KB	Output is correct
18	Correct	0 ms	384 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	0 ms	384 KB	Output is correct
21	Correct	0 ms	384 KB	Output is correct
22	Correct	1 ms	384 KB	Output is correct
23	Correct	1 ms	384 KB	Output is correct
24	Correct	0 ms	384 KB	Output is correct
25	Correct	1 ms	384 KB	Output is correct
26	Correct	1 ms	384 KB	Output is correct
27	Incorrect	0 ms	384 KB	Output isn't correct
28	Halted	0 ms	0 KB	-

Subtask #5
0 / 29.0

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

답안 #260968

Compilation message

Subtask #1 0 / 9.0

Subtask #2 16.0 / 16.0

Subtask #3 21.0 / 21.0

Subtask #4 0 / 25.0

Subtask #5 0 / 29.0

Subtask #1
0 / 9.0

Subtask #2
16.0 / 16.0

Subtask #3
21.0 / 21.0

Subtask #4
0 / 25.0

Subtask #5
0 / 29.0