oj.uz

Submission #584243

# Submission time Handle Problem Language Result Execution time Memory
584243 2022-06-27T05:18:26 Z amunduzbaev Kitchen (BOI19_kitchen) C++17
0 / 100
 137 ms 112508 KB 
#include "bits/stdc++.h"
using namespace std;
 
#define ar array
typedef int64_t ll;
//~ #define int ll

const int N = 305;
int a[N], b[N];
bitset<N * N> tp[N], dp;
int dd[N][N * N];

signed main(){
	ios::sync_with_stdio(0); cin.tie(0);
	
	int n, m, k; cin>>n>>m>>k;
	for(int i=0;i<n;i++){
		cin>>a[i];
		if(a[i] < k){
			cout<<"impossible\n";
			return 0;
		}
	}
	for(int i=0;i<m;i++){
		cin>>b[i];
	}
	
	int sum = accumulate(a, a + n, 0);
	sort(b, b + m);
	int l = m, tot = 0;
	dp[0] = 1;
	for(int i=0;i<m;i++){
		if(b[i] > n) { l = i; break; }
		tot += b[i];
		dp |= (dp << b[i]);
	}
	
	tp[0][0] = 1;
	for(int i=l;i<m;i++){
		int v = b[i];
		for(int j=i-l+1;j>0;j--){
			tp[j] |= (tp[j - 1] << v);
		}
	}
	
	for(int j=0;j<N;j++){
		dd[j][N * N - 1] = 1e9;
		for(int k=N * N - 2;~k;k--){
			if(tp[j][k]) dd[j][k] = 0;
			else dd[j][k] = dd[j][k + 1] + 1;
		}
	}
	
	int res = 1e9, c = 0;
	while(c <= m - l){
		for(int j=k * n;j<=tot;j++){
			if(dp[j]){
				res = min(res, dd[c][max(0, sum - j)] + max(0, j - sum));
			}
		}
		
		c++;
		if(k) k--;
	}
	
	if(res == 1e9) cout<<"impossible\n";
	else cout<<res<<"\n";
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 111340 KB Output is correct
2 Correct 127 ms 111392 KB Output is correct
3 Correct 130 ms 111352 KB Output is correct
4 Correct 113 ms 111392 KB Output is correct
5 Correct 115 ms 111264 KB Output is correct
6 Incorrect 0 ms 340 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 111340 KB Output is correct
2 Correct 127 ms 111392 KB Output is correct
3 Correct 130 ms 111352 KB Output is correct
4 Correct 113 ms 111392 KB Output is correct
5 Correct 115 ms 111264 KB Output is correct
6 Incorrect 0 ms 340 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 118 ms 111300 KB Output is correct
2 Correct 120 ms 111316 KB Output is correct
3 Correct 128 ms 111432 KB Output is correct
4 Correct 137 ms 112508 KB Output is correct
5 Incorrect 115 ms 111336 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 111756 KB Output is correct
2 Correct 115 ms 111548 KB Output is correct
3 Correct 127 ms 111380 KB Output is correct
4 Correct 121 ms 111316 KB Output is correct
5 Incorrect 1 ms 340 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 111340 KB Output is correct
2 Correct 127 ms 111392 KB Output is correct
3 Correct 130 ms 111352 KB Output is correct
4 Correct 113 ms 111392 KB Output is correct
5 Correct 115 ms 111264 KB Output is correct
6 Incorrect 0 ms 340 KB Output isn't correct
7 Halted 0 ms 0 KB -