https://www.luogu.org/problemnew/show/P2055

https://www.lydsy.com/JudgeOnline/problem.php?id=1433

题解：

最大匹配

参考文章：二分图

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
#define endl "\n"
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=100+10;
const int M=100000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,p,l,r,u,v;
int ans,cnt,flag,temp,sum;
int a[N],b[N];
int c[N][N],vis[N],match[N];
char str;
struct node{};
bool dfs(int u){

    for(int i=1;i<=n;i++){
        if(c[u][i]&&a[i]&&!vis[i]){
            vis[i]=1;
            if(!match[i]||dfs(match[i])){
                //match[u]=i;
                match[i]=u;
                return 1;
            }
        }
    }
    return 0;
}
int main()
{
#ifdef DEBUG
	freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
#endif
    //ios::sync_with_stdio(false);
    //cin.tie(0);
    //cout.tie(0);
    scanf("%d",&t);
    while(t--){
        scanf("%d",&n);
        memset(match,0,sizeof(match));
        for(int i=1;i<=n;i++)scanf("%d",&a[i]);
        for(int i=1;i<=n;i++)scanf("%d",&b[i]);
        for(int i=1;i<=n;i++){for(int j=1;j<=n;j++)scanf("%d",&c[i][j]);if(a[i])c[i][i]=1;}
        ans=1;
        for(int i=1;i<=n;i++){
            memset(vis,0,sizeof(vis));
            if((a[i]&&!b[i])||!a[i]){
                ans&=dfs(i);
            }
        }
        cout<<(ans?"^_^":"T_T")<<endl;
    }

#ifdef DEBUG
	printf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC);
#endif
    //cout << "Hello world!" << endl;
    return 0;
}