【题解】 [ZJOI2009]假期的宿舍 （二分图匹配）

bool find(int k){
  for(int i=head[k];i!=0;i=edge[i].nxt){
    int v=edge[i].to;//cout<<k<<‘ ‘<<v<<endl;
    if(bed[v]!=1)continue;
    if(!vis[v]){
      vis[v]=true;
      if(be[v]==-1||find(be[v])){be[v]=k;return true;}
    }
  }return false;
}

//It is coded by Ning_Mew on 3.15
#include<bits/stdc++.h>

using namespace std;

const int maxn=50+7;

int T,n,be[maxn],bed[maxn],stay[maxn];
bool vis[maxn];
int head[maxn],cnt=0;
struct Edge{
  int nxt,to;
}edge[maxn*maxn];

void add(int from,int to){
  edge[++cnt].nxt=head[from];
  edge[cnt].to=to;
  head[from]=cnt;
}
void clear(){
  memset(head,0,sizeof(head));cnt=0;
  memset(be,-1,sizeof(be));
  memset(bed,0,sizeof(bed));
  memset(stay,0,sizeof(stay));
  memset(vis,false,sizeof(vis));
}
bool find(int k){
  for(int i=head[k];i!=0;i=edge[i].nxt){
    int v=edge[i].to;//cout<<k<<‘ ‘<<v<<endl;
    if(bed[v]!=1)continue;
    if(!vis[v]){
      vis[v]=true;
      if(be[v]==-1||find(be[v])){be[v]=k;return true;}
    }
  }return false;
}
void work(){
  clear();
  scanf("%d",&n);
  for(int i=1;i<=n;i++)scanf("%d",&bed[i]);
  for(int i=1;i<=n;i++){
    scanf("%d",&stay[i]);
    stay[i]=stay[i]^1;
    if(bed[i]==0)stay[i]=1;
  }
  for(int i=1;i<=n;i++){
    if(bed[i]==1)add(i,i);
    for(int j=1;j<=n;j++){
      int box;scanf("%d",&box);
      if(box){add(i,j);}
    }
  }
  for(int i=1;i<=n;i++){
    if(stay[i]!=1)continue;
    memset(vis,false,sizeof(vis));
    if(find(i));else{printf("T_T\n");return;}
  }
  //for(int i=1;i<=n;i++)cout<<be[i]<<‘ ‘;cout<<endl;
  printf("^_^\n");return;
}
int main(){
  scanf("%d",&T);
  for(int i=1;i<=T;i++)work();
  return 0;
}