제출 #1216216

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1216216		MuhammadSaram	Uplifting Excursion (BOI22_vault)	C++20	0 / 100	380 ms	520 KiB

vault

#include <bits/stdc++.h>

using namespace std;

#define endl '\n'
#define all(v) v.begin(), v.end()

const int M = 10000;

int pos[M*2+1];

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(NULL), cout.tie(NULL);
	
	int m,l;
	cin>>m>>l;
	map<int,int> a;
	for (int i=-m;i<=m;i++)
		cin>>a[i];
	for (int i=0;i<=M*2;i++)
		pos[i]=-M*M;
	pos[M]=a[0];
	for (int i=-m;i<0;i++)
		for (int j=0;j<=M*2;j++)
		{
			int mx=pos[j];
			for (int c=1;c<=a[i];c++)
				if (j-c*i<=M*2)
					mx=max(mx,pos[j-c*i]+c);
			pos[j]=mx;
		}
	for (int i=1;i<=m;i++)
		for (int j=M*2;j>=0;j--)
		{
			int mx=pos[j];
			for (int c=1;c<=a[i];c++)
				if (j-c*i>=0)
					mx=max(mx,pos[j-c*i]+c);
			pos[j]=mx;
		}
	if (l<-M or l>M or pos[l+M]<0)
		cout<<"impossible"<<endl;
	else
		cout<<pos[l+M]<<endl;
	
	return 0;
}

• 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