oj.uz

답안 #77093

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
77093 2018-09-21T07:12:36 Z MrTEK Bali Sculptures (APIO15_sculpture) C++14
0 / 100
 9 ms 8648 KB 
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define len(a) (int)a.size()
#define fi first
#define sc second
#define d1(w) cerr<<#w<<":"<<w<<endl;
#define d2(w,c) cerr<<#w<<":"<<w<<" "<<#c<<":"<<c<<endl;
#define d3(w,c,z) cerr<<#w<<":"<<w<<" "<<#c<<":"<<c<<" "<<#z<<":"<<z<<endl;
#define left ind+ind
#define right ind+ind+1
#define mid (l+r)/2
#define endl '\n'
#define bit __builtin_popcount

typedef long long int ll;

const int maxn = 620;
const long long LINF = 1e18;
const int LOG = 31;
const int INF = 1e9 + 5;
const int P = 31;
const int ALP = 22;
const int N = 1e3 + 5;
const int M = 26;
const int SQ = 350;
const int MOD = 1e9 + 7;

typedef long long int lli;
typedef pair<int,int> pii;

int n,x,y,a[N];
ll dp[N][N];

ll f(int cur,int par) {
	if (cur == n + 1) {
		if (par == y) return 0;
		return LINF;
	}
	ll &r = dp[cur][par];
	if (r != -1) return r;
	ll sum = 0;
	r = LINF;
	for (int i = cur; i <= n ; i++) {
		sum += a[i];
		r = min(r,sum | f(i + 1,par + 1));
	}
	return r;
}

int main() {

	ios_base::sync_with_stdio(false);
	cin.tie(NULL); cout.tie(NULL);

	cin >> n >> x >> y;
	for (int i = 1 ; i <= n ; i++)
		cin >> a[i];
	memset(dp,-1,sizeof dp);
	cout << f(1,0) << endl;

}

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 8312 KB Output is correct
2 Correct 9 ms 8448 KB Output is correct
3 Correct 9 ms 8448 KB Output is correct
4 Correct 8 ms 8448 KB Output is correct
5 Correct 8 ms 8448 KB Output is correct
6 Incorrect 8 ms 8448 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 8460 KB Output is correct
2 Correct 8 ms 8460 KB Output is correct
3 Correct 8 ms 8460 KB Output is correct
4 Correct 8 ms 8528 KB Output is correct
5 Correct 8 ms 8528 KB Output is correct
6 Incorrect 8 ms 8528 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 8528 KB Output is correct
2 Correct 8 ms 8528 KB Output is correct
3 Correct 8 ms 8528 KB Output is correct
4 Correct 8 ms 8528 KB Output is correct
5 Correct 8 ms 8528 KB Output is correct
6 Incorrect 8 ms 8528 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 8528 KB Output is correct
2 Correct 8 ms 8588 KB Output is correct
3 Correct 8 ms 8588 KB Output is correct
4 Correct 8 ms 8588 KB Output is correct
5 Correct 8 ms 8588 KB Output is correct
6 Incorrect 8 ms 8588 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 8588 KB Output is correct
2 Correct 8 ms 8648 KB Output is correct
3 Correct 9 ms 8648 KB Output is correct
4 Correct 8 ms 8648 KB Output is correct
5 Correct 9 ms 8648 KB Output is correct
6 Incorrect 8 ms 8648 KB Output isn't correct
7 Halted 0 ms 0 KB -