UVa11125Arrange Some Marbles

最新推荐文章于 2020-02-26 22:18:30 发布

mowayao

最新推荐文章于 2020-02-26 22:18:30 发布

阅读量872

点赞数

分类专栏： DP

本文链接：https://blog.csdn.net/mowayao/article/details/18557899

版权

DP 专栏收录该内容

37 篇文章 0 订阅

订阅专栏

Problem H
Arrange Some Marbles
Input: Standard Input

Output: Standard Output

you are given some marbles of n different color. You have to arrange these marbles in a line. The marbles adjacent with same color form a group. In each group there can be 1 to 3 marble. Adjacent group should have different color and size. The first and last group also should have different color and size. You are given the number of each of these n marbles. You have count the number of ways you can arrange them in a line maintaining the above constraints. For example you have 4 red marbles and 4 green marbles. You can arrange them in the following 8 way - GGGRRGRR, GGRGGRRR, GGRRRGGR, GRRGGGRR, RGGRRRGG, RRGGGRRG, RRGRRGGG, RRRGGRGG.

Input

Input contains multiple number of test cases. The first line contain the number of test cases t (t<3000). Each of the next line contains one test case. Each test case starts with n (1 ≤ n ≤ 4) the number of different color. Next contains n integers. The i'th integer denotes the number of marble of color i. The number of marbles of any color is within the range 0..7 (inclusive). The color of the marbles are numbered from 1 to n.

Output

For each test case output contains one integer in one line denoting the number of ways you can arrange the marbles.

Sample Input Output for Sample Input

2 3 3

2 4 4

2 6 6

3 3 4 5

3 4 5 6

4 2 3 4 5

174

1234

1440

这是一道DP记数题：DP[sta][stasize][n1][n2][n3][n4][last][lastsize]

有一个坑点就是当输入全都是0的时候输出1。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
using namespace std;
typedef long long ll;
ll dp[5][9][9][9][9][9][5][9];
int cnt[6];
int n,sum;
ll dfs(int sta,int stasize,int n1,int n2,int n3,int n4,int last,int lastsize){
    if(n1==0&&n2==0&&n3==0&&n4==0){
        if(last!=sta&&stasize!=lastsize){
            return 1;
        }
    }
    if(dp[sta][stasize][n1][n2][n3][n4][last][lastsize] != -1)
        return dp[sta][stasize][n1][n2][n3][n4][last][lastsize];
    int ans = 0;
    if(last==1){
        for(int i = 1; i <= 3; i++){
            if(n2>=i&&lastsize!=i) ans += dfs(sta,stasize,n1,n2-i,n3,n4,2,i);
            if(n3>=i&&lastsize!=i) ans += dfs(sta,stasize,n1,n2,n3-i,n4,3,i);
            if(n4>=i&&lastsize!=i) ans += dfs(sta,stasize,n1,n2,n3,n4-i,4,i);
        }
    }
    else if(last==2){
        for(int i = 1; i <= 3; i++){
            if(n1>=i&&lastsize!=i) ans += dfs(sta,stasize,n1-i,n2,n3,n4,1,i);
            if(n3>=i&&lastsize!=i) ans += dfs(sta,stasize,n1,n2,n3-i,n4,3,i);
            if(n4>=i&&lastsize!=i) ans += dfs(sta,stasize,n1,n2,n3,n4-i,4,i);
        }
    }
    else if(last==3){
        for(int i = 1; i <= 3; i++){
            if(n1>=i&&lastsize!=i) ans += dfs(sta,stasize,n1-i,n2,n3,n4,1,i);
            if(n2>=i&&lastsize!=i) ans += dfs(sta,stasize,n1,n2-i,n3,n4,2,i);
            if(n4>=i&&lastsize!=i) ans += dfs(sta,stasize,n1,n2,n3,n4-i,4,i);
        }
    }
    else{
        for(int i = 1; i <= 3; i++){
            if(n1>=i&&lastsize!=i) ans += dfs(sta,stasize,n1-i,n2,n3,n4,1,i);
            if(n2>=i&&lastsize!=i) ans += dfs(sta,stasize,n1,n2-i,n3,n4,2,i);
            if(n3>=i&&lastsize!=i) ans += dfs(sta,stasize,n1,n2,n3-i,n4,3,i);
        }
    }
    return dp[sta][stasize][n1][n2][n3][n4][last][lastsize] = ans;

}
int main(){

    int ncase;
    cin >> ncase;
    memset(dp,-1,sizeof dp);
    while(ncase--){
        scanf("%d",&n);
        sum = 0;
        memset(cnt,0,sizeof cnt);
        for(int i = 1; i <= n; i++)
            scanf("%d",&cnt[i]),sum+=cnt[i];
        if(sum == 0) {cout<<1<<endl;continue;}
        int ans = 0;
        for(int i = 1; i <= n; i++){
            if(i==1)for(int j = 1; j <= 3; j++)  if(cnt[1]>=j)ans += dfs(1,j,cnt[1]-j,cnt[2],cnt[3],cnt[4],1,j);
            if(i==2)for(int j = 1; j <= 3; j++)  if(cnt[2]>=j)ans += dfs(2,j,cnt[1],cnt[2]-j,cnt[3],cnt[4],2,j);
            if(i==3)for(int j = 1; j <= 3; j++)  if(cnt[3]>=j)ans += dfs(3,j,cnt[1],cnt[2],cnt[3]-j,cnt[4],3,j);
            if(i==4)for(int j = 1; j <= 3; j++)  if(cnt[4]>=j)ans += dfs(4,j,cnt[1],cnt[2],cnt[3],cnt[4]-j,4,j);
        }
        cout<<ans<<endl;

    }
    return 0;
}