oj.uz

Submission #170809

# Submission time Handle Problem Language Result Execution time Memory
170809 2019-12-26T12:00:11 Z Nightmar Bali Sculptures (APIO15_sculpture) C++17
0 / 100
 2 ms 504 KB 
#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];
	}
	for (int team = 1; team <= l; team++)
		for (int i = team; i <= n; i++)
			if (team == 1) dp[team][i] = pref[i];
			else
			{
				dp[team][i] = LLINF;
				for (int j = team - 1; j < i; j++)
					dp[team][i] = min(dp[team][i], dp[team - 1][j] | (pref[i] - pref[j]));
			}
	ll ans = dp[l][n];
	for (int team = l + 1; team <= r; team++)
	{
		for (int i = team; i <= n; i++)
		{
			dp[team][i] = LLINF;
			for (int j = team - 1; j < i; j++)
				dp[team][i] = min(dp[team][i], dp[team - 1][j] | (pref[i] - pref[j]));
		}
		ans = min(ans, dp[team][n]);
	}
	cout << ans;
	return 0;
}
/*
6 1 3
8 1 2 1 5 4
*/

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Incorrect 2 ms 424 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -