萌新求助，刚学OI，我是男的

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector> 
#define M(a) memset(a,0,sizeof(a))
using namespace std;

const int maxn=55;

int n,t;
int ins[maxn],iss[maxn],result[maxn],usd[maxn];
int f[maxn][maxn];

bool dfs(int x){
	for(int i=1;i<=n;i++){
		if(f[x][i]&&!usd[i]){
			usd[i]=1;
			if(!result[i]||dfs(result[i])){
				result[i]=x;return true;
			}
		}
	}
	return false;
}

bool xiongyali(){
	for(int i=1;i<=n;i++)if((iss[i]&&ins[i])||(!iss[i])){
		M(usd);
		if(!dfs(i)){
//			cout<<" not ok  i="<<i<<endl;
			return false;	
		}
//		cout<<" ok  i="<<i<<endl;
	}
	return true;
}

int main(){
	scanf("%d",&t);
	while(t--){
		scanf("%d",&n);
		M(iss);M(ins);M(f);M(result);
		for(int i=1;i<=n;i++)scanf("%d",&iss[i]);
		for(int i=1;i<=n;i++)scanf("%d",&ins[i]);
		for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)scanf("%d",&f[i][j]);
		for(int i=1;i<=n;i++)f[i][i]=1;
		if(xiongyali())printf("^_^\n");
		else printf("T_T\n");
	}
	
}