oj.uz

답안 #249837

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
249837 2020-07-15T22:16:04 Z eggag32 Kitchen (BOI19_kitchen) C++17
72 / 100
 1000 ms 10488 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) debug(x) debug(y);
#define repn(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(i, a) for(int i = 0; i < (int)(a); i++)
#define all(v) v.begin(), v.end() 
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define sq(x) ((x) * (x))

template<class T> T gcd(T a, T b){ return ((b == 0) ? a : gcd(b, a % b)); }

int dp[90005];
int dp1[1605][1605];

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	//freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
	int n, m, k;
	cin >> n >> m >> k;
	vi a(n), b(m);
	int sumA = 0;
	int mn = 1e9;
	rep(i, n) cin >> a[i], sumA += a[i], mn = min(mn, a[i]);
	rep(i, m) cin >> b[i];
	if(mn < k){
		cout << "Impossible" << endl;
		return 0;
	}
	if(n >= 1 && n <= 300 && k <= 300 && m >= 1 && m <= 15){
		//subtasks 1 and 2: bitmask
		int ans = 1e9;
		rep(i, (1 << m)) if(__builtin_popcount(i) >= k){
			int sum = 0;
			int need = n * k;
			int can = 0;
			rep(j, m) if(i & (1 << j)){
				sum += b[j];
				can += min(n, b[j]);
			}
			if(sum >= sumA && can >= need) ans = min(ans, sum - sumA);
		}
		if(ans == 1e9) cout << "Impossible" << endl;
		else cout << ans << endl;
	}
	else if(k == 1){
		//subtast 3 -> DP
		rep(i, 90005) dp[i] = 0;
		dp[0] = 1;
		rep(i, m){
			for(int j = 90005 - b[i]; j >= 0; j--) dp[j + b[i]] |= dp[j]; 
		}
		repn(i, sumA, 90005) if(dp[i]){
			cout << i - sumA << endl;
			return 0;
		}
		cout << "Impossible" << endl;
	}
	else{
		//subtask 4: DP?
		//dp[value][can?]
		//value can at most bee 1600, same for can
		rep(i, 1605) rep(j, 1605) dp1[i][j] = 0;
		dp1[0][0] = 1;
		rep(i, m){
			//look over all values, add can to them?
			int cur = min(n, b[i]);
			for(int j = 1605 - b[i]; j >= 0; j--){
				rep(k1, 1605) if((k1 + cur) < 1605){
					dp1[j + b[i]][k1 + cur] |= dp1[j][k1];
				}
			}
		}	
		repn(i, sumA, 1605){
			repn(j, k * n, 1605) if(dp1[i][j]){
				cout << i - sumA << endl;
				return 0;
			}
		}

	}
	return 0;
}
/*
Things to look out for:
	- Integer overflows
	- Array bounds
	- Special cases
Be careful!
*/

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 67 ms 640 KB Output is correct
2 Correct 74 ms 752 KB Output is correct
3 Correct 99 ms 740 KB Output is correct
4 Correct 94 ms 640 KB Output is correct
5 Correct 95 ms 640 KB Output is correct
6 Correct 69 ms 640 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 535 ms 10468 KB Output is correct
2 Correct 523 ms 10468 KB Output is correct
3 Correct 531 ms 10488 KB Output is correct
4 Correct 526 ms 10368 KB Output is correct
5 Correct 0 ms 384 KB Output is correct

Subtask #5
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 67 ms 640 KB Output is correct
15 Correct 74 ms 752 KB Output is correct
16 Correct 99 ms 740 KB Output is correct
17 Correct 94 ms 640 KB Output is correct
18 Correct 95 ms 640 KB Output is correct
19 Correct 69 ms 640 KB Output is correct
20 Correct 535 ms 10468 KB Output is correct
21 Correct 523 ms 10468 KB Output is correct
22 Correct 531 ms 10488 KB Output is correct
23 Correct 526 ms 10368 KB Output is correct
24 Correct 0 ms 384 KB Output is correct
25 Execution timed out 1095 ms 10368 KB Time limit exceeded
26 Halted 0 ms 0 KB -