bzoj 1059: [ZJOI2007]矩阵游戏

#include<cstdio>
#include<iostream>
#include<cstdlib>
#include<cstring>
using namespace std;
int T,n,map[202][202],dui[202],y[202];
bool zhao(int a1)
{
    for(int i=1;i<=n;i++)
      if(map[a1][i]&&!y[i])
        {
            y[i]=1;
            if(!dui[i]||zhao(dui[i]))
              {
                  dui[i]=a1;
                  return 1;
              }
        }
    return 0;
}
bool work()
{
    for(int i=1;i<=n;i++)
      {
        memset(y,0,sizeof(y));
        if(!zhao(i))
          return 0;
      }
    return 1;
}
int main()
{
    scanf("%d",&T);
    for(;T;T--)
      {
        memset(map,0,sizeof(map));
        memset(dui,0,sizeof(dui));
        scanf("%d",&n);
          for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
              {
                  int  a1;
                  scanf("%d",&a1);
                  if(a1)
                    map[i][j]=1;
              }
        if(work())
          printf("Yes
");
        else
          printf("No
");
      }
}

二分图匹配，行和列匹配出一条对角线