Submission details
Task:Buzzwords
Sender:aalto26im_005
Submission time:2026-11-02 17:12:22 +0200
Language:C++ (C++20)
Status:READY
Result:
Test results
testverdicttime
#10.00 sdetails
#20.00 sdetails
#30.00 sdetails
#40.00 sdetails
#50.00 sdetails
#60.00 sdetails
#70.00 sdetails
#80.00 sdetails
#90.00 sdetails
#100.00 sdetails
#110.00 sdetails
#120.01 sdetails
#130.00 sdetails
#140.00 sdetails
#150.00 sdetails
#160.00 sdetails
#170.00 sdetails
#180.00 sdetails
#190.00 sdetails
#200.00 sdetails
#210.00 sdetails
#220.00 sdetails
#230.00 sdetails
#240.00 sdetails
#250.00 sdetails
#260.00 sdetails
#270.00 sdetails
#280.00 sdetails
#290.00 sdetails
#300.00 sdetails
#310.00 sdetails
#320.00 sdetails
#330.00 sdetails
#340.00 sdetails
#350.00 sdetails
#360.00 sdetails
#370.00 sdetails
#380.00 sdetails
#390.00 sdetails
#400.00 sdetails
#410.00 sdetails
#420.00 sdetails
#430.00 sdetails
#440.01 sdetails

Code

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

struct SAM {
    vector<int> len, link, cnt, fp;
    vector<array<int, 26>> nx;
    int last = 0;

    int newState(int l, int lk) {
        len.push_back(l); link.push_back(lk); cnt.push_back(0); fp.push_back(-1);
        array<int, 26> a; a.fill(-1); nx.push_back(a);
        return (int)len.size() - 1;
    }
    SAM(int n) {
        len.reserve(2 * n + 2); link.reserve(2 * n + 2); cnt.reserve(2 * n + 2);
        fp.reserve(2 * n + 2); nx.reserve(2 * n + 2);
        newState(0, -1);
    }
    void extend(int c) {
        int cur = newState(len[last] + 1, -1);
        cnt[cur] = 1; fp[cur] = len[cur] - 1;
        int p = last;
        while (p != -1 && nx[p][c] == -1) { nx[p][c] = cur; p = link[p]; }
        if (p == -1) link[cur] = 0;
        else {
            int q = nx[p][c];
            if (len[p] + 1 == len[q]) link[cur] = q;
            else {
                int cl = newState(len[p] + 1, link[q]);
                nx[cl] = nx[q]; fp[cl] = fp[q];
                while (p != -1 && nx[p][c] == q) { nx[p][c] = cl; p = link[p]; }
                link[q] = link[cur] = cl;
            }
        }
        last = cur;
    }

    vector<int> order() {
        int m = len.size(), mx = len[last];
        vector<int> c(mx + 2, 0), o(m);
        for (int v = 0; v < m; v++) c[len[v]]++;
        for (int i = 1; i <= mx; i++) c[i] += c[i - 1];
        for (int v = m - 1; v >= 0; v--) o[--c[len[v]]] = v;
        reverse(o.begin(), o.end());
        return o;
    }

    void propagate() {
        for (int v : order()) if (link[v] >= 0) cnt[link[v]] += cnt[v];
    }
};

int main() {
    string s; 
    int q; 
    cin >> s >> q;
    SAM sam(s.size());
    for (char ch : s) sam.extend(ch - 'a');
    sam.propagate();
    while (q--) {
        string p; 
        cin >> p;
        int v = 0;
        for (char ch : p) { 
            v = sam.nx[v][ch - 'a']; 
            if (v == -1) break; 
        }
        if(v == -1) cout << 0 << endl;
        else cout << sam.cnt[v] << "\n";
    }
}

Test details

Test 1

Verdict:

input
g fhe
395
a
aa
aafh
...

correct output
10

user output
(empty)

Test 2

Verdict:

input
s adh
372
a
ad
ae
...

correct output
6

user output
(empty)

Test 3

Verdict:

input
adcdb
20
a
aa
ab
...

correct output
9

user output
1
0
0
0
1
...

Test 4

Verdict:

input
aaaaa
5
a
aa
aaa
...

correct output
15

user output
5
4
3
2
1

Test 5

Verdict:

input
o zws
759
a
ab
abw
...

correct output
8

user output
(empty)

Test 6

Verdict:

input
aaaaa
5
a
aa
aaa
...

correct output
15

user output
5
4
3
2
1

Test 7

Verdict:

input
ifv b
649
a
aaw
ac
...

correct output
10

user output
(empty)

Test 8

Verdict:

input
dbbdc
129
a
aa
aaab
...

correct output
15

user output
0
0
0
0
0
...

Test 9

Verdict:

input
aaaaa
5
a
aa
aaa
...

correct output
15

user output
5
4
3
2
1

Test 10

Verdict:

input
eeeab
9
a
b
c
...

correct output
5

user output
1
1
0
0
3
...

Test 11

Verdict:

input
ghfhe d fd
430
a
aa
aafa
...

correct output
22

user output
(empty)

Test 12

Verdict:

input
syadhzdgck
275
a
ad
adh
...

correct output
53

user output
1
1
1
1
1
...

Test 13

Verdict:

input
adcdbbbbba
256
a
aa
aaa
...

correct output
49

user output
2
0
0
0
0
...

Test 14

Verdict:

input
aaaaaaaaaa
10
a
aa
aaa
...

correct output
55

user output
10
9
8
7
6
...

Test 15

Verdict:

input
o zwspspfd
468
a
adks
afhsrhvwxn
...

correct output
45

user output
(empty)

Test 16

Verdict:

input
aaaaaaaaaa
10
a
aa
aaa
...

correct output
55

user output
10
9
8
7
6
...

Test 17

Verdict:

input
i vbbjczpc
703
a
aa
abou
...

correct output
29

user output
(empty)

Test 18

Verdict:

input
d bdcbdbcb
128
a
aa
aab
...

correct output
42

user output
(empty)

Test 19

Verdict:

input
aaaaaaaaaa
10
a
aa
aaa
...

correct output
55

user output
10
9
8
7
6
...

Test 20

Verdict:

input
eeeabcbabh
171
a
aac
aahg
...

correct output
34

user output
2
0
0
2
0
...

Test 21

Verdict:

input
ghfhehdf ddciaicdehheefdihadaf...

correct output
246

user output
(empty)

Test 22

Verdict:

input
s adhzdgckekirkyowkirnflwfanrx...

correct output
52

user output
(empty)

Test 23

Verdict:

input
adcdbbbbbaaccabbbccd cabccacdb...

correct output
178

user output
(empty)

Test 24

Verdict:

input
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...

correct output
2518

user output
99
98
93
92
91
...

Test 25

Verdict:

input
oezws spfdzfasgxlquafowjzpe pv...

correct output
284

user output
(empty)

Test 26

Verdict:

input
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...

correct output
1387

user output
100
98
92
89
86
...

Test 27

Verdict:

input
ifvbbjczpcnpknimqvlttkngpe szx...

correct output
258

user output
(empty)

Test 28

Verdict:

input
dbbdcbdb bcaabb bccddbbbacbcdc...

correct output
36

user output
(empty)

Test 29

Verdict:

input
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...

correct output
3076

user output
100
99
98
97
91
...

Test 30

Verdict:

input
e eabcbabhdbcbaddebchdiga ggfb...

correct output
23

user output
(empty)

Test 31

Verdict:

input
ghfhehdff dci icdehheefdih daf...

correct output
248

user output
(empty)

Test 32

Verdict:

input
s a hzdgckekirkyo kirnflw anrx...

correct output
27

user output
(empty)

Test 33

Verdict:

input
adcdbbb baac abbbcc c abccacd ...

correct output
433

user output
(empty)

Test 34

Verdict:

input
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...

correct output
3427

user output
197
195
182
172
159
...

Test 35

Verdict:

input
oezwsp pf z asgxlquafowjzpekpv...

correct output
359

user output
(empty)

Test 36

Verdict:

input
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...

correct output
2126

user output
184
178
172
167
163
...

Test 37

Verdict:

input
ifvbbjczpcnpk imqvlttkngpeqszx...

correct output
395

user output
(empty)

Test 38

Verdict:

input
dbbdcbd cbcaabbabccddbb acbcdc...

correct output
242

user output
(empty)

Test 39

Verdict:

input
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...

correct output
4287

user output
198
196
180
171
170
...

Test 40

Verdict:

input
eeeabcbabhd cb ddebchdigaiggfb...

correct output
15

user output
(empty)

Test 41

Verdict:

input
ghfhehdffdd i icdehheefd hadaf...

correct output
431

user output
(empty)

Test 42

Verdict:

input
syadhzdgckekirkyow irnflwfanrx...

correct output
8039

user output
(empty)

Test 43

Verdict:

input
adcdbbbbbaaccabb ccdccabcc cdb...

correct output
9409

user output
(empty)

Test 44

Verdict:

input
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...

correct output
168696

user output
996
994
982
979
975
...