-
Notifications
You must be signed in to change notification settings - Fork 184
/
Copy path00200.cc
58 lines (58 loc) · 1.11 KB
/
00200.cc
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
// https://uva.onlinejudge.org/external/2/200.pdf
#include<bits/stdc++.h>
using namespace std;
using vi=vector<int>;
using vvi=vector<vi>;
using vs=vector<string>;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
for(;;){
string s;
getline(cin,s);
if(s.empty())break;
vs t;
for(;;){
if(s[0]=='#')break;
t.push_back(s);
getline(cin,s);
}
vi p(128),m(128);
string q;
for(auto &s:t){
for(auto c:s){
p[c]++;
}
}
int n=0;
for(int i='A';i<='Z';i++)
if(p[i]){
m[i]=n++;
q.push_back(i);
}
vvi g(n);
for(int i=0;i<t.size()-1;i++){
string &a=t[i],&b=t[i+1];
for(int j=0;j<min(a.size(),b.size());j++)
if(a[j]!=b[j]){
g[m[a[j]]].push_back(m[b[j]]);
break;
}
}
vi w(n),x;
function<void(int)>dfs=[&](int u){
w[u]=1;
for(int v:g[u])
if(!w[v])
dfs(v);
x.push_back(u);
};
for(int i=0;i<n;i++)
if(!w[i])
dfs(i);
reverse(x.begin(),x.end());
for(int i=0;i<n;i++)
cout<<q[x[i]];
cout<<"\n";
}
}