제출 #1220076

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1220076		jellybean	Kitchen (BOI19_kitchen)	C++20	0 / 100	113 ms	211800 KiB

kitchen

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
typedef pair<int,int> pii;

const int N = 305, M = 305;
int dp[M][90005], a[N], b[M];

signed main(){
	ios::sync_with_stdio(0); cin.tie(0);
	
	int n,m,k; cin>>n>>m>>k;
	int tot = 0;
	for(int i=1; i<=n; i++) cin>>a[i], tot+=a[i];
	
	for(int i=1; i<=m; i++) cin>>b[i];
	
	dp[0][0] = 1;
	for(int i=1; i<=m; i++){
		for(int j=0; j<=90005; j++){
			if(dp[i-1][j]) dp[i][j] = 1;
			else if(j-b[i] >= 0) dp[i][j] = dp[i-1][j-b[i]];
		}
	}
	
	int ans = -1;
	for(int i=tot; i<=90005; i++){
		if(dp[m][i]) {ans = i-tot; break;}
	}
	
	if(ans == -1) cout<<"Impossible";
	else cout<<ans;
	
	return 0;
}

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

kitchen.cpp: In function 'int main()':
kitchen.cpp:23:37: warning: iteration 90005 invokes undefined behavior [-Waggressive-loop-optimizations]
   23 |                         if(dp[i-1][j]) dp[i][j] = 1;
      |                            ~~~~~~~~~^
kitchen.cpp:22:31: note: within this loop
   22 |                 for(int j=0; j<=90005; j++){
      |                              ~^~~~~~~

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