oj.uz

Submission #464801

# Submission time Handle Problem Language Result Execution time Memory
464801 2021-08-14T07:37:08 Z Khizri Kitchen (BOI19_kitchen) C++17
100 / 100
 27 ms 4236 KB 
#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back		 
#define F first																 
#define S second 															 
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
	if(a>b) swap(a,b);
	if(a==0) return a+b;
	return gcd(b%a,a);
}
ll lcm(ll a,ll b){
	return a/gcd(a,b)*b;
}
bool is_prime(ll n){
	ll k=sqrt(n);
	if(n==2) return true;
	if(n<2||n%2==0||k*k==n) return false;
	for(int i=3;i<=k;i+=2){
		if(n%i==0){
			return false;
		}
	}
	return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=300+5;
int t=1,n,m,k,arr[mxn],b[mxn],sum,SUM=0,x,dp[(int)1e6];
bool q=false;
void solve(){
	cin>>m>>n>>k;
	for(int i=1;i<=m;i++){
		cin>>b[i];
		sum+=b[i];
		if(b[i]<k){
			q=true;
		}
	}
	for(int i=1;i<=n;i++){
		cin>>arr[i];
		SUM+=arr[i];
	}
	if(n<k||SUM<sum){
		q=true;
	}
	if(q){
		cout<<"Impossible"<<endl;
		return;
	}
	memset(dp,-1,sizeof(dp));
	sort(arr+1,arr+n+1);
	dp[0]=0;
	for(int i=1;i<=n;i++){
		for(int x=SUM;x>=arr[i];x--){
			if(dp[x-arr[i]]!=-1){
				dp[x]=max(dp[x],dp[x-arr[i]]+min(m,arr[i]));
			}
		}
	}
	int ans=1e7;
	for(int i=sum;i<=SUM;i++){
		if(dp[i]>=m*k){
			ans=i-sum;
			break;
		}
	}
	if(ans==1e7){
		cout<<"Impossible"<<endl;
		return;
	}
	cout<<ans<<endl;
}
int main(){
	IOS;
	//cin>>t;
	while(t--){
		solve();
	}
	return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4172 KB Output is correct
2 Correct 2 ms 4172 KB Output is correct
3 Correct 2 ms 4204 KB Output is correct
4 Correct 2 ms 4172 KB Output is correct
5 Correct 3 ms 4172 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4172 KB Output is correct
2 Correct 2 ms 4172 KB Output is correct
3 Correct 2 ms 4204 KB Output is correct
4 Correct 2 ms 4172 KB Output is correct
5 Correct 3 ms 4172 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 2 ms 4172 KB Output is correct
10 Correct 2 ms 4172 KB Output is correct
11 Correct 2 ms 4172 KB Output is correct
12 Correct 2 ms 4164 KB Output is correct
13 Correct 2 ms 4172 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 4236 KB Output is correct
2 Correct 16 ms 4228 KB Output is correct
3 Correct 16 ms 4228 KB Output is correct
4 Correct 27 ms 4172 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 13 ms 4224 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4172 KB Output is correct
2 Correct 2 ms 4172 KB Output is correct
3 Correct 2 ms 4172 KB Output is correct
4 Correct 2 ms 4172 KB Output is correct
5 Correct 1 ms 204 KB Output is correct

Subtask #5
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4172 KB Output is correct
2 Correct 2 ms 4172 KB Output is correct
3 Correct 2 ms 4204 KB Output is correct
4 Correct 2 ms 4172 KB Output is correct
5 Correct 3 ms 4172 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 2 ms 4172 KB Output is correct
10 Correct 2 ms 4172 KB Output is correct
11 Correct 2 ms 4172 KB Output is correct
12 Correct 2 ms 4164 KB Output is correct
13 Correct 2 ms 4172 KB Output is correct
14 Correct 19 ms 4236 KB Output is correct
15 Correct 16 ms 4228 KB Output is correct
16 Correct 16 ms 4228 KB Output is correct
17 Correct 27 ms 4172 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 13 ms 4224 KB Output is correct
20 Correct 2 ms 4172 KB Output is correct
21 Correct 2 ms 4172 KB Output is correct
22 Correct 2 ms 4172 KB Output is correct
23 Correct 2 ms 4172 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 16 ms 4224 KB Output is correct
26 Correct 21 ms 4232 KB Output is correct
27 Correct 7 ms 4160 KB Output is correct
28 Correct 16 ms 4232 KB Output is correct
29 Correct 20 ms 4224 KB Output is correct
30 Correct 27 ms 4236 KB Output is correct