POJ 3487 The Stable Marriage Problem(稳定婚姻问题)

#include<iostream>
#include<queue>
#include<cmath>
#include<map>
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=27+5;
int pref[maxn][maxn],order[maxn][maxn],Next[maxn];
int future_husband[maxn],future_wife[maxn];
queue<int> q;
map<char,int> Hash;
char List[maxn];
char boy[maxn],gril[maxn];
struct rank{
    char a,b;
    bool operator < (const rank &rhs) const {
        return a<rhs.a;
    }
}ra[maxn];
void engage(int man,int woman)
{
    int m=future_husband[woman];
    if(m)
    {
        future_wife[m]=0;
        q.push(m);
    }
    future_husband[woman]=man;
    future_wife[man]=woman;
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        Hash.clear();
        int n;
        scanf("%d",&n);
        int r=0,c=0;
        char ch;
        while((ch=getchar()))
        {
            if(ch>='a'&&ch<='z') {r++;Hash[ch]=r;boy[r]=ch;}
            if(ch>='A'&&ch<='Z') {c++;Hash[ch]=c;gril[c]=ch;}
            if(r==n&&c==n) break;
        }
        for(int i=1;i<=n;i++){
            scanf("%s",List);
            for(int j=2;List[j];j++)
            {
                pref[i][j-1]=Hash[List[j]];
            }
            Next[i]=1;
            future_wife[i]=0;
            q.push(i);
        }
        for(int i=1;i<=n;i++){
            scanf("%s",List);
            for(int j=2;List[j];j++){
                order[Hash[List[0]]][Hash[List[j]]]=j-1;
            }
            future_husband[i]=0;
        }
        while(!q.empty())
        {
            int man=q.front();q.pop();
            int woman=pref[man][Next[man]++];
            if(future_husband[woman]==0) engage(man,woman);
            else if(order[woman][man]<order[woman][future_husband[woman]]) engage(man,woman);
            else q.push(man);
        }
        while(!q.empty()) q.pop();
        for(int i=1;i<=n;i++){
            ra[i].a=boy[i];ra[i].b=gril[future_wife[i]];
        }
        sort(ra+1,ra+n+1);
        for(int i=1;i<=n;i++){
            printf("%c %c\n",ra[i].a,ra[i].b);
        }
        if(t) printf("\n");
    }
    return 0;
}