oj.uz

답안 #173846

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
173846 2020-01-05T14:15:06 Z tourist K개의 묶음 (IZhO14_blocks) C++14
0 / 100
 5 ms 504 KB 
#include <iostream>
#include <map>
#include <vector>

using namespace std;

#define ll long long
#define sz(x) (int)x.size()
#define pii pair < int, int >
#define endl "\n"
#define METH ios::sync_with_stdio(0); cin.tie(0);
#define BEGIN cout << "BEGIN" << endl;
#define END cout << "END" << endl;

const int N = 109;
const int mod = 1e9 + 7;															/// ANOTHER HASH MOD: 228228227
const int prime = 29;																	/// ANOTHER HASH PRIME: 997
const int INF = ((long long) 0xCAFEBABE - 1e9 - 4e8);

int n, k, mx[N][N];
int a[N], ans, dp[N][N];
map < pair < int, int >, int > mp;

inline int read() {
	scanf("%d %d", &n, &k);
	for (int i = 1; i <= n; i++) {
		scanf("%d", &a[i]);
	}
	return 0;
}

void calc(int l, int k, int sum) {
	if (k == 1) {
		ans = min(ans, mx[l][n] + sum);
		return;
	}
	pair < int, int > check = {l, k};
	if (mp.count(check)) {
		return;
	}
	mp[check] = 1;
	for (int i = l; i <= n - k + 1; i++) {
		calc(i + 1, k - 1, sum + mx[l][i]);
	}
}

inline int solve() {
	ans = INF;
	for (int i = 1; i <= n; i++) {
		for (int j = i; j <= n; j++) {
			mx[i][j] = max(mx[i][j - 1], a[j]);
		}
	}
	calc(1, k, 0);// TODO: WHY TLE?
	cout << ans << endl;
	return 0;
}

int main() {
	int t = 1;
	while (t--) {
		read();
		if (n >= N) {
			cout << "FUCK YOU" << endl;
			return 0;
		}
		solve();
	}
}

Compilation message

blocks.cpp: In function 'int read()':
blocks.cpp:25:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &k);
  ~~~~~^~~~~~~~~~~~~~~~~
blocks.cpp:27:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &a[i]);
   ~~~~~^~~~~~~~~~~~~

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Incorrect 2 ms 376 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 1 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 252 KB Output is correct
12 Incorrect 2 ms 256 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

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

Subtask #4
0 / 47.0

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