제출 #30836

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
30836		Kerim	Bali Sculptures (APIO15_sculpture)	C++14	100 / 100	129 ms	2136 KiB

sculpture

#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N=2009;
ll par[N],dp[105][105],odp[N];
int n,a,b;
bool ok(ll x){
	bool res=0;
	if(n<=100){
		memset(dp,0,sizeof dp);
		dp[0][0]=1;
		for(int i=1;i<=b;i++){
			for(int j=i;j<=n;j++)
				for(int k=0;k<j;k++){
					ll val=par[j]-par[k];
					if((val&x)==val)
						dp[i][j]|=dp[i-1][k];
				}	
			if(i>=a)
				res|=dp[i][n];
		}
	}
	else{
		odp[0]=0;
		for(int i=1;i<=n;i++){
			odp[i]=INF;
			for(int j=0;j<i;j++){
				ll val=par[i]-par[j];
				if((val&x)==val)
					umin(odp[i],odp[j]+1);
			}
		}
		res=(odp[n]<=b);
	}
	return res;
}
int main(){
	//~ #ifndef ONLINE_JUDGE
    //~ freopen("file.in", "r", stdin);
	//~ #endif	
	scanf("%d%d%d",&n,&a,&b);
	for(int i=1;i<=n;i++){
		int x;
		scanf("%d",&x);
		par[i]=par[i-1]+x;
	}
	ll ans=(1LL<<50)-1;
	for(int i=49;i>=0;i--)
		if(ok(ans-(1LL<<i)))
			ans-=(1LL<<i);
	printf("%lld\n",ans);		
	return 0;
}

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

sculpture.cpp: In function 'int main()':
sculpture.cpp:57:26: 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:60:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&x);
                 ^

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