提出 #48103325

---

ソースコード 拡げる

#include <bits/stdc++.h>

using namespace std;

#define int long long
#define pb push_back
#define fi first
#define se second
#define ld long double
#define pi pair<int, int>
#define mp make_pair

//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

const int INF = (int)4e18;
const int MODa = 1e9 + 7;
const int MOD = 998244353;

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

void solve()
{
	int n, s, m, l;
	cin>>n>>s>>m>>l;

	vector<int> dp(115, INF);
	dp[0] = 0;

	int ps[] = {6, 8, 12};
	int pr[] = {s, m, l};

	for(int i=1; i<115; i++)
	{
		for(int j=0; j<3; j++)
		{
			if(i>=ps[j])
			{
				dp[i]=  min(dp[i], dp[i-ps[j]] + pr[j]);
			}
		}
	}

	for(int i=113; i; i--)
	{
		dp[i] = min(dp[i], dp[i+1]);
	}

	cout<<dp[n]<<"\n";
}

signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);

	int t = 1;	
	//cin>>t;
	while(t--)
	{
		solve();
	}

	return 0;
}

提出情報

ジャッジ結果