1
3
1 1 0
0 1 0
0 1 1
1 0 0
1 0 0

ˆ ˆ

对于30% 的数据满足1 ≤ n ≤ 12。
对于100% 的数据满足1 ≤ n ≤ 50,1 ≤ T ≤ 20。

 

#include<cstdio>

#include<iostream>

#include<cstring>

#define cls(x) memset(x,0,sizeof(x))

#define For(i,x,y) for(int i=x;i<=y;++i)

#define N 55

using namespace std;

int a[N],b[N],map[N][N];

int p[*N];

int vis[N*];int n;

bool find(int u)

{

    For(i,,n)

    {

        if(vis[i]||!map[u][i])continue;

        vis[i]=;

        if(!p[i]||find(p[i])){p[i]=u;return ;}

    }

    return ;

}

void work()

{

    memset(p,,sizeof(p));

    cin>>n;int ans=;

    For(i,,n)scanf("%d",&a[i]);

    For(i,,n){scanf("%d",&b[i]);if(!a[i])b[i]=;}int x;

    For(i,,n)For(j,,n)scanf("%d",&x),map[i][j]=(x&a[j]);

    For(i,,n)For(j,,n)if(a[i])map[i][i]=;

    bool can=;

    For(i,,n)

    {

        cls(vis);if(b[i])continue;

        if(!find(i))can=;

    }

    if(can)printf("^_^\n");else printf("T_T\n");

}

int main()

{

    int T;cin>>T;

    while(T--)work();

    return ;

}