존못코딩

#include <stdio.h>
#include <algorithm>
#include <vector>
using namespace std;
 
vector <int> back;
vector <vector <int> >vec;
vector <bool> chk;
char a[2][501][5];
 
bool bip(int v)
{
    int u;
    for (int i = 0; i < vec[v].size(); i++)
    {
        u = vec[v][i];
        if (chk[u])continue;
        chk[u] = true;
        if (back[u] == -1 || bip(back[u]))
        {
            back[u] = v;
            return true;
        }
    }
    return false;
 
}
int main()
{
    int t;
    scanf("%d", &t);
    while (t--) {
        int c, d, v;
        scanf("%d %d %d", &c, &d, &v);
        vec = vector <vector <int> >(v + 1);
        back = vector <int>(v+1, -1);
        for (int i = 0; i < v; i++) {
            scanf("%s %s", a[0][i], a[1][i]);
        }
        for (int i = 0; i < v-1; i++) {
            for (int j = i + 1; j < v; j++) {
                if (!strcmp(a[0][i], a[1][j]) || !strcmp(a[1][i], a[0][j])) {
                    if (a[0][i][0] == 'C')vec[i].push_back(j);
                    else vec[j].push_back(i);
                }
            }
        }
        int ans = 0;
        for (int i = 0; i < v; i++) {
            chk = vector <bool>(v + 1, false);
            if (bip(i))ans++;
        }
        printf("%d\n", v-ans);
    }
 
    return 0;
}

#include <stdio.h>
#include <algorithm>
#include <math.h>
#include <vector>
#include <stdlib.h>
#include <queue>
#include <memory.h>
using namespace std;
 
#define ll long long
 
ll dp[11][11][11][11][11][6][6];
int cnt[6], n, s;

ll dy(int a, int b, int c, int d, int e, int pre, int ppre)
{
	if (a + b + c + d + e == s)return 1;
	ll &ret = dp[a][b][c][d][e][pre][ppre];
	if (ret != -1)return ret;

	ret = 0;

	if (cnt[1] > a && pre != 1 && ppre != 1)ret += dy(a + 1, b, c, d, e, 1, pre);
	if (cnt[2] > b&& pre != 2 && ppre != 2)ret += dy(a, b + 1, c, d, e, 2, pre);
	if (cnt[3] > c&& pre != 3 && ppre != 3)ret += dy(a, b, c + 1, d, e, 3, pre);
	if (cnt[4] > d&& pre != 4 && ppre != 4)ret += dy(a, b, c, d + 1, e, 4, pre);
	if (cnt[5] > e&& pre != 5 && ppre != 5)ret += dy(a, b, c, d, e + 1, 5, pre);

	return ret;
}

int main()
{
	scanf("%d", &n); 
	for (int i = 1; i <= n; i++) {
		scanf("%d", &cnt[i]);
		s += cnt[i];
	}
	memset(dp, 0xff, sizeof(dp));
	printf("%lld\n", dy(0, 0, 0, 0, 0, 0, 0));
}