假期的宿舍_bzoj1433_二分图最大匹配

Description

---

Input Format

---

Output Format

---

Analysis

---

题目有点绕，大概就是一张可以按照有没有床分成两边的二分图求最大匹配。n很小大概是网络流吧，但是我匈牙利过了
读入优化很好玩啊

Code

---

/*
ID:wjp13241
PROG:dorm
LANG:C++
*/
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <algorithm>
#include <iostream>
#include <vector>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define dfo(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,x,e) for(int i=ls[x];i;i=e[i].next)
#define fil(x,t) memset(x,t,sizeof(x))
#define FILEIN(s) freopen(s,"r",stdin)
#define FILEOUT(s) freopen(s,"w",stdout)
#define STP system("pause")
#define min(x,y) x<y?x:y
#define max(x,y) x>y?x:y
#define MP(x,y) make_pair(x,y)
#define PuB(v,x) v.push_back(x)
#define PoB(v) v.pop_back()
#define ld long double
#define ll long long
#define db double
#define INF 0x3f3f3f3f
#define LIM 100000000
#define EPS 1e-4
#define N 51
#define E N*N+1
#define L 21
using namespace std;
struct edge{int y,next;}e[E];
int ls[N],vis[N],lnk[N],p[N],t[N],maxE=0;
int add(int x,int y){e[++maxE]=(edge){y,ls[x]},ls[x]=maxE;}
inline int read()
{
    int x=0,p=1;char ch=getchar();
    while (ch<'0'||ch>'9'){if (ch=='-')p=-1;ch=getchar();};
    while (ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*p;
}
int fnd(int x)
{
    fore(i,x,e)
        if (!vis[e[i].y])
        {
            vis[e[i].y]=1;
            if (!lnk[e[i].y]||fnd(lnk[e[i].y]))
            {
                lnk[e[i].y]=x;
                return 1;
            }
        }
    return 0;
}
int main()
{
    int T=read();
    while (T--)
    {
        fil(ls,0);
        fil(lnk,0);
        maxE=0;
        int n=read();
        int cnt=0;
        fo(i,1,n)
            t[i]=read();
        fo(i,1,n)
        {
            p[i]=read();
            cnt+=(!t[i]||t[i]&&!p[i]);
        }
        fo(i,1,n)
        {
            fo(j,1,n)
            {
                int opt=read();
                if (i^j&&opt&&t[j]&&(t[i]&&!p[i]||!t[i]))
                    add(i,j);
            }
            if (t[i]&&!p[i])
                add(i,i);
        }
        int ans=0;
        fo(i,1,n)
        {
            fil(vis,0);
            ans+=fnd(i);
        }
        if (ans!=cnt)
            puts("T_T");
        else
            puts("^_^");
    }
    return 0;
}