oj.uz

답안 #402794

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
402794 2021-05-12T11:11:07 Z yoavL Bali Sculptures (APIO15_sculpture) C++14
0 / 100
 4 ms 4300 KB 
#include <iostream>
#include <vector>
#include <algorithm>

#define upmax(a, b) a = max(a, b);
#define upmin(a, b) a = min(a, b);
#define pr(x) cout << x << endl;

using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;

const ll inf = 1e18;
const ll maxn = 502;
const ll maxg = 20;
ll n, a, b;
vll arr;
ll ans;
vll s;

void brute(vll& div, ll ind)
{
	if (ind == n) {
		if (div.size() < a-1 || div.size() > b-1) return;
		ll res = 0;
		ll cursum = 0;
		ll p = 0;
		for (ll i = 0; i < n; i++) {
			cursum += arr[i];
			if (p < div.size() && div[p] == i) {
				res |= cursum;
				p++;
				cursum = 0;
			}
		}
		res |= cursum;
		upmin(ans, res);
		return;
	}

	div.push_back(ind);
	if(ind < n-1) brute(div, ind + 1);
	div.pop_back();
	brute(div, ind + 1);
}


ll sum(ll l, ll r)
{
	ll res = s[r];
	if (l) res -= s[l - 1];
	return res;
}


ll calc_dp()
{
	
	/*
	dp[i][j][k] = is it possible to use first i vals to form j groups with OR-SUM equals k.
	*/

	vvvll dp(n+1, vvll(maxg + 1, vll(maxn, false)));

	dp[0][0][0] = true;


	for (ll i = 0; i <= n; i++) {
		for (ll j = 0; j <= maxg; j++) {
			for (ll k = 0; k < maxn; k++) {
				if (!dp[i][j][k]) continue;
				ll cursum = 0;
				for (ll m = i + 1; m <= n; m++) {
					cursum += arr[m - 1];
					dp[m][j + 1][k | cursum] = 1;
				}
			}
		}
	}


	ll res = inf;
	for (ll j = a; j <= b; j++) {
		for (ll k = 0; k < maxn; k++) {
			if (dp[n][j][k]) upmin(res, k);
		}
	}
	return res;
}

int main()
{
	cin >> n >> a >> b;
	arr.resize(n);
	for (ll i = 0; i < n; i++) cin >> arr[i];
	s.resize(n);
	s[0] = arr[0];
	for (ll i = 1; i < n; i++) s[i] = arr[i] + s[i - 1];
	ans = inf;
	//vll div;
	//brute(div, 0);
	//pr(ans);
	ans = calc_dp();
	pr(ans);
}

/*

6 1 3 
8 1 2 1 5 4


*/

Compilation message

sculpture.cpp: In function 'void brute(vll&, ll)':
sculpture.cpp:26:18: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   26 |   if (div.size() < a-1 || div.size() > b-1) return;
      |       ~~~~~~~~~~~^~~~~
sculpture.cpp:26:38: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   26 |   if (div.size() < a-1 || div.size() > b-1) return;
      |                           ~~~~~~~~~~~^~~~~
sculpture.cpp:32:10: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |    if (p < div.size() && div[p] == i) {
      |        ~~^~~~~~~~~~~~

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 844 KB Output is correct
2 Correct 1 ms 1056 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 844 KB Output is correct
5 Correct 1 ms 1228 KB Output is correct
6 Correct 2 ms 1612 KB Output is correct
7 Correct 3 ms 1868 KB Output is correct
8 Correct 3 ms 2124 KB Output is correct
9 Correct 2 ms 2124 KB Output is correct
10 Correct 2 ms 2080 KB Output is correct
11 Correct 2 ms 2124 KB Output is correct
12 Correct 3 ms 2124 KB Output is correct
13 Correct 3 ms 2080 KB Output is correct
14 Correct 1 ms 936 KB Output is correct
15 Correct 1 ms 844 KB Output is correct
16 Correct 1 ms 844 KB Output is correct
17 Correct 2 ms 800 KB Output is correct
18 Correct 1 ms 1228 KB Output is correct
19 Correct 2 ms 1612 KB Output is correct
20 Correct 2 ms 1868 KB Output is correct
21 Correct 2 ms 2124 KB Output is correct
22 Correct 2 ms 2124 KB Output is correct
23 Correct 2 ms 2124 KB Output is correct
24 Correct 2 ms 2124 KB Output is correct
25 Correct 2 ms 2124 KB Output is correct
26 Correct 2 ms 2124 KB Output is correct
27 Runtime error 2 ms 1504 KB Execution killed with signal 11
28 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 936 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 2 ms 792 KB Output is correct
5 Correct 2 ms 1228 KB Output is correct
6 Correct 2 ms 1612 KB Output is correct
7 Correct 2 ms 1828 KB Output is correct
8 Correct 3 ms 2084 KB Output is correct
9 Correct 2 ms 2080 KB Output is correct
10 Correct 2 ms 2064 KB Output is correct
11 Correct 2 ms 2076 KB Output is correct
12 Correct 2 ms 2072 KB Output is correct
13 Correct 2 ms 2124 KB Output is correct
14 Correct 1 ms 844 KB Output is correct
15 Correct 1 ms 844 KB Output is correct
16 Correct 1 ms 844 KB Output is correct
17 Correct 1 ms 844 KB Output is correct
18 Correct 2 ms 1228 KB Output is correct
19 Correct 2 ms 1612 KB Output is correct
20 Correct 2 ms 1868 KB Output is correct
21 Correct 2 ms 2124 KB Output is correct
22 Correct 2 ms 2124 KB Output is correct
23 Correct 2 ms 2124 KB Output is correct
24 Correct 3 ms 2124 KB Output is correct
25 Correct 2 ms 2124 KB Output is correct
26 Correct 2 ms 2080 KB Output is correct
27 Runtime error 4 ms 4300 KB Execution killed with signal 11
28 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 844 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 844 KB Output is correct
5 Correct 1 ms 1228 KB Output is correct
6 Correct 2 ms 1676 KB Output is correct
7 Correct 2 ms 1868 KB Output is correct
8 Correct 2 ms 2124 KB Output is correct
9 Correct 2 ms 2124 KB Output is correct
10 Correct 2 ms 1996 KB Output is correct
11 Correct 2 ms 2124 KB Output is correct
12 Correct 2 ms 2124 KB Output is correct
13 Correct 2 ms 2124 KB Output is correct
14 Runtime error 4 ms 4300 KB Execution killed with signal 11
15 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 844 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 844 KB Output is correct
5 Correct 1 ms 1228 KB Output is correct
6 Correct 2 ms 1700 KB Output is correct
7 Correct 2 ms 1868 KB Output is correct
8 Correct 2 ms 2080 KB Output is correct
9 Correct 2 ms 2124 KB Output is correct
10 Correct 2 ms 2124 KB Output is correct
11 Correct 2 ms 1996 KB Output is correct
12 Correct 2 ms 2124 KB Output is correct
13 Correct 2 ms 2124 KB Output is correct
14 Correct 1 ms 936 KB Output is correct
15 Correct 1 ms 844 KB Output is correct
16 Correct 1 ms 844 KB Output is correct
17 Correct 1 ms 844 KB Output is correct
18 Correct 2 ms 1228 KB Output is correct
19 Correct 2 ms 1612 KB Output is correct
20 Correct 2 ms 1868 KB Output is correct
21 Correct 2 ms 2124 KB Output is correct
22 Correct 2 ms 2124 KB Output is correct
23 Correct 2 ms 2124 KB Output is correct
24 Correct 3 ms 2124 KB Output is correct
25 Correct 2 ms 1996 KB Output is correct
26 Correct 2 ms 2084 KB Output is correct
27 Runtime error 2 ms 1484 KB Execution killed with signal 11
28 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 844 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 800 KB Output is correct
5 Correct 2 ms 1228 KB Output is correct
6 Correct 2 ms 1700 KB Output is correct
7 Correct 2 ms 1868 KB Output is correct
8 Correct 2 ms 2016 KB Output is correct
9 Correct 2 ms 2124 KB Output is correct
10 Correct 2 ms 2084 KB Output is correct
11 Correct 2 ms 2088 KB Output is correct
12 Correct 2 ms 2124 KB Output is correct
13 Correct 2 ms 2124 KB Output is correct
14 Runtime error 2 ms 1548 KB Execution killed with signal 11
15 Halted 0 ms 0 KB -