oj.uz

Submission #925832

# Submission time Handle Problem Language Result Execution time Memory
925832 2024-02-12T09:38:21 Z vjudge1 Kitchen (BOI19_kitchen) C++17
0 / 100
 1 ms 348 KB 
#include<iostream>
#include<cassert>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<vector>
#include<stack>
#include<set>
#include<queue>
#include<map>
#include<iomanip>
#include<bitset>

using namespace std;

const int N = (int)4e5 + 7;
const int inf = (int)1e9 + 7;
const int MOD = (int)998244353;
const long long INF = (long long)1e18 + 7; 

int mult(int x, int y) {
	return 1ll*x*y%MOD;
}

int sum(int x, int y) {
	x += y;
	if(x >= MOD) {
		x -= MOD;
	}
	return x;
}

int sub(int x, int y) {
	x -= y;
	if(x < 0) {
		x += MOD;
	}
	return x;
}

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

int main() {	
	ios_base::sync_with_stdio(NULL);
	cin.tie(0);
	cin >> n >> m >> k;
	int tot = 0;
	for(int i = 1; i <= n; ++i) {
		cin >> a[i];
		tot += a[i];
	}
	for(int i = 1; i <= m; ++i) {
		cin >> b[i];
	}
	if(m<k) {
		cout << "Impossible\n";
		return 0;
	}
	sort(a+1, a+1+n);
	sort(b+1, b+1+m);
	int ans = inf;
	for(int mask = 1; mask < (1 << m); ++mask) {
		vector<int> c;
		for(int i = 0; i < m; ++i) {
			if(mask >> i & 1) {
				c.push_back(b[i+1]);
			}
		}	
		bool ok = 1;
		for(int i = 1; i <= n && ok; ++i) {
			sort(c.begin(), c.end());
			int cnt = 0, cur = 0;
			bool ko = 0;
			for(auto x : c) {
				if(x == 0) {
					break;
				}
				cnt++;
				cur += x;
				if(cur >= a[i] && cnt >= k && cur-x < a[i]) {
					ko = 1;
					int s = a[i];    
					for(int j = 0; j < cnt; ++j) {
						if(c[j]>=s) {
							c[j] -= s;
							break;
						}
						c[j] = 0;
						s -= c[j];
					}
					break;	
				}
			}
			ok &= ko;		
		}
		if(ok) {
			int cur = 0;
			for(int i = 0; i < m; ++i) {
				if(mask >> i & 1) {
					cur += b[i+1];
				}
			}
			ans = min(ans, cur-tot);
		}
	}
	if(ans == inf) {
		cout << "Impossible\n";
		return 0;
	}
	cout << ans << "\n";
	return 0;
}

Subtask #1
0 / 9.0

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

Subtask #2
0 / 22.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 21.0

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

Subtask #5
0 / 28.0

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