hdu1083Courses（java）二分最大匹配-匈牙利算法

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays ;
import java.io.StreamTokenizer ;
import java.io.IOException ;
class Main{
    private static int[][] map ;
    private static boolean[] visited ;
    private static int P,N ;
    private static int[] link ;
    private static int ans ;
    private static void MaxMatch(int k){
        link = new int[303] ;
        Arrays.fill(link,-1) ;
        for(int i=1;i<=P;i++){
            visited = new boolean[303] ;
            if(DFS(i)){
                ans++ ;
            }
        }
    }
    private static boolean DFS(int u){
        for(int i=1;i<=N;i++){
            if(map[u][i]==1&&!visited[i]){
                visited[i] = true ;
                if(link[i]==-1||DFS(link[i])){
                    link[i] = u ;
                    return true ;
                }
            }
        }
        return false ;
    }
    public static void main(String arg[])throws IOException{
        StreamTokenizer in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in))) ;
        in.nextToken() ;
        int T = (int)in.nval ;
        while(T-->0){
            in.nextToken() ;
            P = (int)in.nval ;
            in.nextToken() ;
            N = (int)in.nval ;
            map = new int[303][303] ;
            for(int i=1;i<=P;i++){
                in.nextToken() ;
                int p = (int)in.nval ;
                for(int j=1;j<=p;j++){
                    in.nextToken() ;
                    map[i][(int)in.nval] = 1 ;
                }
            }
            ans = 0 ;
            MaxMatch(ans) ;
            if(ans==P){
                System.out.println("YES") ;
            }else{
                System.out.println("NO") ;
            }
        }
    }
}