HDU1522 Marriage is Stable 【稳定婚姻问题】

 

裸题
之前写过一个麻烦点的（要处理一下好感度）
WA了两发
①我没认真读题 要空行
②我以为我init了但我没有尽管我写好了init
贴代码惹~

#include<iostream>
#include<cmath>
#include<cstring>
#include<string.h>
#include<algorithm>
#include<stack>
#include<map>
#define maxn 505
using namespace std;
int n;
string bn,gn;
map<string,int> ab,ag;
map<int,string> bb,bg;
int mrk[maxn][maxn],frk[maxn][maxn],num[maxn],lady[maxn],man[maxn];
struct node
{
	int id,rk;
}tmp[maxn];
void init()
{
	ab.clear();bb.clear();
	ag.clear();bg.clear();
	memset(lady,0,sizeof(lady));
	memset(man,0,sizeof(man));
	for (int i=1;i<=n;i++) num[i]=1;
	memset(mrk,0,sizeof(mrk));
	memset(frk,0,sizeof(frk));
}
bool cmp(node a,node b)
{
	return a.id<b.id;
}
void choose(int male)
{
	int female=mrk[male][num[male]];
	if (lady[female]==0) 
	{
		lady[female]=male;
		man[male]=female;
		num[male]++;
	}
	else if (frk[female][male]<frk[female][lady[female]])
	{
		man[lady[female]]=0;
		lady[female]=male;
		man[male]=female;
		num[male]++;
	}
	else num[male]++;
	return;
}
int main()
{
	while(~scanf("%d",&n))
	{
		cin>>bn;
		ab[bn]=1;bb[1]=bn;
		for (int j=1;j<=n;j++)
		{
			cin>>gn;
			ag[gn]=j;
			bg[j]=gn;
			mrk[1][j]=ag[gn];
		}
		for (int i=2;i<=n;i++)
		{
			cin>>bn;
			ab[bn]=i;
			bb[i]=bn;
			for (int j=1;j<=n;j++)
			{
				cin>>gn;
				mrk[i][j]=ag[gn];
			}
		}
		for (int i=1;i<=n;i++)
		{
			cin>>gn;
			for (int j=1;j<=n;j++) tmp[j].id=tmp[j].rk=0;
			for (int j=1;j<=n;j++)
			{
				cin>>bn;
				tmp[j].id=ab[bn];
				tmp[j].rk=j;
			}
			sort(tmp+1,tmp+1+n,cmp);
			for (int j=1;j<=n;j++)
			{
				frk[ag[gn]][j]=tmp[j].rk;
			}
		}
		int ok=1;
		while (ok==1)
		{
			ok=0;
			for (int i=1;i<=n;i++)
			{
				if (man[i]==0)
				{
					ok=1;
					choose(i);
				}
			}
		}
		for (int i=1;i<=n;i++) cout<<bb[i]<<" "<<bg[man[i]]<<endl; 
		cout<<endl;
	}
	return 0;
}