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
| #include <iostream>
#include <algorithm>
#include <cstring>
#include <map>
#include <unordered_set>
using namespace std;
typedef long long LL;
const int N = 2100010, base = 13331, mod1 = 19270817, mod2 = 19491001;
int n, k, T;
char str[N];
LL h1[N], h2[N], p1[N], p2[N];
map<pair<int,int>, int> S;
vector<int> res;
int get(LL h[], int l, int r, LL p[], const int mod) {
return ((h[r] - h[l - 1] * p[r - l + 1]) % mod + mod) % mod;
}
int main() {
cin >> n >> k;
scanf("%s", str + 1);
p1[0] = p2[0] = 1;
for (int i = 1; i <= n * k + k; i++) {
if (i <= k) str[n * k + i] = str[i];
p1[i] = (p1[i - 1] * base) % mod1;
h1[i] = (h1[i - 1] * base + str[i]) % mod1;
p2[i] = (p2[i - 1] * base) % mod2;
h2[i] = (h2[i - 1] * base + str[i]) % mod2;
}
str[n * k + k + 1] = '\0';
cin >> T;
for (int j = 1; j <= T; j++) {
scanf("%s", str + 1);
int s1 = 0, s2 = 0;
for (int i = 1; str[i]; i++) {
s1 = ((LL)s1 * base + str[i]) % mod1;
s2 = ((LL)s2 * base + str[i]) % mod2;
}
S[{s1, s2}] = j;
}
// 枚举起点
for (int i = 1; i <= k; i++) {
bool flag = true;
unordered_set<int> uset;
for (int j = i; j <= i + (n - 1) * k; j += k) {
int t = S[{get(h1, j, j + k - 1, p1, mod1), get(h2, j, j + k - 1, p2, mod2)}];
if (!t || uset.count(t)) {
flag = false;
break;
}
uset.insert(t);
res.push_back(t);
}
if (flag) break;
else res.clear();
}
if (res.size()) {
puts("YES");
for (auto x : res) printf("%d ", x);
puts("");
} else puts("NO");
return 0;
}
|