Submission #1095718

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1095718	2024-10-03T03:33:41 Z	Nurislam	Bali Sculptures (APIO15_sculpture)	C++17	0 / 100	335 ms	460 KB

sculpture

#include <bits/stdc++.h>

using namespace std;

#define pb push_back
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int long long


template <class F, class _S>
bool chmin(F &u, const _S &v){
	bool flag = false;
	if ( u > v ){
		u = v; flag |= true;
	}
	return flag;
}

template <class F, class _S>
bool chmax(F &u, const _S &v){
	bool flag = false;
	if ( u < v ){
		u = v; flag |= true;
	}
	return flag;
}

const int N = (1<<18) +1, inf = 1e18+200;
//int mod = 998244353;
//int mod = 1000000007;
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//#define rnd(l, r) uniform_int_distribution <int> (l, r)(rng)


void solve(){
	int n, a, b;
	cin >> n >> a >> b;
	vector<int> v(n);
	for(int &i:v)cin >> i;
	
	int ans = inf;
	for(int ms = 0; ms < (1<<n); ms++){
		int cn = __builtin_popcount(ms)+1;
		if(cn < a || cn > b)continue;
		int tot = 0;
		int res = 0;
		for(int i = 0; i < n; i++){
			res += v[i];
			if((ms >> i) & 1){
				tot |= res;
				res = 0;
			}
		}
		tot |= res;
		chmin(ans, tot);
	}
	cout << ans << '\n';
}

 
signed main(){
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int tt = 1;
	//cin >> tt;
	while(tt--){
		solve();
	}
}

 
 
 

 
 
 

Subtask #1

0 / 9.0

#	Verdict	Execution time	Memory	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	2 ms	460 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	3 ms	460 KB	Output is correct
9	Correct	3 ms	348 KB	Output is correct
10	Correct	3 ms	348 KB	Output is correct
11	Correct	3 ms	344 KB	Output is correct
12	Correct	3 ms	348 KB	Output is correct
13	Correct	65 ms	344 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Incorrect	0 ms	348 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #2

0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	2 ms	348 KB	Output is correct
7	Correct	1 ms	456 KB	Output is correct
8	Correct	3 ms	348 KB	Output is correct
9	Correct	3 ms	452 KB	Output is correct
10	Correct	4 ms	348 KB	Output is correct
11	Correct	3 ms	460 KB	Output is correct
12	Correct	3 ms	348 KB	Output is correct
13	Correct	66 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Incorrect	0 ms	348 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #3

0 / 21.0

#	Verdict	Execution time	Memory	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	1 ms	348 KB	Output is correct
6	Correct	3 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	3 ms	348 KB	Output is correct
9	Correct	3 ms	348 KB	Output is correct
10	Correct	3 ms	348 KB	Output is correct
11	Correct	3 ms	348 KB	Output is correct
12	Correct	3 ms	348 KB	Output is correct
13	Correct	67 ms	348 KB	Output is correct
14	Correct	127 ms	344 KB	Output is correct
15	Correct	335 ms	348 KB	Output is correct
16	Incorrect	1 ms	344 KB	Output isn't correct
17	Halted	0 ms	0 KB	-

Subtask #4

0 / 25.0

#	Verdict	Execution time	Memory	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	2 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	4 ms	348 KB	Output is correct
9	Correct	3 ms	348 KB	Output is correct
10	Correct	3 ms	348 KB	Output is correct
11	Correct	3 ms	348 KB	Output is correct
12	Correct	3 ms	348 KB	Output is correct
13	Correct	65 ms	436 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Incorrect	0 ms	460 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #5

0 / 29.0

#	Verdict	Execution time	Memory	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	0 ms	348 KB	Output is correct
6	Correct	2 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	3 ms	348 KB	Output is correct
9	Correct	3 ms	348 KB	Output is correct
10	Correct	3 ms	344 KB	Output is correct
11	Correct	3 ms	348 KB	Output is correct
12	Correct	3 ms	348 KB	Output is correct
13	Correct	65 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	1 ms	348 KB	Output is correct
17	Correct	2 ms	348 KB	Output is correct
18	Correct	6 ms	452 KB	Output is correct
19	Correct	5 ms	348 KB	Output is correct
20	Correct	51 ms	432 KB	Output is correct
21	Correct	69 ms	344 KB	Output is correct
22	Correct	3 ms	348 KB	Output is correct
23	Correct	66 ms	348 KB	Output is correct
24	Correct	126 ms	344 KB	Output is correct
25	Correct	334 ms	432 KB	Output is correct
26	Incorrect	0 ms	344 KB	Output isn't correct
27	Halted	0 ms	0 KB	-