"Hdoj 2063" roller coaster
Binary graph maximum matching template question 1 female to n male Q match maximum logarithm
The code is as follows:
#include <iostream>#include <cstdlib>#include <cstdio>#include <cstring>#include <queue>#define INF 0x3f3f3f3fusing namespace STD; vector <int>head[555];BOOLvis[555];intlink[555],n,m;BOOLCanintP) {intI,v; for(i =0; I < head[p].size (); ++i) {v = head[p][i];if(!vis[v]) {Vis[v] =true;if(Link[v] = =-1|| Can (Link[v])) {link[v] = p;return 1; } } }return 0;}intMain () {intk,u,v,i,cnt; while(~scanf("%d", &k) && k) {memset(Head,0,sizeof(head));scanf("%d%d", &m,&n); while(k--) {scanf("%d%d", &u,&v); Head[u].push_back (v); } CNT =0;memset(link,-1,sizeof(link)); for(i =1; I <= m; ++i) {memset(Vis,0,sizeof(VIS));if(Can (i)) cnt++; }printf("%d\n", CNT); }return 0;}
Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.
"Hdoj 2063" roller coaster