HDU 1914 The Stable Marriage Problem 稳定婚姻问题 （接着水）

恩，也是水题。我还是改的上一题代码。QwQ。

注意：每个人喜爱的人不一定是n。所以不能直接按n算。

http://acm.hdu.edu.cn/showproblem.php?pid=1914

/*********************************************
    Problem : HDU 1914
    Author  : NMfloat
    InkTime (c) NM . All Rights Reserved .
********************************************/

#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <string>
#include <cstdio>
#include <vector>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>

#define rep(i,a,b)  for(int i = (a) ; i <= (b) ; i ++) //遍历
#define rrep(i,a,b) for(int i = (b) ; i >= (a) ; i --) //反向遍历
#define repS(it,p) for(auto it = p.begin() ; it != p.end() ; it ++) //遍历一个STL容器
#define repE(p,u) for(Edge * p = G[u].first ; p ; p = p -> next) //遍历u所连接的点
#define cls(a,x)   memset(a,x,sizeof(a))
#define eps 1e-8

using namespace std;

const int MOD = 1e9+7;
const int INF = 0x3f3f3f3f;
const int MAXN = 27;
const int MAXE = 2e5+5;

typedef long long LL;
typedef unsigned long long ULL;

int T,n,m;

int fx[] = {0,1,-1,0,0};
int fy[] = {0,0,0,-1,1};

map<char,int>m1,m2;
int RankA[MAXN][MAXN]; //男士的追求列表;
int RankB[MAXN][MAXN]; //女士的接受列表;
char nameA[MAXN];
char nameB[MAXN];

void input() {
    m1.clear() ; m2.clear() ;
    scanf("%d",&n);
    char name[105];
    rep(i,1,n) { scanf("%s",name); nameA[i] = name[0]; m1[nameA[i]] = i;}
    rep(i,1,n) { scanf("%s",name); nameB[i] = name[0]; m2[nameB[i]] = i;}

    cls(RankA,0); cls(RankB,0);
    rep(i,1,n) { //处理男士
        scanf("%s",name);
        int u = m1[name[0]];
        int len = strlen(name);
        rep(j,2,len-1) {
            RankA[i][j-1] = m2[name[j]];
        }
    }

    //处理女士
    rep(i,1,n) {
        scanf("%s",name);
        int u = m2[name[0]];
        int len = strlen(name);
        rep(j,2,len-1) {
            RankB[u][m1[name[j]]] = j-1; //直接根据RankB就可以对追求的男士进行排序
        }
    }
}

int matchA[505];//男士的匹配情况
int matchB[505];//女士的匹配情况
int lick[505];

void solve() {
    cls(matchA,0) ; cls(matchB,0) ; cls(lick,0);
    int flg = 0;
    while(1) {
        int ok = 0;
        rep(i,1,n) {
            if(!matchA[i]) {
                ok = 1;
                int u = ++lick[i];
                if(!RankA[i][u]) { flg = 1; break;}
                int v = RankA[i][u];
                if(!RankB[v][i]) continue;
                if(!matchB[v]) {
                    matchB[v] = i; matchA[i] = v;
                }
                else {
                    if(RankB[v][i] < RankB[v][matchB[v]]) {
                        matchA[matchB[v]] = 0;
                        matchB[v] = i; matchA[i] = v;
                    }
                }
            }
        }
        if(flg) break;
        if(!ok) break;
    }
    if(flg) puts("Impossible");
    else {
        rep(i,1,n) {
            printf("%c %c\n",nameA[i],nameB[matchA[i]]);
        }
    }
}  

int main(void) {
    //freopen("a.in","r",stdin);
    int casenum = 0;
    scanf("%d",&T); while(T--) {
        if(casenum++) puts("");
        input();
        solve();
    }
    return 0;
}