uva 10626

DP記憶化

//====================================================================||
//                                                                    ||
//                                                                    ||
//                         Author : GCA                               ||
//                  6AE7EE02212D47DAD26C32C0FE829006                  ||
//====================================================================||
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\n")
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()
#define De(x)printf(#x"%d\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\
    printf("%d ",dp[htx][hty]);}Pln();}
#define M 1005
#define PII pair<int,int>
#define PB push_back
#define oo INT_MAX
#define Set_oo 0x3f
#define Is_debug true
#define debug(...) if(Is_debug)printf("DEBUG: "),printf(__VA_ARGS__)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
    int tmp=min(x,y);
    return min(tmp,z);
}
int max3(int x,int y,int z){
    int tmp=max(x,y);
    return max(tmp,z);
}
int c,n,m,k;
int dp[800][400][60];
int target;
int dfs(int n1,int n5,int n10){
    if(dp[n1][n5][n10]!=-1)return dp[n1][n5][n10];
    int minc=oo;
    if(n1+n5*5+n10*10==target){
        dp[n1][n5][n10]=0;
        return 0;
    }
    int nowc;
    if(n1>=8){
        nowc=dfs(n1-8,n5,n10);
        minc=min(minc,nowc+8);
    }
    if(n1>=3&&n5>=1){
        nowc=dfs(n1-3,n5-1,n10);
        minc=min(minc,nowc+4);
    }
    if(n5>=2){
        nowc=dfs(n1+2,n5-2,n10);
        minc=min(minc,nowc+2);
    }
    if(n10>=1){
        nowc=dfs(n1+2,n5,n10-1);
        minc=min(minc,nowc+1);
    }
    if(n10>=1&&n1>=3){
        nowc=dfs(n1-3,n5+1,n10-1);
        minc=min(minc,nowc+4);
    }
    dp[n1][n5][n10]=minc;
    return minc;
}
void solve(){
    printf("%d\n",dfs(n,m,k));
}
void init(){
    Set(dp,-1);
}
int main() {
    ios_base::sync_with_stdio(0);
    int test;
    scanf("%d",&test);
    while(test--){
        init();
        scanf("%d%d%d%d",&c,&n,&m,&k);
        target=n+5*m+10*k-8*c;
        solve();

    }

















}