[POJ 1274] The Perfect Stall【二分图最大匹配】

  • 2018-01-20
  • 0
  • 0


Time Limit: 1000MS Memory Limit: 10000K


Farmer John completed his new barn just last week, complete with all the latest milking technology. Unfortunately, due to engineering problems, all the stalls in the new barn are different. For the first week, Farmer John randomly assigned cows to stalls, but it quickly became clear that any given cow was only willing to produce milk in certain stalls. For the last week, Farmer John has been collecting data on which cows are willing to produce milk in which stalls. A stall may be only assigned to one cow, and, of course, a cow may be only assigned to one stall.
Given the preferences of the cows, compute the maximum number of milk-producing assignments of cows to stalls that is possible.


The input includes several cases. For each case, the first line contains two integers, N (0 <= N <= 200) and M (0 <= M <= 200). N is the number of cows that Farmer John has and M is the number of stalls in the new barn. Each of the following N lines corresponds to a single cow. The first integer (Si) on the line is the number of stalls that the cow is willing to produce milk in (0 <= Si <= M). The subsequent Si integers on that line are the stalls in which that cow is willing to produce milk. The stall numbers will be integers in the range (1..M), and no stall will be listed twice for a given cow.


For each case, output a single line with a single integer, the maximum number of milk-producing stall assignments that can be made.

Sample Input

5 5
2 2 5
3 2 3 4
2 1 5
3 1 2 5
1 2 

Sample Output






这里我用了代码较简单的匈牙利算法 (Hungarian Algorithm) 来进行最大匹配的求解,时间复杂度为 O(NM)。

Code: O(TNM) [676K, 0MS]

using namespace std;

int N, M;
int match[205];
bool vis[205];

struct Edge{
	int np;
	Edge *nxt;

struct Graph{
	Edge *V[205], E[40005];
	int tope;
	inline void clear() {tope = 0, memset(V, 0, sizeof(V));}
	inline void addedge(int u, int v) {E[++tope].np = v, E[tope].nxt = V[u], V[u] = &E[tope];}
} G;

inline bool Augmentable(int u){
	for(register Edge *ne = G.V[u]; ne; ne = ne->nxt){
		if(vis[ne->np]) continue;
		vis[ne->np] = 1;
		if(!match[ne->np] || Augmentable(match[ne->np])){
			match[ne->np] = u;
			return 1;
	return 0;

inline int Hungarian(){
	int maxmatch = 0;
	memset(match, 0, sizeof(match));
	for(register int i = 1; i <= N; i++){
		memset(vis, 0, sizeof(vis));
		if(Augmentable(i)) maxmatch++;
	return maxmatch;

int main(){
	while(scanf("%d%d", &N, &M) != EOF){
		for(register int i = 1; i <= N; i++){
			int S, K;
			scanf("%d", &S);
			while(S--) scanf("%d", &K), G.addedge(i, K);
		int maxmatch = Hungarian();
		printf("%d\n", maxmatch);
	return 0;





OPEN AT 2017.12.10

If the code cannot be displayed normally, please refresh the page.


- Theme by Qzhai