제출 #572611

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
572611		beaconmc	Bali Sculptures (APIO15_sculpture)	C++14	0 / 100	1 ms	212 KiB

sculpture

#include <bits/stdc++.h>
#pragma GCC optimize("O3")
typedef long long ll;

#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)
#define double long double

using namespace std;

ll n;
ll nums[2005];

int check(ll v){
	ll cur = 0;
	ll sum = 0;
	ll ans = 0;


	while (cur<n){

		ll flag = true;
		FOR(i,cur,n){
			sum += nums[i];

			if ((sum&v) == sum) cur = i, flag=false;
		}



		if (flag) return -1;
		cur += 1;
		ans += 1;
		sum = 0;
		
	}
	return ans;

}


int main(){
	ll a,b;
	cin >> n >> a >> b;
	FOR(i,0,n) cin >> nums[i];
	FOR(i,0,100000){
		if (a<= check(i) && check(i) <= b){
			cout << i;
			break;
		}
	}




}

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