oj.uz

Submission #784156

# Submission time Handle Problem Language Result Execution time Memory
784156 2023-07-15T19:06:13 Z raysh07 Kitchen (BOI19_kitchen) C++17
100 / 100
 11 ms 600 KB 
#include <bits/stdc++.h>
using namespace std;
#define INF (int)1e9
#define f first
#define s second

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

void Solve()
{
	int n, m, k; cin >> n >> m >> k;

	vector <int> a(n), b(m);
	int sum = 0;
	for (auto &x : a) {
		cin >> x;
		sum += x;
		if (x < k){
			cout << "Impossible\n";
			return;
		}
	}

	for (auto &x : b) cin >> x;

	vector <int> dp(m * 300 + 1, -INF);
	dp[0] = 0;
	int cnt = 0;

	for (auto x : b){
		cnt += 300;
		for (int i = cnt; i >= x; i--){
			dp[i] = max(dp[i], dp[i - x] + min(x, n));
		}
	}

	for (int i = sum; i <= m * 300; i++){
		if (dp[i] >= k * n){
			cout << i - sum << "\n";
			return;
		}
	}

	cout << "Impossible\n";
}

int32_t main() 
{
    auto begin = std::chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;

   // freopen("in",  "r", stdin);
   // freopen("out", "w", stdout);

  //  cin >> t;
    for(int i = 1; i <= t; i++) 
    {
        //cout << "Case #" << i << ": ";
        Solve();
    }
    auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; 
    return 0;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 600 KB Output is correct
2 Correct 6 ms 596 KB Output is correct
3 Correct 11 ms 596 KB Output is correct
4 Correct 11 ms 596 KB Output is correct
5 Correct 10 ms 596 KB Output is correct
6 Correct 6 ms 468 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct

Subtask #5
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 10 ms 600 KB Output is correct
15 Correct 6 ms 596 KB Output is correct
16 Correct 11 ms 596 KB Output is correct
17 Correct 11 ms 596 KB Output is correct
18 Correct 10 ms 596 KB Output is correct
19 Correct 6 ms 468 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 6 ms 468 KB Output is correct
26 Correct 7 ms 596 KB Output is correct
27 Correct 3 ms 468 KB Output is correct
28 Correct 7 ms 596 KB Output is correct
29 Correct 7 ms 596 KB Output is correct
30 Correct 11 ms 596 KB Output is correct