oj.uz

Submission #41366

# Submission time Handle Problem Language Result Execution time Memory
41366 2018-02-17T05:31:48 Z RockyB Bali Sculptures (APIO15_sculpture) C++14
0 / 100
 27 ms 32112 KB 
/// In The Name Of God

#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include <bits/stdc++.h>

#define f first
#define s second

#define pb push_back
#define pp pop_back
#define mp make_pair

#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()

#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);

#define nl '\n'
#define ioi exit(0);

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

const int N = (int)2000 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;

const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};

using namespace std;

int n, A, B;
int a[N];
ll dp[N][N];
int main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
	#endif
	Kazakhstan
	cin >> n >> A >> B;
	memset(dp, 0x3f, sizeof(dp));
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		if (i == 1) dp[i][1] = a[i];
		else dp[i][1] = dp[i - 1][1] + a[i];
	}
	for (int id = 2; id <= B; id++) {
		for (int i = 1; i <= n; i++) {
			ll cost = 0;
			for (int j = i; j >= 1; j--) {
				cost += a[j];
				dp[i][id] = min(dp[i][id], dp[j - 1][id - 1] | cost);
			}
		}
	}
	ll ans = linf;
	for (int i = A; i <= B; i++) {
		ans = min(ans, dp[n][i]);
	}
	cout << ans;
	ioi
}

Subtask #1
0 / 9.0

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

Subtask #2
0 / 16.0

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

Subtask #3
0 / 21.0

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

Subtask #4
0 / 25.0

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

Subtask #5
0 / 29.0

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