Submission #48104079

---

Source Code Expand

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

typedef long long ll;

#define rep(i,n) for(ll i=0;i<n;++i)
#define rrep(i,n) for(ll i=n-1;i>=0;--i)
#define FOR(i,s,e) for(ll i=s;i<=e;++i)
#define FFOR(i,s,e) for(ll i=s;i>=e;--i)

#define yesno(flg) if(flg){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}
#define ALL(a) (a).begin(),(a).end()
#define mp make_pair
#define pb push_back
#define vl vector<ll>
#define vs vector<string>
#define so(a) sort(a.begin(),a.end())

#define fi first
#define se second
#define print(a) cout<<a<<endl
#define ssize(a) (ll)(a.size())

#define MAX_N 1002
#define i197 1000000007
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

typedef pair<int,int> Pi;
typedef pair<ll, ll> P2;
typedef pair<P2,ll> P3;
typedef pair<P2,P2> P4;

const ll INF=1000000000000000001;


int main(){

	ios::sync_with_stdio(0);
	cin.tie(0);


	ll n;
	cin>>n;
	ll s,m,l;
	cin>>s>>m>>l;
	vl dp(105);

	rep(i,105)dp[i]=INF;

	dp[0]=0;
	rep(i,n){
		if(i+6>n)chmin(dp[n],dp[i]+s);
		else chmin(dp[i+6],dp[i]+s);

		if(i+8>n)chmin(dp[n],dp[i]+m);
		else chmin(dp[i+8],dp[i]+m);

		if(i+12>n)chmin(dp[n],dp[i]+l);
		else chmin(dp[i+12],dp[i]+l);

	}
	print(dp[n]);



	return 0;
}

Submission Info

Judge Result