BZOJ 1059 ZJOI2007 矩阵游戏

 1 #include <bits/stdc++.h>
 2 #define ll long long
 3 using namespace std;
 4 inline int read(){
 5     int x=0;int f=1;char ch=getchar();
 6     while(!isdigit(ch)) {if(ch==‘-‘) f=-1;ch=getchar();}
 7     while(isdigit(ch)){x=x*10+ch-‘0‘;ch=getchar();}
 8     return x*f;
 9 }
10 const int MAXN=1e3+10;
11 int a[MAXN][MAXN],ine[MAXN],n,vis[MAXN];
12 inline int work(int st){
13     for(int i=1;i<=n;i++){
14         if(!vis[i]&&a[st][i]){
15             vis[i]=1;
16             if(!ine[i]||work(ine[i])){
17                 ine[i]=st;
18                 return 1;
19             }
20         }
21     }
22     return 0;
23 }
24 int main(){
25     int T=read();
26     while(T--){
27         memset(a,0,sizeof(a));
28         memset(ine,0,sizeof(ine));
29         n=read();
30         for(int i=1;i<=n;i++){
31             for(int j=1;j<=n;j++){
32                 a[i][j]=read();
33             }
34         }
35         int flag=1;
36         for(int i=1;i<=n;i++){
37             memset(vis,0,sizeof(vis));
38             if(!work(i)){
39                 printf("No\n"),flag=0;
40                 break;
41             }
42         }
43         if(flag) printf("Yes\n");
44     }
45 }