Submission #1540623

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <fstream>
#include <string.h>
#include <cctype>
#include <list>
#include <vector>
#include <cstdlib>
#include <stack>
#include <cmath>
#include <limits.h>
#include <math.h>
#include <map>
#include <deque>
#include <utility>
#include <set>
#define xfor(i,start,end) for(ll i=start;i<end;i++)
#define rfor(i,end,start) for(int i=end-1;i>=start;i--)
#define scan(x) scanf("%d",&x)
#define print(x) printf("%d ",x)
#define init(x) memset(x,0,sizeof(x))
#define pb push_back
#define pf pop_front
#define mp make_pair
#define f first
#define s second
#define ull unsigned long long
#define PI 3.141592654
typedef long long ll;
const ll INF=ll(1e18);
const int MOD=1e9+7;
using namespace std;
list<int> adj[100000];
bool flag=false;
vector<string> re;
int q,h,s,d,n;

ll ans(int n,ll *dp){
	ll res=0;
	if(n==0)	return 0;
	if(dp[n]!=0)	return dp[n];
	
	else{
		if(n>=8)	res=min(min(ans(n-8,dp)+d,ans(n-4,dp)+s),min(ans(n-2,dp)+h,ans(n-1,dp)+q));
		else if(n>=4)	res=min(ans(n-4,dp)+s,min(ans(n-2,dp)+h,ans(n-1,dp)+q));
		else if(n>=2)	res=min(ans(n-2,dp)+h,ans(n-1,dp)+q);
		else res=ans(n-1,dp)+q;
	} 
	dp[n]=res;
	return dp[n];
}

int main()
{
	cin>>q>>h>>s>>d>>n;
	ll dp[4*n+1];
	init(dp);
	ans(4*n,dp);
	cout<<dp[4*n]<<endl;

	return 0;
}

Submission Info

Judge Result