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
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
| #include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<30
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
string S[10005], ret = "", res = "";
bool dp[10005];
struct Trie {
Trie *next[26];
bool end;
Trie() {
fill(next,next+26,(Trie *)0);
end = false;
}
void insert(string &s,int i) {
if(i == s.size()) {
this->end = true;
return;
}
if(this->next[s[i]-'a'] == NULL) {
this->next[s[i]-'a'] = new Trie();
}
this->next[s[i]-'a']->insert(s,i+1);
}
bool find(int s, int i) {
if(s - i >= 0 && dp[s - i] && this->end) {
string t = "";
rep(j, i) {
t += ret[s-j];
}
res = t;
return true;
}
if((s + 1) - i == 0) {
if(this->end) {
string t = "";
rep(j, i) {
t += ret[s-j];
}
res = t;
return true;
}
else return false;
}
if(this->next[ret[s-i]-'a'] != NULL) {
if(this->next[ret[s-i]-'a']->find(s, i+1)) return true;
}
return false;
}
};
int main() {
int n;
cin >> n;
string s;
cin >> s;
int m;
cin >> m;
vector<string> v(m);
map<string, string> f;
Trie *trie = new Trie();
rep(i, m) {
cin >> v[i];
string t = v[i];
rep(j, t.size()) {
t[j] = tolower(t[j]);
}
f[t] = v[i];
trie->insert(t, 0);
}
memset(dp, 0, sizeof(dp));
rep(i, n) {
ret = ret + s[i];
if(trie->find(i, 0)) {
S[i] = f[res];
dp[i] = true;
}
}
vector<string> ans;
int cur = n-1;
while(dp[cur]) {
string t = S[cur];
ans.push_back(t);
cur -= t.size();
}
reverse(ans.begin(), ans.end());
rep(i, ans.size()) {
cout << ans[i];
if(i == ans.size()-1) cout << endl;
else cout << " ";
}
return 0;
}
|