oj.uz

Submission #921362

# Submission time Handle Problem Language Result Execution time Memory
921362 2024-02-03T18:07:39 Z penguin133 Kitchen (BOI19_kitchen) C++17
0 / 100
 29 ms 221020 KB 
#include <bits/stdc++.h>
using namespace std;
 
//#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
int memo[305][305][605], A[305], B[305], dp2[305][305], n, m, k, mx, mn = 1e9, ans = 2e9, sm;
 
int dp(int x, int y, int cur){
	if(!y){
		return (cur >= mx ? cur * n - sm : 2e9);
	}
	if(x == m + 1)return 2e9;
	if(memo[x][y][cur] != -1)return memo[x][y][cur];
	if(cur >= mx){
		return memo[x][y][cur] = (dp2[x][y] + cur) * n - sm;
	}
	return memo[x][y][cur] = min(dp(x + 1, y, cur), dp(x + 1, y - 1, cur + B[x]));
}
 
void solve(){
	cin >> n >> m >> k;
	for(int i = 1; i <= n; i++)cin >> A[i], mx = max(mx, A[i]), sm += A[i], mn = min(mn, A[i]);
	if(mn < k){
		cout << "Impossible\n";
		return;
	}
	for(int i = 1; i <= m; i++)cin >> B[i];
	dp2[m+1][0] = 0;
	for(int i = 1; i <= m; i++)dp2[m+1][i] = 2e9;
	for(int i = m; i >= 1; i--){
		for(int j = 0; j <= m; j++){
			dp2[i][j] = min(dp2[i+1][j], (j ? dp2[i+1][j-1] + B[i] : (int)1e18));
		} 
	}
	memset(memo, -1, sizeof(memo));
	int res = dp(1, k, 0);
	if(res > 1e9)cout << "Impossible\n";
	else cout << res << '\n';
}
 
main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int tc = 1;
	//cin >> tc;
	for(int tc1=1;tc1<=tc;tc1++){
		// cout << "Case #" << tc1 << ": ";
		solve();
	}
}

Compilation message

kitchen.cpp:49:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   49 | main(){
      | ^~~~

Subtask #1
0 / 9.0

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

Subtask #2
0 / 22.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 21.0

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

Subtask #5
0 / 28.0

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