제출 #525541

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
525541		Yazan_Alattar	Kitchen (BOI19_kitchen)	C++14	컴파일 에러	0 ms	0 KiB

kitchen

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define all(x) x.begin(), x.end()
const int M = 47;
const ll inf = 1e18;
const ll mod = 998244353;
const double pi = acos(-1);
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
 
int n, m, k, sum, a[M], b[M];
bool dp[M * M][M * M];
 
int main()
{
	scanf("%d%d%d", &n, &m, &k);
	for(int i = 1; i <= n; ++i) {
		scanf("%d",  &a[i]);
		sum += a[i];
		if(a[i] < k) printf("Impossible\n"), exit(0);
	}
	for(int i = 1; i <= m; ++i) scanf("%d", &b[i]), tot += b[i];
	if(sum > tot) printf("Impossible\n"), exit(0);
	
	dp[0][0] = 1;
	for(int i = 1; i <= m; ++i) {
		for(int cost = M * M - b[i] - 1; cost >= 0; --cost) {
			for(int filled = 0; filled + min(n, b[i]) < M * M; ++filled) {
				dp[filled + min(n, b[i])][cost + b[i]] |= dp[filled][cost];
			}
		}
		for(int cost = M * M - b[i] - 1; cost >= 0; --cost)
			for(int filled = M * M - 2; filled >= 0; --filled)
				dp[filled][cost] |= dp[filled + 1][cost];
	}
	
	for(int i = sum; i < M * M; ++i) if(dp[n * k][i]) printf("%d\n", i - sum), exit(0);
	printf("Impossible\n");
	
	return 0;
}

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

kitchen.cpp: In function 'int main()':
kitchen.cpp:26:50: error: 'tot' was not declared in this scope
   26 |  for(int i = 1; i <= m; ++i) scanf("%d", &b[i]), tot += b[i];
      |                                                  ^~~
kitchen.cpp:27:11: error: 'tot' was not declared in this scope
   27 |  if(sum > tot) printf("Impossible\n"), exit(0);
      |           ^~~
kitchen.cpp:20:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |  scanf("%d%d%d", &n, &m, &k);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~
kitchen.cpp:22:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |   scanf("%d",  &a[i]);
      |   ~~~~~^~~~~~~~~~~~~~