oj.uz

Submission #926003

# Submission time Handle Problem Language Result Execution time Memory
926003 2024-02-12T12:42:58 Z vjudge1 Kitchen (BOI19_kitchen) C++17
21 / 100
 77 ms 92736 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define pb push_back
#define emb emplace_back
#define emc emplace
#define pii pair<int,int>
#define pll pair<ll,ll>
#define F first
#define S second
template <class type_key, class type_val>
using um = unordered_map<type_key, type_val>;
template <class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <class T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

signed main(void)
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);

	int n, m, k;
	cin >> n >> m >> k;

	int a[n+1];
	int tota = 0;
	for( int i = 1; i <= n; i++ ) {
		cin >> a[i];
		tota += a[i];
		if( a[i] < k ) return cout << "Impossible", 0;
	}
	
	int w[m+1], c[m+1];
	int totb = 0;
	for( int i = 1; i <= m; i++ ) {
		int b;
		cin >> b;
		totb += b;

		w[i] = b;
		c[i] = min(n, b);
	}

	if( tota > totb || k > m ) return cout << "Impossible", 0;

	int dp[m+1][90001];
	for( int i = 0; i <= m; i++ ) {
		dp[i][0] = dp[0][i] = 0;
	}
	for( int i = 1; i <= m; i++ ) {
		for( int j = 1; j <= 90000; j++ ) {
			dp[i][j] = dp[i-1][j];

			if( j - w[i] >= 0 ) {
				dp[i][j] = max(dp[i][j], dp[i-1][j-w[i]] + c[i]);
			}
		}
	}

	int ans = -1;
	for( int i = tota; i <= 90000; i++ ) {
		if( dp[m][i] >= n*k ) {
			ans = i - tota;
			break;
		}
	}

	if( ans == -1 ) cout << "Impossible";
	else cout << ans;

return 0;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1368 KB Output is correct
2 Incorrect 1 ms 1372 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1368 KB Output is correct
2 Incorrect 1 ms 1372 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

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

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 14792 KB Output is correct
2 Correct 12 ms 14684 KB Output is correct
3 Correct 12 ms 14684 KB Output is correct
4 Correct 12 ms 14792 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #5
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1368 KB Output is correct
2 Incorrect 1 ms 1372 KB Output isn't correct
3 Halted 0 ms 0 KB -