UVA 10626 Buying Coke (记忆化）

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<string>
#include<iostream>
#include<queue>
#include<cmath>
#include<map>
#include<stack>
#include<bitset>
using namespace std;
#define REPF( i , a , b ) for ( int i = a ; i <= b ; ++ i )
#define REP( i , n ) for ( int i = 0 ; i < n ; ++ i )
#define CLEAR( a , x ) memset ( a , x , sizeof a )
typedef long long LL;
typedef pair<int,int>pil;
const int INF = 0x3f3f3f3f;
const int maxn=1100;
char str[maxn];
int dp[1100][155][55];
int n1,n2,n3,c;
int dfs(int num,int x1,int x2,int x3)//num,1,5,10
{
if(num==0) return 0;
int &res=dp[x1][x2][x3];
if(res!=⑴) return res;
res=INF;
if(x3>=1) res=min(res,dfs(num⑴,x1+2,×2,x3⑴)+1);
if(x2>=2) res=min(res,dfs(num⑴,x1+2,×2⑵,x3)+2);
if(x1>=8) res=min(res,dfs(num⑴,x1⑻,x2,x3)+8);
if(x1>=3&&x3>=1) res=min(res,dfs(num⑴,x1⑶,x2+1,×3⑴)+4);
if(x1>=3&&x2>=1) res=min(res,dfs(num⑴,x1⑶,x2⑴,x3)+4);
return res;
}
int main()
{
int t;
scanf("%d",&t);
while(t–)
{
scanf("%d%d%d%d",&c,&n1,&n2,&n3);
CLEAR(dp,⑴);
printf("%d
",dfs(c,n1,n2,n3));
}
return 0;
}