#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
#define SZ(x) (int) x.size()
#define F first
#define S second
const int N = 3e5 + 10, MOD[] = {(int) 1e9 + 9, (int) 1e9 + 7}, tof = 1100000123;
int pw[2][N], H[2][N], dp[20][N], rmq[20][20][N], lg[N], n, m, q, base[] = {37, 31}; unordered_map<int, int> mp;
char S[N * 2];
inline int get_tof(pii h) {
return 1ll * h.F * h.S % tof;
}
pii get_hash(int l, int r) {
pii h = {(H[0][r] - 1ll * H[0][l - 1] * pw[0][r - l + 1] % MOD[0] + MOD[0]) % MOD[0],
(H[1][r] - 1ll * H[1][l - 1] * pw[1][r - l + 1] % MOD[1] + MOD[1]) % MOD[1]};
return h;
}
void build_rmq(int id) {
for (int i = 1; i <= n; i++) {
rmq[id][0][i] = dp[id][i];
}
for (int i = 1; i < 20; i++) {
for (int j = 1; j <= n; j++) {
if (j + (1 << i) <= n + 1) {
rmq[id][i][j] = max(rmq[id][i - 1][j], rmq[id][i - 1][j + (1 << (i - 1))]);
}
}
}
}
int get_max(int id, int l, int r) {
if (r <= l) return l;
r = min(r, n + 1);
int x = lg[r - l];
return max(rmq[id][x][l], rmq[id][x][r - (1 << x)]);
}
int main() {
for (int i = 2; i < N; i++)
lg[i] = lg[i >> 1] + 1;
pw[0][0] = pw[1][0] = 1;
for (int i = 1; i < N; i++)
for (int j : {0, 1})
pw[j][i] = 1ll * pw[j][i - 1] * base[j] % MOD[j];
scanf("%d%d", &n, &q);
for (int i = 1; i <= n; i++) {
scanf("%s", S);
pii h = {0, 0};
for (int j = 0; S[j]; j++) {
h = {(1ll * h.F * base[0] % MOD[0] + S[j] - 'a' + 1) % MOD[0],
(1ll * h.S * base[1] % MOD[1] + S[j] - 'a' + 1) % MOD[1]};
mp[get_tof(h)] = 1;
}
}
scanf("%s", S + 1); m = strlen(S + 1);
for (int i = 1; i <= m; i++) {
for (int j : {0, 1})
H[j][i] = (1ll * H[j][i - 1] * base[j] % MOD[j] + S[i] - 'a' + 1) % MOD[j];
}
swap(n, m);
for (int i = 1; i <= n; i++) {
int l = i - 1, r = n + 1;
while (r - l > 1) {
int md = (l + r) >> 1;
if (mp.count(get_tof(get_hash(i, md)))) l = md;
else r = md;
}
dp[0][i] = l + 1;
}
for (int j = 1; j < 20; j++) {
build_rmq(j - 1);
for (int i = 1; i <= n; i++) {
dp[j][i] = get_max(j - 1, i, dp[j - 1][i] + 1);
}
}
for (build_rmq(19); q; q--) {
int l, r; scanf("%d%d", &l, &r); l++;
int ret = 0, p = l;
for (int i = 19; ~i; i--) {
if (get_max(i, l, p + 1) <= r) ret += 1 << i, p = get_max(i, l, p + 1);
}
printf("%d\n", ret > n ? -1 : ret + 1);
}
return 0;
}
Compilation message
Main.cpp: In function 'int main()':
Main.cpp:53:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
53 | scanf("%d%d", &n, &q);
| ~~~~~^~~~~~~~~~~~~~~~
Main.cpp:55:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
55 | scanf("%s", S);
| ~~~~~^~~~~~~~~
Main.cpp:63:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
63 | scanf("%s", S + 1); m = strlen(S + 1);
| ~~~~~^~~~~~~~~~~~~
Main.cpp:85:24: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
85 | int l, r; scanf("%d%d", &l, &r); l++;
| ~~~~~^~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
4428 KB |
Output is correct |
| 2 |
Correct |
312 ms |
23064 KB |
Output is correct |
| 3 |
Correct |
265 ms |
17396 KB |
Output is correct |
| 4 |
Incorrect |
322 ms |
23308 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1346 ms |
442388 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
4428 KB |
Output is correct |
| 2 |
Correct |
312 ms |
23064 KB |
Output is correct |
| 3 |
Correct |
265 ms |
17396 KB |
Output is correct |
| 4 |
Incorrect |
322 ms |
23308 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
