답안 #784154

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
784154 2023-07-15T19:00:50 Z raysh07 Kitchen (BOI19_kitchen) C++17
100 / 100
21 ms 980 KB
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF (int)1e18
#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 1 ms 212 KB Output is correct
3 Correct 1 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 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 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 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 832 KB Output is correct
2 Correct 12 ms 836 KB Output is correct
3 Correct 21 ms 980 KB Output is correct
4 Correct 20 ms 960 KB Output is correct
5 Correct 19 ms 980 KB Output is correct
6 Correct 12 ms 724 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 324 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
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 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 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 16 ms 832 KB Output is correct
15 Correct 12 ms 836 KB Output is correct
16 Correct 21 ms 980 KB Output is correct
17 Correct 20 ms 960 KB Output is correct
18 Correct 19 ms 980 KB Output is correct
19 Correct 12 ms 724 KB Output is correct
20 Correct 1 ms 324 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 10 ms 724 KB Output is correct
26 Correct 14 ms 852 KB Output is correct
27 Correct 6 ms 596 KB Output is correct
28 Correct 14 ms 852 KB Output is correct
29 Correct 17 ms 852 KB Output is correct
30 Correct 21 ms 964 KB Output is correct