oj.uz

답안 #36478

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
36478 2017-12-09T10:33:25 Z UncleGrandpa925 Bali Sculptures (APIO15_sculpture) C++14
0 / 100
 0 ms 33612 KB 
/*input
6 1 3
8 1 2 1 5 4
*/
#include <bits/stdc++.h>
using namespace std;
#define sp ' '
#define endl '\n'
#define fi first
#define se second
#define mp make_pair
#define int long long
#define N 2005
#define bit(x,y) ((x>>y)&1LL)
#define na(x) (#x) << ":" << x
ostream& operator << (ostream &os, vector<int>&x) {
	for (int i = 0; i < x.size(); i++) os << x[i] << sp;
	return os;
}
ostream& operator << (ostream &os, pair<int, int> x) {
	cout << x.fi << sp << x.se << sp;
	return os;
}
ostream& operator << (ostream &os, vector<pair<int, int> >&x) {
	for (int i = 0; i < x.size(); i++) os << x[i] << endl;
	return os;
}

int n, A, B;
int a[N], sum[N];
int dp[N][N];

int getSum(int l, int r) {
	return sum[r] - sum[l - 1];
}

signed main() {
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	cin >> n >> A >> B;
	for (int i = 1; i <= n; i++) cin >> a[i], sum[i] = sum[i - 1] + a[i];
	for (int i = 1; i <= n; i++) dp[i][1] = getSum(1, i);
	for (int k = 2; k <= B; k++) {
		for (int i = 1; i <= n; i++) {
			dp[i][k] = 1e18;
			for (int j = 1; j <= i; j++) {
				dp[i][k] = min(dp[i][k], dp[j - 1][k - 1] | getSum(j, i));
			}
		}
	}
	int ans = 1e18;
	for (int i = A; i <= B; i++) ans = min(ans, dp[n][i]);
	cout << ans << endl;
}

Compilation message

sculpture.cpp: In function 'std::ostream& operator<<(std::ostream&, std::vector<long long int>&)':
sculpture.cpp:17:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < x.size(); i++) os << x[i] << sp;
                    ^
sculpture.cpp: In function 'std::ostream& operator<<(std::ostream&, std::vector<std::pair<long long int, long long int> >&)':
sculpture.cpp:25:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < x.size(); i++) os << x[i] << endl;
                    ^

Subtask #1
0 / 9.0

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

Subtask #2
0 / 16.0

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

Subtask #3
0 / 21.0

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

Subtask #4
0 / 25.0

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

Subtask #5
0 / 29.0

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