제출 #1254303

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1254303		_rain_	Kitchen (BOI19_kitchen)	C++20	100 / 100	80 ms	106808 KiB

kitchen

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;

#define BIT(mask,x) (((mask)>>(x))&(1))
#define MASK(x) ((LL)(1)<<(x))

template<class X,class Y>
	bool maximize(X &x, Y y){
		if (x<y) return x=y,true; else return false;
	}
template<class X,class Y>
	bool minimize(X &x,Y y){
		if (x>y) return x=y,true; else return false;
	}
	
const string no_wa = "Impossible";
const int inf = (int)1e9+7;
const int N = (int)300;
	int dp[N+2][N*N+2];
	int a[N+2] = {} , b[N+2] = {};
	int n , m , k;

	
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0) ; cout.tie(0);
	#define task "main"
	if (fopen(task".inp","r")){
		freopen(task".inp","r",stdin);
		freopen(task".out","w",stdout);
	}
	
	cin >> n >> m >> k;
	
	for(int i = 1; i <= n; ++i) cin >> a[i];
	for(int i = 1 ; i <= m; ++i) cin >> b[i];
	for(int i = 1; i <= n; ++i) if (a[i] < k) return cout<<no_wa,0;
	memset(dp,-0x3f,sizeof dp);
	int sum = 0;
		for(int i = 1; i <= m; ++i) sum += b[i];
	dp[0][0] = 0;
	for(int i = 1; i <= m; ++i){
		for(int cur_sum = 0; cur_sum <= sum; ++cur_sum) dp[i][cur_sum] = dp[i-1][cur_sum];
		for(int cur_sum = 0; cur_sum + b[i] <= sum; ++cur_sum){
			maximize(dp[i][cur_sum + b[i]] , dp[i-1][cur_sum] + min(n , b[i]));
		}
	}
	for(int i = accumulate(a+1,a+n+1,0); i <= sum; ++i){
		if (dp[m][i] >= k * n){
			cout<<i - accumulate(a+1,a+n+1,0);
			return 0;
		}
	}
	cout<<no_wa;
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

kitchen.cpp: In function 'int main()':
kitchen.cpp:30:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |                 freopen(task".inp","r",stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
kitchen.cpp:31:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |                 freopen(task".out","w",stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

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