제출 #719481

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
719481		pavement	Kitchen (BOI19_kitchen)	C++17	100 / 100	31 ms	1652 KiB

kitchen

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define g0(a) get<0>(a)
#define g1(a) get<1>(a)
#define g2(a) get<2>(a)
#define g3(a) get<3>(a)
#define g4(a) get<4>(a)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
using db = double;
using ll = long long;
using ld = long double;
using ii = pair<int, int>;
using iii = tuple<int, int, int>;
using iiii = tuple<int, int, int, int>;
using iiiii = tuple<int, int, int, int, int>;
template<class key, class value = null_type, class cmp = less<key> >
using ordered_set = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;

int N, M, K, S, lim, A[305], B[305], dp[2][300 * 300 + 5];

main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> N >> M >> K;
	for (int i = 1; i <= N; i++) {
		cin >> A[i];
		if (A[i] < K) {
			return cout << "Impossible\n", 0;
		}
		S += A[i];
	}
	for (int i = 1; i <= M; i++) {
		cin >> B[i];
		lim += B[i];
	}
	for (int j = 1; j <= S; j++) {
		dp[0][j] = (int)-1e16;
	}
	for (int i = 1; i <= M; i++) {
		for (int j = 0; j <= lim; j++) {
			if (j >= B[i]) {
				dp[i & 1][j] = max(dp[i & 1 ^ 1][j], dp[i & 1 ^ 1][j - B[i]] + min(B[i], N));
			} else {
				dp[i & 1][j] = dp[i & 1 ^ 1][j];
			}
		}
	}
	for (int j = S; j <= lim; j++) {
		if (dp[M & 1][j] >= N * K) {
			cout << j - S << '\n';
			return 0;
		}
	}
	cout << "Impossible\n";
}

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

kitchen.cpp:30:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   30 | main() {
      | ^~~~
kitchen.cpp: In function 'int main()':
kitchen.cpp:51:29: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   51 |     dp[i & 1][j] = max(dp[i & 1 ^ 1][j], dp[i & 1 ^ 1][j - B[i]] + min(B[i], N));
      |                           ~~^~~
kitchen.cpp:51:47: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   51 |     dp[i & 1][j] = max(dp[i & 1 ^ 1][j], dp[i & 1 ^ 1][j - B[i]] + min(B[i], N));
      |                                             ~~^~~
kitchen.cpp:53:25: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   53 |     dp[i & 1][j] = dp[i & 1 ^ 1][j];
      |                       ~~^~~

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