poj 3487 稳定婚姻

/**
     稳定婚姻：男生不停的求婚，女生不停地拒绝
**/

#include <iostream>
#include <queue>
#include <cstdio>
#include <cstring>
using namespace std;
#define maxn 40
int pref[maxn][maxn],order[maxn][maxn],next[maxn];
int future_wife[maxn],future_huaband[maxn];
int man[maxn];
queue<int > q;
char str[50];
void engage(int man,int woman){
    int m = future_huaband[woman];
    if(m){
        future_wife[m] =0;
        q.push(m);
    }
    future_huaband[woman] = man;
    future_wife[man] = woman;
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--){
        memset(man,0,sizeof(man));
        int n;
        scanf("%d",&n);
        char  c;
        for(int i=0;i<n;i++){//男
            cin>>c;
            man[c-'a'+1] =1;
        }
        for(int i=0;i<n;i++)//女
            cin>>c;
        for(int i=1;i<=n;i++){//男喜欢
            cin>>str;
        //cout<<str<<endl;
            int temp = str[0]-'a'+1;//哪个男生
            //cout<<temp<<endl;
            for(int j=2;str[j];j++){
                pref[temp][j-1] = str[j]-'A'+1;
                //cout<<pref[temp][j]<<endl;
            }
            next[temp] = 1;
            future_wife[temp] =0;
            q.push(temp);
        }
        for(int i=1;i<=n;i++){
            cin>>str;
            //cout<<str<<endl;
            int temp = str[0]-'A'+1;
            for(int j=2;str[j];j++){
                order[temp][str[j]-'a'+1] = j-1;
            }
            future_huaband[temp] =0;
        }
        while(!q.empty()){
            int man = q.front();
            q.pop();
            int woman = pref[man][next[man]++];
            if(!future_huaband[woman]){
                engage(man,woman);
            }else if(order[woman][man]<order[woman][future_huaband[woman]]){
                engage(man,woman);
            }else
                q.push(man);
        }
        while(!q.empty()) q.pop();
        for(int i=1;i<maxn;i++)if(man[i]){
            printf("%c %c
",(char)(i-1+'a'),(char)(future_wife[i]-1+'A'));
        }
        if(t)
            printf("
");
    }
    return 0;
}