competitive-programming/solved-uva/200.cpp at master · the-redback/competitive-programming · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
/**
 *                                   ____
 *       ____ ___  ____ ________  __/ __/
 *      / __ `__ \/ __ `/ ___/ / / / /_
 *     / / / / / / /_/ / /  / /_/ / __/
 *    /_/ /_/ /_/\__,_/_/   \__,_/_/
 *
 *    @link : https://the-redback.com
 */
#include <bits/stdc++.h>
using namespace std;

#define mem(a, b) memset(a, b, sizeof(a))
#define pb        push_back
#define pp        pop_back
#define inf       1000000000
#define NN        30

vector<int> e[NN + 7], v;
int view[NN + 7];
int pr[NN + 7];
vector<string> vs;
char a[NN + 7];

void dfs(int u) {
    int i, k, l;
    view[u] = 1;
    for (i = 0; i < e[u].size(); i++) {
        if (view[e[u][i]] == 0) dfs(e[u][i]);
    }
    v.pb(u);
}

int main() {
    int i, j, k, l;
    int tc, t;
    int n, m;
    mem(pr, 0);
    while (~scanf("%s", &a)) {
        if (a[0] == '#') break;
        for (i = 0; a[i] != 0; i++) pr[a[i] - 'A'] = 1;
        vs.pb(a);
    }
    mem(view, 0);

    for (i = 0; i < vs.size() - 1; i++) {
        j = 0;
        while (j < vs[i].size() && j < vs[i + 1].size()) {
            if (vs[i][j] != vs[i + 1][j]) {
                e[vs[i][j] - 'A'].pb(vs[i + 1][j] - 'A');
                break;
            }
            j++;
        }
    }
    for (i = 0; i <= 26; i++) {
        if (pr[i] == 1 && view[i] == 0) dfs(i);
    }
    reverse(v.begin(), v.end());
    for (i = 0; i < v.size(); i++) printf("%c", v[i] + 'A');
    puts("");
    v.clear();
    vs.clear();
    for (i = 0; i <= 26; i++) e[i].clear();
    return 0;
}