BZOJ1059: [ZJOI2007]矩阵游戏(二分图匹配)

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#define LL long long 
using namespace std;
const int MAXN = 1e3 + 10, INF = 1e9 + 10;
inline int read() {
    char c = getchar(); int x = 0, f = 1;
    while(c < ‘0‘ || c > ‘9‘) {if(c == ‘-‘) f = -1; c = getchar();}
    while(c >= ‘0‘ && c <= ‘9‘) x = x * 10 + c - ‘0‘, c = getchar();
    return x * f;
}
int QwQ, N, cnt = 1;
char s[201];
vector<int> v[MAXN]; 
int link[MAXN], vis[MAXN];
bool Aug(int x) {
    for(int i = 0; i < v[x].size(); i++) {
        int to = v[x][i];
        if(vis[to] == cnt) continue;
        vis[to] = cnt;
        if(!link[to] || Aug(link[to]))
            {link[to] = x; return 1;}
    }
    return 0;
}
main() { 
#ifdef WIN32
   // freopen("a.in", "r", stdin);
    //freopen("b.out", "w", stdout);
#endif
    QwQ = read();
    while(QwQ--) {
        N = read(); cnt = 1;
        for(int i = 1; i <= N; i++) {
            v[i].clear(); link[i] = 0; vis[i] = 0;
            for(int j = 1; j <= N; j++) {
                int opt = read();
                if(opt == 1)
                    v[i].push_back(j);
            }
        }
        int ans = 0;
        for(int i = 1; i <= N; i++, cnt++)
            if(Aug(i))    
                ans++;
        puts(ans == N ? "Yes" : "No");
    }

    return 0;
}