Submission #147942

#	Time	Username	Problem	Language	Result	Execution time	Memory
147942		MvC	Kitchen (BOI19_kitchen)	C++11	100 / 100	141 ms	100604 KiB

kitchen

#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include<bits/stdc++.h>
//#include "boxes.h"
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<61);
const int inf=(1<<30);
const int nmax=3e2+50;
const int mod=1e9+7;
using namespace std;
int n,m,k,a[nmax],b[nmax],f[nmax][nmax*nmax],sa,sb,i,j;
int main()
{
	//freopen("sol.in","r",stdin);
	//freopen("sol.out","w",stdout);
	//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
	cin>>n>>m>>k;
	for(i=1;i<=n;i++)cin>>a[i];
	for(i=1;i<=m;i++)
	{
		cin>>b[i];
		sb+=b[i];
	}
	for(i=1;i<=n;i++)
	{
		if(a[i]<k)rc("Impossible");
		sa+=a[i];
	}
	for(i=0;i<=m;i++)
	{
		for(j=0;j<=sb;j++)
		{
			if(j)f[i][j]=-1;
			if(i)f[i][j]=f[i-1][j];
			if(i && j>=b[i] && f[i-1][j-b[i]]!=-1)f[i][j]=max(f[i][j],f[i-1][j-b[i]]+min(b[i],n));
		}
	}
	for(i=sa;i<=sb;i++)if(f[m][i]>=n*k)rc(i-sa);
	rc("Impossible");
	return 0;
}

Compilation message (stderr)

kitchen.cpp:2:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("O3")
 
kitchen.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("unroll-loops")

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