oj.uz

Submission #726853

# Submission time Handle Problem Language Result Execution time Memory
726853 2023-04-19T12:47:59 Z TimDee Kitchen (BOI19_kitchen) C++17
21 / 100
 16 ms 596 KB 
#include <bits/stdc++.h>
using namespace std;

//#define int long long
#define forn(i,n) for(int i=0;i<n;++i)
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define f first
#define s second
#define pi pair<int,int>

#define vii(a,n) vector<int>a(n);forn(i,n)cin>>a[i];

const int inf = 1e9;

void solve() {

	int n,m,k; cin>>n>>m>>k;
	vii(a,n);
	vii(b,m);
	
	if (k>m) {
		cout<<"Impossible";
		return;
	}
	forn(i,n) if (a[i]<k) {
		cout<<"Impossible";
		return;
	}
	int s=0;
	for(auto&x:a) s+=x;
	for(auto&x:b) s-=x;
	if (s>0) {
		cout<<"Impossible";
		return;
	}
	s=0;
	for(auto&x:a) s+=x;

	int ans=inf;

	int mx=max({m,n,k});
	for(auto&x:a) mx=max(mx,x);
	for(auto&x:b) mx=max(mx,x);
	if (mx>40) exit(0);
	const int S=1600;
	vector<int> dp(S+1,0);
	dp[0]=1;
	for(auto&x:b) {
		if (x>=n) continue;
		for (int i=S-x; i>=0; --i) dp[i+x]|=dp[i];
	}
	vector<vector<int>> dp2(S+1,vector<int>(m+1,0));
	dp2[0][0]=1;
	for(auto&x:b) {
		if (x<n) continue;
		for (int i=S-x; i>=0; --i) {
			for (int j=m-1; j>=0; --j) {
				dp2[i+x][j+1]|=dp2[i][j];
				dp2[i+x][j]|=dp2[i+x][j+1];
			}
		}
	}

	for (int i=0; i<=s; ++i) {
		if (!dp[i]) continue;
		int x=max(k-i/n,0);
		for (int j=s-i; j<=S; ++j) {
			if (dp2[j][x]) ans=min(ans,i+j-s);
		}
	}

	if (ans==inf) cout<<"Impossible";
	else cout<<ans;

}

int32_t main() {
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	solve();
}

Subtask #1
0 / 9.0

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

Subtask #2
0 / 22.0

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

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 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 16 ms 596 KB Output is correct
2 Correct 15 ms 596 KB Output is correct
3 Correct 5 ms 596 KB Output is correct
4 Correct 6 ms 596 KB Output is correct
5 Correct 1 ms 320 KB Output is correct

Subtask #5
0 / 28.0

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