bzoj1059: [ZJOI2007]矩阵游戏

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define rep(i,s,t) for(int i=s;i<=t;i++)
#define clr(x,c) memset(x,c,sizeof(x))
#define qwq(x) for(edge *o=head[x];o;o=o->next)
int read(){
	int x=0;char c=getchar();
	while(!isdigit(c)) c=getchar();
	while(isdigit(c)) x=x*10+c-‘0‘,c=getchar();
	return x;
}
const int nmax=205;
struct edge{
	int to;edge *next;
};
edge edges[nmax*nmax],*pt,*head[nmax<<1];
bool vis[nmax<<1];int match[nmax<<1];
void add(int s,int t){
	pt->to=t;pt->next=head[s];head[s]=pt++;
}
bool dfs(int x){
	qwq(x){
		int to=o->to;
		if(vis[to]) continue;
		vis[to]=true;
		if(match[to]==-1||dfs(match[to])){
			match[to]=x;return true;
		}
	}
	return false;
}
bool solve(int n){
	int ans=0;
	rep(i,1,n) {
		clr(vis,0);
		if(dfs(i)) ans++;
		else break;
	}
	return ans==n;
}
void init(){
	clr(head,0);pt=edges;clr(match,-1);
}
int main(){
	int cas=read(); 
	rep(i,1,cas){
		init();
		int n=read();
		rep(j,1,n) rep(k,1,n) {
			int tmp=read();
			if(tmp==1) add(j,n+k);
		}
		if(solve(n)) printf("Yes\n");
		else printf("No\n");
	}
	return 0;
}