Submission #774494

#	Time	Username	Problem	Language	Result	Execution time	Memory
774494		OrazB	Bali Sculptures (APIO15_sculpture)	C++17	0 / 100	1 ms	340 KiB

sculpture

#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];
ll pref[N];

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

void rec(int x, int pos, int cnt){
	if (pos == n){
		if (cnt >= A and 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);
	}
}

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 <= 20; x++){
		rec(x, 0, 0);
	}
}	

• Subtask 1: 0 / 9
• Subtask 2: 0 / 16
• Subtask 3: 0 / 21
• Subtask 4: 0 / 25
• Subtask 5: 0 / 29