poj 1698 Alice's Chance 二分图多重匹配

//poj 1698
//sep9
#include <iostream>
using namespace std;
const int maxX=64*7;
const int maxY=64;
int g[maxX][maxY],match[maxY][maxX];
int vis[maxY];
int x,n;

struct FILM{
	int a[10];
	int need_day;
	int finish_week;	
}film[32];

int dfs(int x)  
{  
    int i,j;  
    for(i=0;i<n;++i){  
        if(vis[i]==0&&g[x][i]==1){  
            vis[i]=1;  
            if(match[i][0]<film[i].need_day){  
                match[i][++match[i][0]]=x;  
                return 1;  
            }  
            else{  
                for(j=1;j<=match[i][0];++j)  
                    if(dfs(match[i][j])==1){  
                        match[i][j]=x;  
                        return 1;     
                    }             
            }     
        }             
    }  
    return 0;  
}  

void mulmatch()  
{  
    int i,j;  
    for(i=0;i<n;++i)  
        match[i][0]=0;  
    for(i=0;i<=x;++i){  
        memset(vis,0,sizeof(vis));  
        dfs(i);     
    }       
} 

int main()
{
	int cases;
	scanf("%d",&cases);
	while(cases--){
		memset(g,0,sizeof(g));
		scanf("%d",&n);
		for(int i=0;i<n;++i){
			for(int j=0;j<7;++j)
				scanf("%d",&film[i].a[j]);
			scanf("%d%d",&film[i].need_day,&film[i].finish_week);
		}
		x=-1;
		for(int i=0;i<n;++i)
			for(int j=0;j<film[i].finish_week;++j)
				for(int k=0;k<7;++k)
					if(film[i].a[k]==1){
						x=max(x,j*7+k);
						g[j*7+k][i]=1;
					}
		mulmatch();
		int ok=1;
		for(int i=0;i<n;++i)
			if(match[i][0]<film[i].need_day){
				ok=0;
				break;
			}
		if(ok==1) puts("Yes");
		else puts("No");				
	}
	return 0;	
}