Submission #377714

#	Time	Username	Problem	Language	Result	Execution time	Memory
377714		SavicS	Kitchen (BOI19_kitchen)	C++14	0 / 100	383 ms	18928 KiB

kitchen

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>

#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ff(i,a,b) for(int i=a;i<=b;i++)
#define fb(i,b,a) for(int i=b;i>=a;i--)

using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 55;
const int inf = 1e9 + 5;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

int n, m, k;
int a[maxn];
int b[maxn];

bool dp[maxn][maxn][maxn * maxn];

int main()
{
   	ios::sync_with_stdio(false);
   	cout.tie(nullptr);
  	cin.tie(nullptr);
	cin >> n >> m >> k;
	ff(i,1,n)cin >> a[i];
	ff(i,1,m)cin >> b[i];
   	
   	ff(i,1,n){
		if(a[i] < k)return cout << "Impossible", 0;
	}
	
   	int S = 0;
   	ff(i,1,m)S += b[i];
   	
	dp[0][0][0] = 1;
	ff(i,1,m){
		ff(j,1,m){
			ff(l,0,S){
				dp[i][j][l] |= dp[i - 1][j - 1][l - b[i]];
				dp[i][j][l] |= dp[i - 1][j][l];
			}
		}
	}   
	
	int zbir = 0;
	ff(i,1,n)zbir += a[i];
	
	int rez = inf;
	ff(j,k,m){
		ff(l,0,S){
			if(l >= zbir && dp[m][j][l])rez = min(rez, l - zbir);
		}
	}
	if(rez == inf)cout << "Impossible" << endl;
	else cout << rez << endl;
	return 0;
}
/**



// probati bojenje sahovski ili slicno

**/

• Subtask 1: 0 / 9
• Subtask 2: 0 / 22
• Subtask 3: 0 / 20
• Subtask 4: 0 / 21
• Subtask 5: 0 / 28