BZOJ 1059 [ZJOI2007]矩阵游戏 (二分图最大匹配)

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <cstdio>
#include <string>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <cstring>
#include <set>
#include <queue>
#include <algorithm>
#include <vector>
#include <map>
#include <cctype>
#include <cmath>
#include <stack>
#include <sstream>
#include <list>
#include <assert.h>
#include <bitset>
#include <numeric>
#define debug() puts("++++")
#define gcd(a, b) __gcd(a, b)
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define fi first
#define se second
#define pb push_back
#define sqr(x) ((x)*(x))
#define ms(a,b) memset(a, b, sizeof a)
#define sz size()
#define pu push_up
#define pd push_down
#define cl clear()
//#define all 1,n,1
#define FOR(i,x,n)  for(int i = (x); i < (n); ++i)
#define freopenr freopen("in.txt", "r", stdin)
#define freopenw freopen("out.txt", "w", stdout)
using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> P;
const int INF = 0x3f3f3f3f;
const LL LNF = 1e17;
const double inf = 1e20;
const double PI = acos(-1.0);
const double eps = 1e-8;
const int maxn = 400 + 10;
const int maxm = 3e5 + 10;
const ULL mod = 3;
const int dr[] = {-1, 0, 1, 0};
const int dc[] = {0, -1, 0, 1};
const char *de[] = {"0000", "0001", "0010", "0011", "0100", "0101", "0110", "0111", "1000", "1001", "1010", "1011", "1100", "1101", "1110", "1111"};
int n, m;
const int mon[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
const int monn[] = {0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
inline bool is_in(int r, int c) {
  return r >= 0 && r < n && c >= 0 && c < m;
}

struct Edge{
  int to, next;
};
Edge edges[maxn*maxn<<1];
int head[maxn], cnt;

void addEdge(int u, int v){
  edges[cnt].to = v;
  edges[cnt].next = head[u];
  head[u] = cnt++;
}

int match[maxn];
bool vis[maxn];

bool dfs(int u){
  vis[u] = 1;
  for(int i = head[u]; ~i; i = edges[i].next){
    int v = edges[i].to, w = match[v];
    if(w < 0 || !vis[w] && dfs(w)){
      match[u] = v;
      match[v] = u;
      return true;
    }
  }
  return false;
}

int main(){
  int T;  cin >> T;
  while(T--){
    scanf("%d", &n);
    ms(head, -1);  cnt = 0;
    for(int i = 0; i < n; ++i)
      for(int j = 0; j < n; ++j){
        int x;  scanf("%d", &x);
        if(x)  addEdge(i, j+n), addEdge(j+n, i);
      }
    int ans = 0;  ms(match, -1);
    for(int i = 0; i < n; ++i)  if(match[i] < 0){
      ms(vis, 0);  if(dfs(i)) ++ans;
    }
    puts(ans == n ? "Yes" : "No");
  }
  return 0;
}