记录编号	586262	评测结果	AAAAAAAAAA
题目名称	[ZJOI 2009] 假期的宿舍	最终得分	100
用户昵称	┭┮﹏┭┮	是否通过	通过
代码语言	C++	运行时间	0.000 s
提交时间	2024-01-10 21:30:50	内存使用	0.00 MiB

#include <bits/stdc++.h> 
using namespace std;
const int N = 110,M = 2e4+10;
int t,n,now,ans;
struct made{
    int ver,nx;
}e[M];
int hd[N],tot;
int match[N],a[N],b[N];
bool v[N];
void add(int x,int y){
    tot++;
    e[tot].nx = hd[x],e[tot].ver = y,hd[x] = tot;
}
bool dfs(int x){
    for(int i = hd[x];i;i = e[i].nx){
        int y = e[i].ver;
        if(v[y])continue;
        v[y] = 1;
        if(!match[y] || dfs(match[y])){
            match[y] = x;
            return 1;
        }
    }
    return 0;
}
int main(){
    freopen("zjoi09holiday.in","r",stdin);
    freopen("zjoi09holiday.out","w",stdout);
    scanf("%d",&t);
    while(t--){
        tot = ans = now = 0;
        memset(match,0,sizeof(match));
        memset(hd,0,sizeof(hd));
        scanf("%d",&n);
        for(int i = 1;i <= n;i++)scanf("%d",&a[i]);
        for(int i = 1;i <= n;i++){
            scanf("%d",&b[i]);
            if(a[i] && b[i])now++;
        }
        for(int i = 1;i <= n;i++){
            if(a[i] && !b[i])add(i,i);
            for(int j = 1;j <= n;j++){
                int x;scanf("%d",&x);
                if(a[i] && b[i])continue;
                if(x && a[j])add(i,j);
            }
        }
        for(int i = 1;i <= n;i++){
            memset(v,0,sizeof(v));
            if(dfs(i))ans++;
        } 
        if(ans == n - now)printf("^_^\n");
        else printf("T_T\n");
    }
	
	
	return 0;
	
}