| Task: | Z-array |
| Sender: | aalto26hw_001 |
| Submission time: | 2026-11-01 21:13:51 +0200 |
| Language: | Rust (2021) |
| 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.10 s | details |
| #7 | ACCEPTED | 0.10 s | details |
| #8 | ACCEPTED | 0.10 s | details |
| #9 | ACCEPTED | 0.10 s | details |
| #10 | ACCEPTED | 0.10 s | details |
| #11 | ACCEPTED | 0.00 s | details |
| #12 | ACCEPTED | 0.11 s | details |
| #13 | ACCEPTED | 0.11 s | details |
Code
#![allow(unused)]
use std::{io, str::Bytes};
fn take_string() -> (String, Vec<u8>) {
let mut input = String::new();
io::stdin().read_line(&mut input).unwrap();
let vec: Vec<u8> = input.trim().as_bytes().to_vec();
(input.trim().to_string(), vec)
}
fn z(s: &[u8]) -> Vec<usize> {
let n = s.len();
let mut z: Vec<usize> = vec![0; n];
let (mut x, mut y) = (0usize, 0usize);
for i in 1..n {
z[i] = z[i - x].min((y + 1).saturating_sub(i));
while i + z[i] < n && s[z[i]] == s[i + z[i]] {
x = i;
y = i + z[i];
z[i] += 1;
}
}
z[0] = n;
z
}
fn main() {
let (mut s, mut vs) = take_string();
let z = z(&vs);
for &i in &z {
print!("{i} ");
}
}
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... |
