zoj 1059 What‘s In a Name

用到的是最大匹配匈牙利算法

这个算法需要一个关系矩阵
所以我借鉴某大佬的方法，即用建反边的方法来创造这个矩阵

剩下的就是用匈牙利算法找最大匹配了

#include<iostream>
#include<cstring>
#include<algorithm>
#include<math.h>
#include<vector>
#include<set>
#include<queue>
#include<list>
#include<map>
using namespace std;
const int maxi = 100;
string names[maxi];
int mp[maxi][maxi], in[maxi], used[maxi], who[maxi], save[maxi];
map<string, int> spy, ha, room;
int n, m;


struct node {
	string name, userid;
};


bool cmp(node n1, node n2) {
	return n1.name < n2.name;
}

void inti() {
	m = n = 0;
	spy.clear();
	ha.clear();
	room.clear();
	for (int i = 0; i < maxi; i++) {
		used[i] = 0;
		who[i] = 0;
		save[i] = 0;
	}
	for (int i = 0; i < maxi; i++) {
		for (int j = 0; j < maxi; j++) {
			mp[i][j] = 1;
		}
	}
}

void read() {
	cin >> n;
	for (int i = 1; i <= n; i++) {
		string str;
		cin >> str;
		names[i] = str;
		ha[str] = i;
	}
	string zt, name;
	while (cin >> zt && zt != "Q") {
		cin >> name;
		if (zt == "E") {
			int t = spy[name];
			if (t == 0) {
				spy[name] = ++m;
				t = spy[name];
			}
			room[name] = t;
		} else if (zt == "L") {
			room.erase(name);
		} else {
			memset(in, 0, sizeof(in));
			map<string, int>::iterator it = room.begin();
			for (; it != room.end(); it++) {
				in[it->second] = 1;
			}
			for (int i = 1; i < maxi; i++) {
				if (!in[i]) {
					mp[ha[name]][i] = 0;
				}
			}
		}
	}
}


bool fd(int id) {
	for (int i = 1; i <= m; i++) {
		if (mp[id][i] == 1 && used[i] == 0) {
			used[i] = 1;
			if (who[i] == 0 || fd(who[i])) {
				who[i] = id;
				return true;
			}
//			used[i]=0; 因为要找增广路径，所以这里第一次没找到，那就不用在回溯他了 
		}
	}
	return false;
}

int hungary() {
	int all = 0;
	memset(who, 0, sizeof(who));
	for (int i = 1; i <= n; i++) {
		memset(used, 0, sizeof(used));
		if (fd(i))all++;
	}
	return all;
}


void solve() {
	int num = hungary();

	for (int i = 1; i <= m; i++) {
		save[i] = who[i];

	}

	int k = 0;
	vector<node>ans;

	for (map<string, int>::iterator it = spy.begin(); it != spy.end(); it++) {
		int u = it->second;

		node nd;
		nd.name = it->first;
		if (!mp[save[u]][u]) {
			nd.userid = "???";
		} else {
			mp[save[u]][u] = 0;
			if (num > hungary()) { //这道题目的结构比较特殊，因为要达到最大匹配，所以尽可能多的在找匹配，所以为了达到最大匹配
									//值某些匹配时是必要的，而这些必要的匹配和这道题目的结构逻辑刚好吻合，所以那些必要的匹配就
									//是真正的name和id的匹配 
				nd.userid = names[save[u]]; 
			} else {
				nd.userid = "???";
			}
			mp[save[u]][u]=1;
		}
		ans.push_back(nd);
	}
	sort(ans.begin(), ans.end(), cmp);
	for (int i = 0; i < ans.size(); i++) {
		cout << ans[i].name << ":" << ans[i].userid << endl;
	}
}

int main() {
	int t;
	cin >> t;
	while (t--) {
		inti();
		read();
		solve();
		if (t)cout << endl;
	}
}