제출 #170803

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
170803		Nightmar	Bali Sculptures (APIO15_sculpture)	C++17	0 / 100	2 ms	380 KiB

sculpture

#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstdlib>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <iomanip>
 
#define SWS ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define pb push_back
#define ppb pop_back
#define ft first
#define sd second
#define read freopen("input.txt", "r", stdin)
#define write freopen("output.txt", "w", stdout)
#define files read; write
 
using namespace std;
 
typedef long long ll;
typedef pair<int, int> pii;
 
const int Z = (int)2e3 + 228;
const int N = (int)3e5 + 228;
const int INF = (int)1e9 + 228;
const int MOD = (int)1e9 + 7;
const ll LLINF = (ll)1e18 + 228;

ll a[Z], pref[Z];
ll dp[Z][Z];

int main()
{
	SWS;
	//files;
	int n, l, r;
	cin >> n >> l >> r;
	for (int i = 1; i <= n; i++) 
	{
		cin >> a[i];
		pref[i] = pref[i - 1] + a[i];
	}
	ll ans = INF;
	for (int kek = l; kek <= r; kek++)
	{
		for (int team = 1; team <= kek; team++)
		{
			for (int i = team; i <= n; i++)
			{
				dp[team][i] = LLINF;
				if (team == 1) dp[team][i] = pref[i];
				else
				{
					for (int j = team - 1; j < i; j++)
					{
						ll cur = dp[team - 1][j] | (pref[i] - pref[j]);
						dp[team][i] = min(dp[team][i], cur);
					}
				}
			}
		}
		ans = min(ans, dp[kek][n]);
	}
	cout << ans;
	return 0;
}
/*
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