【bzoj1059】 ZJOI2007—矩阵游戏

// bzoj1059
#include<algorithm>
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<queue>
#define LL long long
#define inf 10000000
#define Pi acos(-1.0)
#define free(a) freopen(a".in","r",stdin),freopen(a".out","w",stdout);
using namespace std;

const int maxn=300;
int p[maxn],vis[maxn],f[maxn][maxn];
int n,cnt;

bool match(int x) {
	for (int i=1;i<=n;i++) if (vis[i]!=cnt && f[x][i]) {
			vis[i]=cnt;
			if (!p[i] || match(p[i])) {p[i]=x;return 1;}
		}
	return 0;
}
int main() {
	int T;scanf("%d",&T);
	while (T--) {
		scanf("%d",&n);
		for (int i=1;i<=n;i++)
			for (int j=1;j<=n;j++) scanf("%d",&f[i][j]);
		int ans=0;cnt=0;
		memset(p,0,sizeof(p));
		memset(vis,0,sizeof(vis));
		for (int i=1;i<=n;i++) {
			cnt++;
			if (match(i)) ans++;
		}
		if (ans==n) puts("Yes");
		else puts("No");
	}
	return 0;
}