UVA 10118 Free Candies

//开始以为是个数塔。。。

//记忆化搜索：dp[a][b][c][d]的意义是第一堆选了a， 第二堆选了b个， 。。。。。之后剩下的最大值；

#include<cstdio>
#include<iostream>
#include<cstring>
#include<string.h>
#include<algorithm>
using namespace std;
const int maxn = 40 + 5;
int vis[maxn][4];
int dp[maxn][maxn][maxn][maxn];
int n;
int solve(int a, int b, int c, int d, int s, int res)
{
    if(a==n && b==n && c==n && d==n || res == 5) return dp[a][b][c][d] = 0;
    if(dp[a][b][c][d] != -1) return dp[a][b][c][d];
    int ans = 0;
    if(a != n)
    {
        int p = (1<<vis[a+1][0]);
        if(s&p)
            ans = max(ans, solve(a+1, b, c, d, s ^ p, res -1)+1);
        else ans = max(ans,solve(a+1, b, c, d, s + p, res +1));
    }
    if(b != n)
    {
        int p = (1<<vis[b+1][1]);
        if(s&p)
            ans = max(ans, solve(a, b+1, c, d, s ^ p, res -1)+1);
        else ans = max(ans,solve(a, b+1, c, d, s + p, res +1));
    }
    if(c != n)
    {
        int p = (1<<vis[c+1][2]);
        if(s&p)
            ans = max(ans, solve(a, b, c+1, d, s ^ p, res -1)+1);
        else ans = max(ans,solve(a, b, c+1, d, s + p, res +1));
    }
    if(d != n)
    {
        int p = (1<<vis[d+1][3]);
        if(s&p)
            ans = max(ans, solve(a, b, c, d+1, s ^ p, res -1)+1);
        else ans = max(ans,solve(a, b, c, d+1, s + p, res +1));
    }
    return dp[a][b][c][d] = ans;
}
int main()
{
    while(scanf("%d", &n) == 1 && n)
    {
        memset(vis,0,sizeof(vis));
        memset(dp,-1,sizeof(dp));
        for(int i = 1; i <= n; ++i)
            for(int j = 0; j < 4; ++j) scanf("%d", &vis[i][j]);
        printf("%d\n",solve(0,0,0,0,0,0));
    }
    return 0;
}