Submission details
Task:Z-array
Sender:aalto26ih_011
Submission time:2026-11-03 18:16:21 +0200
Language:C++ (C++20)
Status:READY
Result:ACCEPTED
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#3ACCEPTED0.00 sdetails
#4ACCEPTED0.00 sdetails
#5ACCEPTED0.00 sdetails
#6ACCEPTED0.14 sdetails
#7ACCEPTED0.13 sdetails
#8ACCEPTED0.14 sdetails
#9ACCEPTED0.13 sdetails
#10ACCEPTED0.13 sdetails
#11ACCEPTED0.00 sdetails
#12ACCEPTED0.14 sdetails
#13ACCEPTED0.14 sdetails

Code

#include <iostream>
#include <vector>
#include <string>

using namespace std;

// https://www.geeksforgeeks.org/dsa/z-algorithm-linear-time-pattern-searching-algorithm/

int main(){
    string input;
    cin >> input;

    int n = input.length();
    vector<int> zarr(n);
    for (int i = 0; i < n; i++)
    {
        zarr[i] = 0;
    }
    
    // First is always same length
    zarr[0] = n;

    // Boundaries
    int L = 0;
    int R = 0;

    for (int i = 1; i < n; i++)
    {
        if (i <= R) // We have already calculated this.
        {
            // Smaller length from beginning or end.
            zarr[i] = min(R - i + 1, zarr[i - L]);
        }

        // Not in bounds.
        // Extend beyond R
        // Brute force compare
        while (i + zarr[i] < n && input[zarr[i]] == input[i + zarr[i]])
        {   
            zarr[i]++;
        }
        
        // Update window
        if (i + zarr[i] - 1 > R)
        {
            L = i;
            R = i + zarr[i] - 1;
        }

    }

    for (int i = 0; i < n; i++)
    {
        cout << zarr[i];
        cout << " ";
    }

    return 0;
}

Test details

Test 1

Verdict: ACCEPTED

input
aaaaaaaaaa

correct output
10 9 8 7 6 5 4 3 2 1 

user output
10 9 8 7 6 5 4 3 2 1 

Test 2

Verdict: ACCEPTED

input
ababababab

correct output
10 0 8 0 6 0 4 0 2 0 

user output
10 0 8 0 6 0 4 0 2 0 

Test 3

Verdict: ACCEPTED

input
aabababaaa

correct output
10 1 0 1 0 1 0 2 2 1 

user output
10 1 0 1 0 1 0 2 2 1 

Test 4

Verdict: ACCEPTED

input
ahtqqkhrrn

correct output
10 0 0 0 0 0 0 0 0 0 

user output
10 0 0 0 0 0 0 0 0 0 

Test 5

Verdict: ACCEPTED

input
mqdozmqdoz

correct output
10 0 0 0 0 5 0 0 0 0 

user output
10 0 0 0 0 5 0 0 0 0 

Test 6

Verdict: ACCEPTED

input
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...

correct output
1000000 999999 999998 999997 9...

user output
1000000 999999 999998 999997 9...

Test 7

Verdict: ACCEPTED

input
ababababababababababababababab...

correct output
1000000 0 999998 0 999996 0 99...

user output
1000000 0 999998 0 999996 0 99...

Test 8

Verdict: ACCEPTED

input
baaaabbabaabbbbaaaabbbababaaba...

correct output
1000000 0 0 0 0 1 2 0 3 0 0 1 ...

user output
1000000 0 0 0 0 1 2 0 3 0 0 1 ...

Test 9

Verdict: ACCEPTED

input
ltpbdybvcpychbsplyonjfmdtsnqwt...

correct output
1000000 0 0 0 0 0 0 0 0 0 0 0 ...

user output
1000000 0 0 0 0 0 0 0 0 0 0 0 ...

Test 10

Verdict: ACCEPTED

input
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...

correct output
1000000 99998 99997 99996 9999...

user output
1000000 99998 99997 99996 9999...

Test 11

Verdict: ACCEPTED

input
abaababaab

correct output
10 0 1 3 0 5 0 1 2 0 

user output
10 0 1 3 0 5 0 1 2 0 

Test 12

Verdict: ACCEPTED

input
zzzzzzzzzzzzzzzzzzzzzzzzzzzzzz...

correct output
1000000 499999 499998 499997 4...

user output
1000000 499999 499998 499997 4...

Test 13

Verdict: ACCEPTED

input
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...

correct output
1000000 147418 147417 147416 1...

user output
1000000 147418 147417 147416 1...