【bzoj1433】【zjoi2009】【假期的宿舍】【匈牙利算法】

Description

Input

Output

Sample Input

1
3
1 1 0
0 1 0
0 1 1
1 0 0
1 0 0

Sample Output

ˆ ˆ

题解：预处理出哪些人可以睡哪些床。

然后直接跑最大匹配即可。

代码：

#include
#include
#include
#define N 310
using namespace std;
int map[N][N],bl[N],n,t,temp,x;
bool f[N],g[N],p[N];
bool find(int x){
  if (x==0) return false;
  for (int i=1;i<=n;i++)
    if (map[x][i]&&!f[i]){
       f[i]=1;
       if (!bl[i]||find(bl[i])){bl[i]=x;return true;} 
    }
   return false;
}
int main(){
    int T;
    scanf("%d",&T);
    while (T--){
    memset(bl,0,sizeof(bl));memset(map,0,sizeof(map));memset(g,0,sizeof(g));
    memset(p,0,sizeof(p));scanf("%d",&n);temp=0;int ff(1);
    for (int i=1;i<=n;i++) scanf("%d",&g[i]);
    for (int i=1;i<=n;i++){scanf("%d",&x);if (g[i]) p[i]=x;}
    for (int i=1;i<=n;i++)
     for (int j=1;j<=n;j++){
       scanf("%d",&x);if (x&&g[j]) map[i][j]=1;
     }
    for (int i=1;i<=n;i++)if (g[i]) map[i][i]=1;
    for (int i=1;i<=n;i++){
      memset(f,0,sizeof(f));
      if (p[i]) continue;
      if (!find(i)){printf("T_T\n");ff=0;break;}  
    }
    if (ff) printf("^_^\n");
   }
}