P1341 无序字母对

#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
#include<cstdlib>
#include<cmath>
#include<map>
#include<algorithm>
using namespace std;
#define ll long long
#define lb long double
#define INF 0x3f3f3f3f
#define maxn 500
int n, k, cnt, st;
string a;
int d[maxn][maxn], ans[maxn], du[maxn];
void found(int i){
    for(int j = 0 ; j <= 150 ; ++ j){
        if(d[i][j]){
            d[i][j] --;
            d[j][i] --;
            found(j);
        }
    }
    ans[++k] = i;
    return;
}
int main()
{
    scanf("%d", &n);
    for(int i = 1 ; i <= n ; ++ i){
        cin >> a;
        d[a[0]][a[1]] ++;
        d[a[1]][a[0]] ++;
        du[a[0]] ++;
        du[a[1]] ++;
    }
    for(int i = 0 ; i <= 150 ; ++ i){
        if(du[i] & 1){
            cnt ++;
            if(!st) st = i;
        }
    }
    if(cnt && cnt != 2){
        printf("No Solution"); return 0;
    }
    if(!st){
        for(int i = 1 ; i <= 150 ; ++ i){
            if(du[i]){
                st = i;
                break;
            }
        }
    }
    found(st);
    if(k > n + 1){
        printf("No Solution"); return 0;
    }
    else{
        for(int i = k ; i >= 1 ; -- i){
            printf("%c", ans[i]);
        }
    }
    return 0;
}