oj.uz

Submission #984584

# Submission time Handle Problem Language Result Execution time Memory
984584 2024-05-16T20:15:17 Z OAleksa Kitchen (BOI19_kitchen) C++14
9 / 100
 2 ms 600 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];
  	int sum = 0;
  	sort(a + 1, a + n + 1);
  	for (int i = 1;i <= n;i++)
  		sum += a[i];
  	for (int i = 1;i <= m;i++)
  		cin >> b[i];
  	sort(b + 1, b + m + 1);
  	if (m < k || a[1] < k)
  		cout << "Impossible";
  	else {
  		int ans = 1e9;
  		for (int mask = 1;mask < (1 << m);mask++) {
  			int x = __builtin_popcount(mask);
  			if (x < k)
  				continue;
  			int s = 0, is = 0, all = 0;
  			for (int i = 0;i < m;i++) {
  				if (mask >> i & 1) {
  					all += b[i + 1];
  					if (s < n * k) {
  						is += 1;
  						s += min(n * k - s, min(b[i], n));
  					}
  				}
  			}
  			if (is >= k && all >= sum)
  				ans = min(ans, all - sum);
  		}
  		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 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 600 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 22.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 21.0

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

Subtask #5
0 / 28.0

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