oj.uz

답안 #774502

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
774502 2023-07-05T19:01:04 Z OrazB Bali Sculptures (APIO15_sculpture) C++17
9 / 100
 1000 ms 456 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_set;
//Dijkstra->set
//set.find_by_order(x) x-position value
//set.order_of_key(x) number of strictly less elements don't need *set.??
#define N 100005
#define wr cout << "Continue debugging\n";
#define all(x) (x).begin(), (x).end()
#define ll long long int
#define pii pair <ll, ll>
#define pb push_back
#define ff first
#define ss second

const ll inf = 1e18;
int n, A, B;
int a[N], c[N];
ll pref[N], ans = inf;

// bool F(ll y, ll x){
// 	return (((x^y)|x) == x);
// }

// void rec(int x, int pos, int cnt){
// 	if (pos == n){
// 		if (cnt <= B){cout << x;exit(0);}
// 		return;
// 	}
// 	for (int i = pos+1; i <= n; i++){
// 		if (F(pref[i]-pref[pos], x)) rec(x, i, cnt+1);
// 	}
// }

void bit(int x){
	if (x == n){
		ll sum = 0, cur = 0;
		int cnt = 1;
		for (int i = 1; i <= n; i++){
			sum += a[i];
			if (c[i]){
				cur |= sum;
				sum = 0;
				cnt++;
			}
		}
		if (cnt < A or cnt > B) return;
		ans = min(ans, cur|sum);
		return;
	}
	for (int i = 0; i < 2; i++){
		c[x] = i;
		bit(x+1);
	}
}

int main ()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n >> A >> B;
	for (int i = 1; i <= n; i++){
		cin >> a[i];
		pref[i] = pref[i-1]+a[i];
	}
 //  	for (int x = 0; x <= 1000; x++){
	// 	rec(x, 0, 0);
	// }
	bit(1);
	cout << ans << '\n';
}

Subtask #1
9.0 / 9.0

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

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 3 ms 212 KB Output is correct
8 Correct 26 ms 212 KB Output is correct
9 Correct 26 ms 212 KB Output is correct
10 Correct 27 ms 332 KB Output is correct
11 Correct 26 ms 212 KB Output is correct
12 Correct 26 ms 312 KB Output is correct
13 Correct 27 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 3 ms 212 KB Output is correct
21 Correct 27 ms 456 KB Output is correct
22 Correct 27 ms 312 KB Output is correct
23 Correct 27 ms 212 KB Output is correct
24 Correct 26 ms 212 KB Output is correct
25 Correct 27 ms 328 KB Output is correct
26 Correct 27 ms 212 KB Output is correct
27 Correct 54 ms 212 KB Output is correct
28 Correct 949 ms 312 KB Output is correct
29 Execution timed out 1082 ms 212 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 4 ms 212 KB Output is correct
8 Correct 26 ms 212 KB Output is correct
9 Correct 27 ms 332 KB Output is correct
10 Correct 30 ms 212 KB Output is correct
11 Correct 26 ms 212 KB Output is correct
12 Correct 27 ms 340 KB Output is correct
13 Correct 27 ms 212 KB Output is correct
14 Correct 53 ms 308 KB Output is correct
15 Correct 952 ms 312 KB Output is correct
16 Execution timed out 1076 ms 212 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 3 ms 212 KB Output is correct
8 Correct 26 ms 312 KB Output is correct
9 Correct 26 ms 212 KB Output is correct
10 Correct 26 ms 212 KB Output is correct
11 Correct 27 ms 212 KB Output is correct
12 Correct 26 ms 212 KB Output is correct
13 Correct 27 ms 332 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 3 ms 212 KB Output is correct
21 Correct 26 ms 212 KB Output is correct
22 Correct 27 ms 212 KB Output is correct
23 Correct 27 ms 212 KB Output is correct
24 Correct 26 ms 332 KB Output is correct
25 Correct 26 ms 336 KB Output is correct
26 Correct 28 ms 336 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 13 ms 332 KB Output is correct
31 Correct 26 ms 212 KB Output is correct
32 Correct 26 ms 212 KB Output is correct
33 Correct 27 ms 320 KB Output is correct
34 Correct 27 ms 212 KB Output is correct
35 Correct 26 ms 212 KB Output is correct
36 Correct 27 ms 212 KB Output is correct
37 Correct 53 ms 212 KB Output is correct
38 Correct 950 ms 316 KB Output is correct
39 Execution timed out 1081 ms 332 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 3 ms 212 KB Output is correct
8 Correct 26 ms 212 KB Output is correct
9 Correct 26 ms 308 KB Output is correct
10 Correct 26 ms 312 KB Output is correct
11 Correct 26 ms 332 KB Output is correct
12 Correct 26 ms 212 KB Output is correct
13 Correct 28 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 13 ms 336 KB Output is correct
18 Correct 27 ms 312 KB Output is correct
19 Correct 27 ms 212 KB Output is correct
20 Correct 27 ms 316 KB Output is correct
21 Correct 26 ms 212 KB Output is correct
22 Correct 29 ms 360 KB Output is correct
23 Correct 29 ms 324 KB Output is correct
24 Correct 59 ms 212 KB Output is correct
25 Correct 940 ms 328 KB Output is correct
26 Execution timed out 1078 ms 212 KB Time limit exceeded
27 Halted 0 ms 0 KB -