QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#926081 | #1942. Another Substring Query Problem | yqr | AC ✓ | 263ms | 102264kb | C++23 | 2.8kb | 2025-03-05 15:42:07 | 2025-03-05 15:42:07 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
namespace IO {
constexpr int bufsize = 230005;
char buf[bufsize], *f1, *f2;
char gtchar() {return f1 == f2 && (f2 = buf + fread(f1 = buf, 1, bufsize, stdin)) == buf? EOF: *f1++;}
template<typename T> void read(T &ret)
{
int f = ret = 0;
char ch = gtchar();
while(!isdigit(ch)) f = ch == '-', ch = gtchar();
while(isdigit(ch)) ret = (ret << 3) + (ret << 1) + (ch ^ 48), ch = gtchar();
if(f) ret = -ret;
}
template<typename T, typename ...t> void read(T &a, t &...b) {read(a), read(b...);}
}using IO::read;
typedef long long ll;
typedef unsigned long long ull;
constexpr int maxn = 200005;
int n, cnt, val[maxn], ch[maxn][26], fail[maxn];
int dfn[maxn], sz[maxn], rt[maxn], pos[maxn];
vector<int> g[maxn];
string s, str[maxn];
int insert(const string &s)
{
int now = 0;
for(char c : s)
{
int &p = ch[now][c - 'a'];
if(!p) p = ++cnt;
now = p;
}
return now;
}
void dfs(int k)
{
dfn[k] = ++cnt, sz[k] = 1;
for(int i : g[k]) dfs(i), sz[k] += sz[i];
}
void init()
{
queue<int> q;
for(int i = 0; i < 26; ++i) if(ch[0][i]) q.push(ch[0][i]);
while(q.size())
{
int t = q.front();
q.pop();
for(int i = 0; i < 26; ++i)
if(ch[t][i]) fail[ch[t][i]] = ch[fail[t]][i], q.push(ch[t][i]);
else ch[t][i] = ch[fail[t]][i];
}
for(int i = 1; i <= cnt; ++i) g[fail[i]].push_back(i);
dfs(0);
}
struct segment_tree {
struct node {
int l, r, sum;
}s[maxn * 20];
int cnt;
void modify(int k, int &nk, int sl, int sr, int q, int delta)
{
if(nk == k) s[nk = ++cnt] = s[k];
s[nk].sum += delta;
if(sl == sr) return;
int mid = sl + sr >> 1;
q <= mid? modify(s[k].l, s[nk].l, sl, mid, q, delta): modify(s[k].r, s[nk].r, mid + 1, sr, q, delta);
}
int query(int k, int sl, int sr, int ql, int qr)
{
if(!k || ql <= sl && sr <= qr) return s[k].sum;
int mid = sl + sr >> 1, ret = 0;
if(ql <= mid) ret = query(s[k].l, sl, mid, ql, qr);
if(qr > mid) ret += query(s[k].r, mid + 1, sr, ql, qr);
return ret;
}
}tree;
bool check(int ver, int pos, int val) {return tree.query(rt[ver], 1, cnt, dfn[pos], dfn[pos] + sz[pos] - 1) >= val;}
int main()
{
// freopen(".in", "r", stdin);
// freopen(".out", "w", stdout);
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
cin >> s >> n;
for(int i = 1; i <= n; ++i) cin >> str[i] >> val[i], pos[i] = insert(str[i]);
init();
for(int i = 0, now = 0; i < s.size(); ++i)
{
now = ch[now][s[i] - 'a'];
rt[i + 1] = rt[i];
tree.modify(rt[i], rt[i + 1], 1, cnt, dfn[now], 1);
}
for(int i = 1; i <= n; ++i)
{
int l = 1, r = s.size() + 1, pos = ::pos[i];
while(l < r)
{
int mid = l + r >> 1;
if(check(mid, pos, val[i])) r = mid;
else l = mid + 1;
}
if(l > s.size()) puts("-1");
else printf("%d\n", l - str[i].size() + 1);
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 10ms
memory: 43440kb
input:
hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh...
output:
50997 112451 97534 13355 150562 5772 146250 10904 4343 194777 71395 96501 6809 18571 166901 114789 123587 176339 29660 82650 63509 80101 47907 66143 199971 108032 140518 49221 46212 28127 61461 149025 142818 33646 17132 196161 36671 28656 16860 141951 139429 72866 162807 21343 194803 16263 118701 20...
result:
ok 631 lines
Test #2:
score: 0
Accepted
time: 211ms
memory: 66316kb
input:
gnzlzbsarybaxilacuopvdkhjfiynrgfdhsrecyxedcrriztcxboczhfaseqglcwshaewaepasxqpaxxbroxndbxqabrvtrrshrnnlyfodtxyltjkbghfkjcqrqsuwdsgypcaroaojqbfrjqbdrimglxcqtfmqaeogqunaegfpfzcmyjwfgbwaigwitcyspiedbisjuedeyseneuzjdteifzvdfzhenapmmreqpvwsmtrxowjnmmrthzhojgxsoppfgfgohoghuwvqclzsmeydusfndrdyqokpqwupixyoxr...
output:
-1 -1 174057 -1 141370 -1 75407 -1 112842 -1 -1 4510 100584 12223 35161 28768 -1 5258 151196 -1 25061 87769 -1 135272 -1 -1 -1 159851 -1 -1 121971 108762 60263 143662 -1 5200 65515 -1 -1 -1 -1 157064 65499 -1 84122 173745 171855 -1 193921 -1 121426 162134 137032 126244 99210 155648 95498 151755 1105...
result:
ok 54751 lines
Test #3:
score: 0
Accepted
time: 90ms
memory: 35692kb
input:
gnzlzbsarybaxilacuopvdkhjfiynrgfdhsrecyxedcrriztcxboczhfaseqglcwshaewaepasxqpaxxbroxndbxqabrvtrrshrnnlyfodtxyltjkbghfkjcqrqsuwdsgypcaroaojqbfrjqbdrimglxcqtfmqaeogqunaegfpfzcmyjwfgbwaigwitcyspiedbisjuedeyseneuzjdteifzvdfzhenapmmreqpvwsmtrxowjnmmrthzhojgxsoppfgfgohoghuwvqclzsmeydusfndrdyqokpqwupixyoxr...
output:
-1 -1 -1 66435 197872 -1 83779 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 91584 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 21808 -1 -1 -1 -1 -1 15575 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 196132 -...
result:
ok 200000 lines
Test #4:
score: 0
Accepted
time: 263ms
memory: 78172kb
input:
qzpazeynjuulxowssvbghqhdtywsnzgwmpospvxyeoxsrwxccwucqgsyllrkburhfrivzqcpnevmixivrtbxexhrjauxayxmrdluzkvxnfvocgoceavurwlxzdfepcxzcdaoppzfhqpyhmjlhbfsntaewlfjqgefvqttczahgzgucgoohnjsdvyaxltixdvbgzoewptjuosymanxeiewbvnibhjbkhoebygmtmwldtvyijasjquxvtwkhlngbcremdsprdetxkggogyjbgsuduzmutcgblzoqopwspbzrurs...
output:
109498 154508 -1 -1 -1 -1 1028 36133 -1 -1 -1 -1 -1 191213 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 129366 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 196816 -1 -1 141983 -1 -1 137732 -1 11350 -1 -1 -1 25285 52189 -1 -1 -1 -1 80999 -1 -1 17773 5870 -1 -1 -1 -1 -1 128813 -1 1492 -1 -1 1513 -1 -1 -1 139760 199034 -1 -1 49122 ...
result:
ok 50034 lines
Test #5:
score: 0
Accepted
time: 1ms
memory: 18312kb
input:
dkfjahfwbaofboahsdlvkjnalsf 10 dkfjahfwbaofboahsdlvkjnalsfd 1 adkfjahfwbaofboahsdlvkjnalsf 1 kfj 2 kfj 1 a 3 a 1 a 2 a 4 w 2 aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa 1
output:
-1 -1 -1 2 15 5 10 24 -1 -1
result:
ok 10 lines
Test #6:
score: 0
Accepted
time: 1ms
memory: 14188kb
input:
alfalfa 5 alfa 1 alfa 2 alfa 3 alfalfa 1 alfalfa 2
output:
1 4 -1 1 -1
result:
ok 5 lines
Test #7:
score: 0
Accepted
time: 2ms
memory: 16236kb
input:
x 28 a 1 b 1 c 1 d 1 e 1 f 1 g 1 h 1 i 1 j 1 k 1 l 1 m 1 n 1 o 1 p 1 q 1 r 1 s 1 t 1 u 1 v 1 w 1 x 1 y 1 z 1 abcdefghijklmnopqrstuvwxyz 1 abcdefghijklmnopqrstuvwxyz 1
output:
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1
result:
ok 28 lines
Test #8:
score: 0
Accepted
time: 42ms
memory: 23536kb
input:
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...
output:
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 ...
result:
ok 200000 lines
Test #9:
score: 0
Accepted
time: 20ms
memory: 80352kb
input:
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...
output:
100001 -1
result:
ok 2 lines
Test #10:
score: 0
Accepted
time: 30ms
memory: 102264kb
input:
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...
output:
2
result:
ok single line: '2'
Test #11:
score: 0
Accepted
time: 32ms
memory: 101324kb
input:
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...
output:
1
result:
ok single line: '1'
Test #12:
score: 0
Accepted
time: 13ms
memory: 43200kb
input:
abbabaabbaababbabaababbaabbabaabbaababbaabbabaababbabaabbaababbabaababbaabbabaababbabaabbaababbaabbabaabbaababbabaababbaabbabaabbaababbaabbabaababbabaabbaababbaabbabaabbaababbabaababbaabbabaababbabaabbaababbabaababbaabbabaabbaababbaabbabaababbabaabbaababbabaababbaabbabaababbabaabbaababbaabbabaabbaab...
output:
1 1537 3073 5121 6145 7681 9217 10241 12289 13825 15361 17409 18433 20481 22017 23553 24577 26113 27649 29697 30721 32257 33793 34817 36865 38401 39937 40961 42497 44033 46081 47105 49153 50689 52225 54273 55297 56833 58369 59393 61441 62977 64513 66561 67585 69633 71169 72705 73729 75265 76801 7884...
result:
ok 195 lines