답안 #784155

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
784155 2023-07-15T19:05:13 Z raysh07 Kitchen (BOI19_kitchen) C++17
100 / 100
22 ms 596 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;

	for (auto x : b){
		for (int i = m * 300; 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;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 596 KB Output is correct
2 Correct 12 ms 596 KB Output is correct
3 Correct 20 ms 596 KB Output is correct
4 Correct 22 ms 596 KB Output is correct
5 Correct 19 ms 596 KB Output is correct
6 Correct 12 ms 468 KB Output is correct
# 결과 실행 시간 메모리 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 0 ms 212 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 18 ms 596 KB Output is correct
15 Correct 12 ms 596 KB Output is correct
16 Correct 20 ms 596 KB Output is correct
17 Correct 22 ms 596 KB Output is correct
18 Correct 19 ms 596 KB Output is correct
19 Correct 12 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 0 ms 212 KB Output is correct
25 Correct 10 ms 468 KB Output is correct
26 Correct 15 ms 596 KB Output is correct
27 Correct 6 ms 468 KB Output is correct
28 Correct 13 ms 596 KB Output is correct
29 Correct 14 ms 596 KB Output is correct
30 Correct 20 ms 596 KB Output is correct