BZOJ 1433

1433: [ZJOI2009]假期的宿舍

二分图，匈牙利算法

BZOJ 1433

/**************************************************************
    Problem: 1433
    User: Dream_Tonight
    Language: C++
    Result: Accepted
    Time:96 ms
    Memory:1388 kb
****************************************************************/
 
#include <algorithm>
#include <iostream>
#include <cstring>
#include <vector>
#include <string>
#include <cstdio>
#include <cmath>
#include <stack>
#include <queue>
#include <list>
#include <map>
#include <set>
 
using namespace std;
#define lson l , m , rt << 1
#define rson m + 1 , r , rt << 1 | 1
typedef long long ll;
typedef pair<int, int> pii;
const int maxn = 100 + 7;
const int inf = 2139062143;
const int mod = 10007;
int T, n, cnt;
int head[101], match[101];
bool vis[101], BackHome[101], SchoolStudent[101], bed[101][101];
 
struct node {
    int to, next;
} edge[maxn * maxn];
 
void ins(int u, int v) {
    edge[++cnt] = (node) {v, head[u]}, head[u] = cnt;
}
 
bool find(int x) {
    for (int i = head[x]; i; i = edge[i].next) {
        int to = edge[i].to;
        if (!vis[to]) {
            vis[to] = 1;
            if (match[to] == 0 || find(match[to])) {
                match[to] = x;
                return true;
            }
        }
    }
    return false;
}
 
int main() {
#ifndef ONLINE_JUDGE
    freopen("weather.in", "r", stdin);
#endif
    scanf("%d", &T);
    while (T--) {
        scanf("%d", &n);
        cnt = 1;
        memset(head, 0, sizeof(head));
        memset(match, 0, sizeof(match));
        for (int i = 1; i <= n; i++) scanf("%d", &SchoolStudent[i]);
        for (int i = 1; i <= n; i++) {
            scanf("%d", &BackHome[i]);
            if (SchoolStudent[i] && !BackHome[i]) ins(i, i + n), ins(i + n, i);
            if (!SchoolStudent[i]) BackHome[i] = 0;
        }
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) {
                scanf("%d", &bed[i][j]);
                if (bed[i][j] && SchoolStudent[j]) {
                    ins(i, j + n);
                }
            }
        }
 
        int ans = 0, ret = 0;
        for (int i = 1; i <= n; i++) {
            if (!BackHome[i]) {
                memset(vis, 0, sizeof(vis));
                if (find(i)) ans++;
                ret++;
            }
        }
        if (ans == ret) printf("^_^\n");
        else printf("T_T\n");
    }
    return 0;
}