oj.uz

Submission #169382

# Submission time Handle Problem Language Result Execution time Memory
169382 2019-12-20T07:16:36 Z ruler Kitchen (BOI19_kitchen) C++14
21 / 100
 128 ms 95452 KB 
// IOI 2021
#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define ends ' '
#define die(x) return cout << x << endl, 0
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x.size())
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) { cerr << ends << H; debug_out(T...); }
#define debug(...) cerr << "{" << #__VA_ARGS__ << "}:", debug_out(__VA_ARGS__)
typedef long long ll;
typedef pair<int, int> pii;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;

////////////////////////////////////////////////////////////////////

const int N = 3e2 + 5;

int B[N], DP[N][N * N];

int main() {

	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	
	int n, m, k, sum = 0; cin >> n >> m >> k;
	if (m < k) die("Impossible");
	for (int i = 0; i < n; i++) {
		int a; cin >> a;
		sum += a;
		if (a < k) die("Impossible");
	}
	for (int i = 1; i <= m; i++) for (int j = 0; j < N * N; j++) DP[i][j] = -INF;
	DP[0][0] = 0;
	for (int i = 1; i <= m; i++) cin >> B[i];
	for (int i = 1; i <= m; i++) for (int j = 0; j < N * N; j++) {
		DP[i][j] = DP[i - 1][j];
		if (j >= B[i]) DP[i][j] = max(DP[i][j], DP[i - 1][j - B[i]] + min(B[i], n));
	}
	for (int i = 0; i + sum < N * N; i++) if (DP[m][i + sum] >= n * k) die(i);
	cout << "Impossible" << endl;

	return 0;
}

Subtask #1
0 / 9.0

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

Subtask #2
0 / 22.0

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

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 128 ms 95452 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 14840 KB Output is correct
2 Correct 21 ms 14968 KB Output is correct
3 Correct 21 ms 14844 KB Output is correct
4 Correct 21 ms 14840 KB Output is correct
5 Correct 2 ms 376 KB Output is correct

Subtask #5
0 / 28.0

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