uva 10728

一開始以為是水題結果沒這麼簡單

<a> <a> <d> <d> <f> <f> <a>
<b> <c> <c> <e> <e> <g> q

上面測資的答案為 q q q q q q q

需要構圖，再用disjoint Set有連接的縮起來成為一個父節點

記得判斷相衝的狀況

//
//        GGGGGGGGGGGGG        CCCCCCCCCCCCC               AAA
//     GGG::::::::::::G     CCC::::::::::::C              A:::A
//   GG:::::::::::::::G   CC:::::::::::::::C             A:::::A
//  G:::::GGGGGGGG::::G  C:::::CCCCCCCC::::C            A:::::::A
// G:::::G       GGGGGG C:::::C       CCCCCC           A:::::::::A
//G:::::G              C:::::C                        A:::::A:::::A
//G:::::G              C:::::C                       A:::::A A:::::A
//G:::::G    GGGGGGGGGGC:::::C                      A:::::A   A:::::A
//G:::::G    G::::::::GC:::::C                     A:::::A     A:::::A
//G:::::G    GGGGG::::GC:::::C                    A:::::AAAAAAAAA:::::A
//G:::::G        G::::GC:::::C                   A:::::::::::::::::::::A
// G:::::G       G::::G C:::::C       CCCCCC    A:::::AAAAAAAAAAAAA:::::A
//  G:::::GGGGGGGG::::G  C:::::CCCCCCCC::::C   A:::::A             A:::::A
//   GG:::::::::::::::G   CC:::::::::::::::C  A:::::A               A:::::A
//     GGG::::::GGG:::G     CCC::::::::::::C A:::::A                 A:::::A
//        GGGGGG   GGGG        CCCCCCCCCCCCCAAAAAAA                   AAAAAAA
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <queue>
#include <cctype>
#include <utility>
#include <ctime>
using namespace std;
#ifdef DEBUG
#define VAR(a,b) decltype(b) a=(b)
#define debug(...) printf("DEBUG: "),printf(__VA_ARGS__)
#define gettime() end_time=clock();printf("now running time is %.7f\n",(float)(end_time - start_time)/CLOCKS_PER_SEC);
#else
#define VAR(a,b) __typeof(b) a=(b)
#define debug(...)
#define gettime()
#endif
typedef unsigned int uint;
typedef long long int Int;
typedef unsigned long long int UInt;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\n")
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()
#define De(x)printf(#x"%d\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\
    printf("%d ",dp[htx][hty]);}Pln();}
#define M 30005
#define PII pair<int,int>
#define PB push_back
#define oo INT_MAX
#define Set_oo 0x3f
#define FOR(a,b) for(VAR(a,(b).begin());a!=(b).end();++a)
#define eps 1e-6
#define X first
#define Y second
clock_t start_time=clock(), end_time;
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
    int tmp=min(x,y);
    return min(tmp,z);
}
int max3(int x,int y,int z){
    int tmp=max(x,y);
    return max(tmp,z);
}
char str[128],str2[128];
char s1[128][32],s2[128][32];
map<string,int> sid;
int p[256],rk[256];
map<int,string> dmap;
int getf(int x){
    if(x!=p[x])p[x]=getf(p[x]);
    return p[x];
}
void _canunion(int x,int y){
    if(rk[x]>rk[y]){
        p[y]=x;
    }else{
        p[x]=y;
        if(rk[x]==rk[y])rk[y]++;
    }
}
int cnt=0,cnt2=0;
bool input(){
    int len=strlen(str);
    cnt=cnt2=0;
    for(int i=0,a=0;i<len;i+=a,cnt++){
        sscanf(str+i,"%s%n",s1[cnt],&a);
        if(s1[cnt][0]=='<')s1[cnt][0]='0';
    }
    len=strlen(str2);
    for(int i=0,a=0;i<len;i+=a,cnt2++){
        sscanf(str2+i,"%s%n",s2[cnt2],&a);
        if(s2[cnt2][0]=='<')s2[cnt2][0]='1';
    }
    if(cnt!=cnt2)return false;
    for(int i=0;i<=cnt+cnt2+5;i++){
        p[i]=i;rk[i]=0;
    }
    int k=0;
    for(int i=0;i<cnt;i++){
        int x,y;
        if(sid.count(s1[i]))x=sid[s1[i]];
        else x=sid[s1[i]]=k++;
        if(sid.count(s2[i]))y=sid[s2[i]];
        else y=sid[s2[i]]=k++;
        int fx=getf(x);
        int fy=getf(y);
//        debug("%d %d\n",fx,fy);
        if(fx!=fy){
            if(!isdigit(s2[i][0])){
                if(dmap.count(fx)&&dmap[fx]!=s2[i])return false;
                dmap[fx]=s2[i];
            }
            else if(!isdigit(s1[i][0])){
                if(dmap.count(fy)&&dmap[fy]!=s1[i])return false;
                dmap[fy]=s1[i];
            }
            else if(dmap.count(fx)){
                dmap[fy]=dmap[fx];
                _canunion(fx,fy);
            }else if(dmap.count(fy)){
                dmap[fx]=dmap[fy];
                _canunion(fx,fy);
            }else{
                _canunion(fx,fy);
            }
        }
    }
    return true;
}
int main() {
    ios_base::sync_with_stdio(0);
    int test;
    scanf("%d%*c",&test);
    while(test--){
        gets(str);
        gets(str2);
        if(input()){
            for(int i=0;i<cnt;i++){
                if(i)putchar(' ');
                if(isdigit(s1[i][0])){
                    int fx=getf(sid[s1[i]]);
                    if(dmap.count(fx))printf("%s",dmap[fx].c_str());
                    else printf("x");
                }else printf("%s",s1[i]);
            }Pln();
        }else printf("-\n");
        sid.clear();
        dmap.clear();
    }

















}