| Task: | Z-array |
| Sender: | aalto26ih_036 |
| Submission time: | 2026-11-04 09:52:12 +0200 |
| Language: | C++ (C++20) |
| Status: | READY |
| Result: | ACCEPTED |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.00 s | details |
| #2 | ACCEPTED | 0.00 s | details |
| #3 | ACCEPTED | 0.00 s | details |
| #4 | ACCEPTED | 0.00 s | details |
| #5 | ACCEPTED | 0.00 s | details |
| #6 | ACCEPTED | 0.08 s | details |
| #7 | ACCEPTED | 0.09 s | details |
| #8 | ACCEPTED | 0.08 s | details |
| #9 | ACCEPTED | 0.07 s | details |
| #10 | ACCEPTED | 0.08 s | details |
| #11 | ACCEPTED | 0.00 s | details |
| #12 | ACCEPTED | 0.08 s | details |
| #13 | ACCEPTED | 0.08 s | details |
Code
// #ifdef ONLINE_JUDGE
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// #endif
#include "bits/stdc++.h"
#define fast ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define fill(arr,val) memset(arr,val,sizeof(arr))
#define FOR(i, a, b) for(__typeof(b) i = a, _b = b; i <= _b; ++i)
#define FORD(i, a, b) for(__typeof(a) i = a, _b = b; i >= _b; --i)
#define ALL(a) (a).begin(), (a).end()
#define YES cout << "YES\n"
#define NO cout << "NO\n"
#define ll long long
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define ii pair<int,int>
#define iii pair<int,pair<int,int>>
#define dq deque<int>
#define nend '\n'
using namespace std;
const ll inf = 1e18;
const int dx[] = {1,0,-1,0};
const int dy[] = {0,1,0,-1};
const int MOD = 1e9 + 7;
const ll hashi = 2e9 + 11;
void init_code() {
fast;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
// z[i] = how many chars starting at i match the start of s
// [l, r) = rightmost window known to match the prefix, reused to skip comparisons
void solve() {
string s; cin >> s;
int n=s.size();
vector<int> z(n,0);
z[0]=n;
int l=0, r=0;
FOR(i,1,n-1) {
if (i<r) z[i]=min(r-i, z[i-l]); // free part from the window
while (i+z[i]<n && s[z[i]]==s[i+z[i]]) z[i]++; // compare new chars only
if (i+z[i]>r) l=i, r=i+z[i];
}
FOR(i,0,n-1) cout << z[i] << ' ';
cout << nend;
}
int main() {
init_code();
int t = 1;
// cin >> t;
while (t--) {
solve();
}
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... |
