UVA 753 - A Plug for UNIX

这是一道二分图最大匹配的问题。关键在于如何构造二分图，构造二分图时，我将适配器所有的可能都构造出来，例如：B X，X A，X D实际上有B X，X A，X D，B A， B D这五种，然后根据适配器在把该需要连接的插头与插座连接起来，便可用匈牙利算法求出。

程序代码：

#include<iostream> #include<string> #include<cstring> #include<map> #include<vector> #include<cstdio> #include<utility> #include<algorithm> using namespace std; #define MAXN 110 typedef pair<string, string> pill; vector<pill> vec; vector<pill>::iterator iter; vector<string> lMap, rMap; int m, n, k, ans; int mat[MAXN][MAXN], Result[MAXN], useif[MAXN]; void Init() { ans = 0; vec.clear(); lMap.clear(); rMap.clear(); memset(mat, 0, sizeof(mat)); memset(Result, 0, sizeof(Result)); memset(useif, 0, sizeof(useif)); } int Path(int a) { for(int i = 1; i <= n; i++){ if(mat[a][i] && !useif[i]){ useif[i] = 1; if(!Result[i] || Path(Result[i])){ Result[i] = a; return 1; } } } return 0; } int main() { string a, b; pill u, t; int nCase, len; //freopen("input.txt", "r", stdin); scanf("%d", &nCase); while(nCase--){ Init(); scanf("%d", &m); for(int i = 0; i < m; i++){ cin>>a; lMap.push_back(a); } scanf("%d", &n); for(int j = 1; j <= n; j++){ cin>>a>>b; rMap.push_back(b); for(int i = 0; i < m; i++){ if(b == lMap[i]) mat[i + 1][j] = 1; } } scanf("%d", &k); for(int i = 0; i < k; i++){ cin>>u.first>>u.second; if(find(vec.begin(), vec.end(), u) == vec.end()){ vec.push_back(u); len = vec.size(); for(int j = 0; j < len; j++){ if(vec[j].first == u.second){ t.first = u.first; t.second = vec[j].second; if(find(vec.begin(), vec.end(), t) == vec.end()){ vec.push_back(t); len++; } }else if(vec[j].second == u.first){ t.first = vec[j].first; t.second = u.second; if(find(vec.begin(), vec.end(), t) == vec.end()){ vec.push_back(t); len++; } } } } } for(iter = vec.begin(); iter != vec.end(); iter++){ for(int i = 0; i < lMap.size(); i++){ if((*iter).second == lMap[i]) for(int j = 0; j < rMap.size(); j++) if((*iter).first == rMap[j]) mat[i + 1][j + 1] = 1; } } /*for(int i = 1; i <= m; i++){ for(int j = 1; j <= n; j++) printf("%d ", mat[i][j]); printf("/n"); }*/ for(int i = 1; i <= m; i++){ memset(useif,0,sizeof(useif)); if(Path(i)) ans++; } printf("%d/n", n - ans); if(nCase) printf("/n"); } return 0; }