제출 #135178

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
135178		emre	Bali Sculptures (APIO15_sculpture)	C++17	37 / 100	10 ms	504 KiB

sculpture

#include<bits/stdc++.h>
#define ll long long
#define N 2005
using namespace std;

int n,a,b;
bool dpr[N][N];
int ar[N];
int dpm[N];
ll pre[N];

bool eval(int sum,int bit,int value) {
	
	int ssum=sum>>bit;
	int sval=value>>bit;

	return (ssum|sval)==sval;
	
}

bool get_solution_min(int bit,int value) {
	
	for(int ind=1;ind<=n;ind++) {
		
		dpm[ind]=n+1;
		
		for(int indp=1;indp<=ind;indp++) {
			
			if(eval(pre[ind]-pre[indp-1],bit,value)) dpm[ind]=min(dpm[ind],dpm[indp-1]+1);
			
		}
		
	}
	
	return (dpm[n]<=b);
	
}

bool get_solution_range(int bit,int value) {
	
	dpr[0][0]=1;
	
	for(int ind=1;ind<=n;ind++) {
		
		for(int gr=1;gr<=b;gr++) {
			
			dpr[ind][gr]=0;
			
			for(int indp=1;indp<=ind;indp++) {
				
				if(eval(pre[ind]-pre[indp-1],bit,value)) {
					
					dpr[ind][gr]|=dpr[indp-1][gr-1];
					
				}
				
			}
			 
		}
		 
	}
	
	bool res=0;
	
	for(int gr=a;gr<=b;gr++) res|=dpr[n][gr];
	
	return res;
	
}

void solve() {
		
	ll value=0;	
	
	for(int bit=31;bit>=0;bit--) {
		
		if(a==1) {
		
			if(!get_solution_min(bit,value)) value|=(1<<bit);
		
		}
		else {
			
			if(!get_solution_range(bit,value)) value|=(1<<bit);
			
		}
		
	}
	
	printf("%lld",value);
	
}

void calc_pre() {
	
	for(int i=1;i<=n;i++) pre[i]=pre[i-1]+ar[i];
	
}

int main() {
	
	scanf("%d %d %d",&n,&a,&b);
	
	for(int i=1;i<=n;i++) scanf("%d",ar+i);
	
	calc_pre();
	
	solve();
	 
}

컴파일 시 표준 에러 (stderr) 메시지

sculpture.cpp: In function 'int main()':
sculpture.cpp:102:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %d",&n,&a,&b);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~
sculpture.cpp:104:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=n;i++) scanf("%d",ar+i);
                        ~~~~~^~~~~~~~~~~

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