제출 #1246377

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1246377		trideser	Uplifting Excursion (BOI22_vault)	C++20	5 / 100	5092 ms	19856 KiB

vault

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

int main() {
	int M, L;
	cin >> M >> L;
	int zindex = 500000;
	vector<int> maxcount(1000001, -1);
	vector<int> pieces(2 * M + 1);
	if(L + zindex < 0 || L + zindex >= 1000001) {
		cout << "impossible\n";
		return 0;
	}
	maxcount[zindex] = 0;
	for(int i = 0; i < 2 * M + 1; i++) {
		cin >> pieces[i];
	}
	vector<int> valid = {zindex};
	for(int i = -M, ix = 0; i <= M; i++, ix++) {
		vector<int> newmaxcount = maxcount;
		vector<int> newvalid = valid;
		//for(int j = 0; j < maxcount.size(); j++) {
		for(int j : valid) {
			if(maxcount[j] == -1)
				continue;
			for(int k = 1; k <= pieces[ix]; k++) {
				if(newmaxcount[j + k * i] == -1)
					newvalid.push_back(j + k * i);
				newmaxcount[j + k * i] = max(newmaxcount[j + k * i], maxcount[j] + k);
			}
		}
		valid = newvalid;
		maxcount = newmaxcount;
	}
	if(maxcount[L + zindex] == -1)
		cout << "impossible\n";
	else
		cout << maxcount[L + zindex] << "\n";
	return 0;
}

• Subtask 1: 5 / 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