oj.uz

Submission #984408

# Submission time Handle Problem Language Result Execution time Memory
984408 2024-05-16T15:32:53 Z OAleksa Kitchen (BOI19_kitchen) C++14
29 / 100
 80 ms 2136 KB 
#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
const int N = 310;
int n, m, k, a[N], b[N];
pair<int, int> dp[N * N], ndp[N * N];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int tt = 1;
  //cin >> tt;
  while (tt--) {
  	cin >> n >> m >> k;
  	for (int i = 1;i <= n;i++)
  		cin >> a[i];
  	sort(a + 1, a + n + 1);
  	for (int i = 1;i <= m;i++)
  		cin >> b[i];
  	if (m < k || a[1] < k)
  		cout << "Impossible";
  	else {
  		dp[0] = {1, 0};
			for (int i = 1;i <= m;i++) {
				for (int j = 0;j < N * N;j++) {
					if (j < b[i])
						ndp[j] = dp[j];
					else {	
						if (dp[j - b[i]].f) {
							ndp[j] = dp[j - b[i]];
							ndp[j].s += 1;
						}
						if (dp[j].f && dp[j].s > ndp[j].s)
							ndp[j] = dp[j];
					}
				}
				for (int i = 0;i < N * N;i++)
					dp[i] = ndp[i], ndp[i] = {0, 0};
			}
			int s = 0, ans = 1e9;
			for (int i = 1;i <= n;i++)
				s += a[i];
			for (int i = N * N - 1;i >= s;i--) {
				if (dp[i].f && dp[i].s >= k)
					ans = i - s;
			}
			if (ans == 1e9)
				cout << "Impossible\n";
			else
				cout << ans << '\n';
  	}
  }
  return 0; 
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1884 KB Output is correct
2 Correct 2 ms 1884 KB Output is correct
3 Correct 2 ms 1864 KB Output is correct
4 Correct 2 ms 1884 KB Output is correct
5 Correct 2 ms 1884 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 2 ms 1884 KB Output is correct

Subtask #2
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1884 KB Output is correct
2 Correct 2 ms 1884 KB Output is correct
3 Correct 2 ms 1864 KB Output is correct
4 Correct 2 ms 1884 KB Output is correct
5 Correct 2 ms 1884 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 2 ms 1884 KB Output is correct
9 Correct 4 ms 1884 KB Output is correct
10 Correct 4 ms 1884 KB Output is correct
11 Incorrect 4 ms 1884 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 1940 KB Output is correct
2 Correct 67 ms 2136 KB Output is correct
3 Correct 80 ms 1936 KB Output is correct
4 Correct 68 ms 1936 KB Output is correct
5 Correct 65 ms 1884 KB Output is correct
6 Correct 46 ms 1932 KB Output is correct

Subtask #4
0 / 21.0

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

Subtask #5
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1884 KB Output is correct
2 Correct 2 ms 1884 KB Output is correct
3 Correct 2 ms 1864 KB Output is correct
4 Correct 2 ms 1884 KB Output is correct
5 Correct 2 ms 1884 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 2 ms 1884 KB Output is correct
9 Correct 4 ms 1884 KB Output is correct
10 Correct 4 ms 1884 KB Output is correct
11 Incorrect 4 ms 1884 KB Output isn't correct
12 Halted 0 ms 0 KB -