제출 #320405

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
320405		Marlov	Kitchen (BOI19_kitchen)	C++14	0 / 100	64 ms	111460 KiB

kitchen

/*
Code by @marlov       
*/
#include <iostream>
#include <fstream>
#include <string>
#include <sstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <utility>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <iterator>
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
 
#define maxV 305
#define INF 1000000000
 
int N,M,K;
int A[maxV];
int B[maxV];
int dp[maxV][maxV*maxV];
int mina=maxV;
int At=0;
int Bt=0;
//dp values and value after chef i works on it
int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	cin>>N>>M>>K;
	for(int i=0;i<maxV;i++){
		fill(dp[i],dp[i]+(maxV*maxV),INF);
	}
	for(int i=1;i<=N;i++){
		cin>>A[i];
		mina=min(mina,A[i]);
		At+=A[i];
	}
	if(mina<K){
		cout<<"Impossible"<<'\n';
		return 0;
	}
	for(int i=1;i<=M;i++){
		cin>>B[i];
		Bt+=B[i];
	}
	dp[0][0]=At-(N*K);
	for(int i=1;i<=M;i++){
		//possibly forgetting to propigate last values
		for(int j=0;j<min(N,B[i]);j++){
			dp[i][j]=dp[i-1][j];
		}
		for(int j=min(N,B[i]);j<=N*K;j++){
			dp[i][j]=min( dp[i-1][j] , dp[i-1][j-min(B[i],N)]-(B[i]-min(N,B[i])) );
		}
	}

	if(dp[M][N*K]>Bt){
		cout<<"Impossible"<<'\n';
		return 0;
	}else{
		cout<<-1*dp[M][N*K]<<'\n';
	}
    return 0;
}
 
/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1,n=0?)
	* do smth instead of nothing and stay organized
*/

• Subtask 1: 0 / 9
• Subtask 2: 0 / 22
• Subtask 3: 0 / 20
• Subtask 4: 0 / 21
• Subtask 5: 0 / 28