제출 #304960

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

sculpture

#pragma GCC optimize("Ofast") 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(998244353)
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
ll dp[10001][10001];
int main()
{
	int n,a,b;
	cin>>n>>a>>b;
	vector<ll>y(n+1);
	for(int i=1;i<=n;i++)cin>>y[i];
	for(int i=0;i<=n;i++)
		for(int j=0;j<=b+1;j++)
		   dp[i][j] = INF;
		   
	dp[0][0] = 0;
	for(int i=0;i<=n;i++){
		for(int j=0;j<=b;j++){
			if(dp[i][j] == INF)continue;
			ll sum = 0;
			for(int k=i+1;k<=n;k++){
				sum+=y[k];
				dp[k][j+1] = min(dp[k][j+1],dp[i][j]|sum);
			}
		}
	}
	ll ans = INF;
	for(int i=a+1;i<=b+1;i++)ans = min(ans,dp[n][i]);
	cout<<ans;
}
/*
6 1 3
8 1 2 1 5 4 
*/

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