제출 #590357

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
590357		tutis	Uplifting Excursion (BOI22_vault)	C++17	0 / 100	5074 ms	596 KiB

vault

/*input
1 5
0 0 6

*/
#include <bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
using ll = long long;
using ull = unsigned long long;
using ld = long double;
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int M;
	ll L;
	cin >> M >> L;
	ll A[2 * M + 1];
	for (int i = 0; i <= 2 * M; i++)
		cin >> A[i];
	int D = 2500;
	vector<ll> C(2 * D + 1, -1e18);
	C[D] = 0;
	for (int i = -M; i <= M; i++)
	{
		vector<ll> C1 = C;
		for (int k = 1; k <= A[i + M]; k++)
		{
			for (int j = max(0, -k * i); j <= 2 * D + min(0, - k * i); j++)
			{
				C1[j + k * i] = max(C1[j + k * i], C[j] + k);
			}
		}
		C = C1;
	}
	if (C[L + D] >= 0)
		cout << C[L + D] << "\n";
	else
		cout << "impossible\n";
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 15
• Subtask 3-1: 0 / 10
• Subtask 3-2: 0 / 10
• Subtask 4-1: 0 / 10
• Subtask 4-2: 0 / 10
• Subtask 5-1: 0 / 10
• Subtask 5-2: 0 / 10
• Subtask 6-1: 0 / 10
• Subtask 6-2: 0 / 10