oj.uz

Submission #774516

# Submission time Handle Problem Language Result Execution time Memory
774516 2023-07-05T19:10:06 Z OrazB Bali Sculptures (APIO15_sculpture) C++17
0 / 100
 1 ms 212 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, bool&tr){
	if (tr) return;
	if (pos == n){
		if (cnt <= B){cout << x;exit(0);}
		tr=1;return;
	}
	for (int i = n; i > pos; i--){
		if (F(pref[i]-pref[pos], x)){
			rec(x, i, cnt+1, tr);
			if (tr) return;
		}
	}
}

// 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++){
  		bool tr = 0;
		rec(x, 0, 0, tr);
	}
	// bit(1);
	// cout << ans << '\n';
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 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 0 ms 212 KB Output is correct
7 Incorrect 0 ms 212 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 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 0 ms 212 KB Output is correct
7 Incorrect 0 ms 212 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory 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 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Incorrect 0 ms 212 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory 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 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Incorrect 1 ms 212 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Incorrect 1 ms 212 KB Output isn't correct
8 Halted 0 ms 0 KB -