oj.uz

Submission #388895

# Submission time Handle Problem Language Result Execution time Memory
388895 2021-04-13T09:06:22 Z talant117408 Bali Sculptures (APIO15_sculpture) C++17
9 / 100
 91 ms 332 KB 
/*
    Code written by Talant I.D.
*/
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
 
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define OK cout << "OK" << endl;
 
const int mod = 1e9+7;
 
ll mode(ll a) {
    a %= mod;
    if (a < 0) a += mod;
    return a;
}
 
ll subt(ll a, ll b) {
    return mode(mode(a)-mode(b));
}
 
ll add(ll a, ll b) {
    return mode(mode(a)+mode(b));
}
 
ll mult(ll a, ll b) {
    return mode(mode(a)*mode(b));
}
 
ll binpow(ll a, ll b) {
    ll res = 1;
    while (b) {
        if (b&1) res = mult(res, a);
        a = mult(a, a);
        b >>= 1;
    }
    return res;
}

int main() {
	do_not_disturb
	
	int n, a, b;
	cin >> n >> a >> b;
	vector <ll> v(n+1), pref(n+1);
	for (int i = 1; i <= n; i++) cin >> v[i];
	for (int i = 1; i <= n; i++) pref[i] = pref[i-1]+v[i];
	
	if (n <= 20) {
		ll ans = 9e18;
		for (int mask = 0; mask < (1<<n); mask++) {
			ll prev = 1, j = 1, cnt = 0, sum = 0;
			while (j <= n) {
				while (j <= n && !(mask&(1<<(j-1)))) {
					j++;
				}
				if (prev < j) {
					cnt++;
					sum |= pref[j-1]-pref[prev-1];
				}
				prev = j;
				j++;
			}
			if (prev == n) {
				sum |= v[n];
				cnt++;
			}
			if (a <= cnt && cnt <= b) {
				ans = min(ans, sum);
			}
		}
		cout << ans;
	}
	else if (n <= 100 && a == 1) {
		int dp[103][103];
		for (int i = 0; i < 103; i++) {
			for (int j = 0; j < 103; j++) {
				dp[i][j] = 2e9;
			}
		}
		dp[0][0] = 0;
		for (int i = 1; i <= n; i++) {
			for (int orr = 0; orr <= 100; orr++) {
				for (int j = i-1; j >= 0; j--) {
					dp[i][(orr|(pref[i]-pref[j]))] = min(dp[i][(orr|(pref[i]-pref[j]))], 1+dp[j][orr]);
				}
			}
		}
		for (int orr = 0; orr <= 100; orr++) {
			if (dp[n][orr] <= b) {
				cout << orr << endl;
				return 0;
			}
		}
	}
	else if (n <= 100) {
		
	}
	else {
		
	}
	
    return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 3 ms 204 KB Output is correct
7 Correct 10 ms 204 KB Output is correct
8 Correct 72 ms 204 KB Output is correct
9 Correct 71 ms 204 KB Output is correct
10 Correct 71 ms 296 KB Output is correct
11 Correct 78 ms 312 KB Output is correct
12 Correct 72 ms 204 KB Output is correct
13 Correct 75 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 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 3 ms 204 KB Output is correct
20 Correct 11 ms 320 KB Output is correct
21 Correct 83 ms 204 KB Output is correct
22 Correct 79 ms 308 KB Output is correct
23 Correct 72 ms 204 KB Output is correct
24 Correct 71 ms 296 KB Output is correct
25 Correct 72 ms 304 KB Output is correct
26 Correct 73 ms 292 KB Output is correct
27 Correct 0 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 36 ms 204 KB Output is correct
31 Correct 71 ms 296 KB Output is correct
32 Correct 79 ms 292 KB Output is correct
33 Correct 74 ms 208 KB Output is correct
34 Correct 72 ms 204 KB Output is correct
35 Correct 74 ms 296 KB Output is correct
36 Correct 73 ms 204 KB Output is correct

Subtask #2
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 1 ms 204 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 3 ms 204 KB Output is correct
7 Correct 9 ms 312 KB Output is correct
8 Correct 72 ms 296 KB Output is correct
9 Correct 77 ms 204 KB Output is correct
10 Correct 81 ms 324 KB Output is correct
11 Correct 74 ms 204 KB Output is correct
12 Correct 72 ms 204 KB Output is correct
13 Correct 73 ms 204 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 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 3 ms 204 KB Output is correct
20 Correct 9 ms 204 KB Output is correct
21 Correct 71 ms 204 KB Output is correct
22 Correct 72 ms 300 KB Output is correct
23 Correct 71 ms 204 KB Output is correct
24 Correct 72 ms 292 KB Output is correct
25 Correct 78 ms 208 KB Output is correct
26 Correct 76 ms 204 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Incorrect 1 ms 324 KB Output isn't correct
29 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 208 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 2 ms 204 KB Output is correct
7 Correct 9 ms 204 KB Output is correct
8 Correct 71 ms 204 KB Output is correct
9 Correct 71 ms 204 KB Output is correct
10 Correct 71 ms 296 KB Output is correct
11 Correct 73 ms 304 KB Output is correct
12 Correct 72 ms 324 KB Output is correct
13 Correct 73 ms 292 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Incorrect 1 ms 332 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #4
0 / 25.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 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 3 ms 204 KB Output is correct
7 Correct 9 ms 204 KB Output is correct
8 Correct 73 ms 292 KB Output is correct
9 Correct 72 ms 292 KB Output is correct
10 Correct 72 ms 300 KB Output is correct
11 Correct 72 ms 204 KB Output is correct
12 Correct 86 ms 324 KB Output is correct
13 Correct 73 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 3 ms 204 KB Output is correct
20 Correct 9 ms 316 KB Output is correct
21 Correct 72 ms 296 KB Output is correct
22 Correct 72 ms 204 KB Output is correct
23 Correct 77 ms 296 KB Output is correct
24 Correct 72 ms 204 KB Output is correct
25 Correct 72 ms 308 KB Output is correct
26 Correct 76 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 1 ms 208 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 37 ms 208 KB Output is correct
31 Correct 72 ms 296 KB Output is correct
32 Correct 72 ms 204 KB Output is correct
33 Correct 91 ms 204 KB Output is correct
34 Correct 72 ms 204 KB Output is correct
35 Correct 72 ms 296 KB Output is correct
36 Correct 84 ms 308 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Incorrect 1 ms 332 KB Output isn't correct
39 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 3 ms 204 KB Output is correct
7 Correct 9 ms 316 KB Output is correct
8 Correct 73 ms 204 KB Output is correct
9 Correct 72 ms 300 KB Output is correct
10 Correct 71 ms 204 KB Output is correct
11 Correct 71 ms 204 KB Output is correct
12 Correct 78 ms 204 KB Output is correct
13 Correct 72 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 37 ms 204 KB Output is correct
18 Correct 72 ms 204 KB Output is correct
19 Correct 77 ms 204 KB Output is correct
20 Correct 72 ms 204 KB Output is correct
21 Correct 72 ms 204 KB Output is correct
22 Correct 71 ms 300 KB Output is correct
23 Correct 72 ms 204 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Incorrect 1 ms 324 KB Output isn't correct
26 Halted 0 ms 0 KB -