【Atcoder O Matching】

Atc O
题意 n 个男生和 n 个女生匹配方案数
要往状压考虑
dp[i][mask]表示枚举到第i 个男士，女士选择的情况为j 的方案数

枚举i−1这个人选的是j 必须保证mask 包含j且i-1与j有边

然后就可以相加

然后我们发现不需要枚举i

因为mask 中包含的1的个数就是i 的值

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define