I am referring to this problem: Determining DNA Health. The editorial mentions using Aho- Corasick Algorithm. I was wondering can it be solved using tries?
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/21/2024 17:48:37 (k1).
Desktop version, switch to mobile version.
Supported by
I am the setter of this problem. The Aho-Corasick automaton I mention in the editorial is a trie itself (it is created by adding the suffix links to trie nodes). So, in a way, that problem is solved using tries only.
Hi! Thanks for the reply. I couldn't quite get the editorial because I am new to this data structure. Can you direct me to some good resources which I should refer to so that I can understand the editorial? Thanks for your efforts.
I learnt from here.
http://mirror.codeforces.com/blog/entry/14854
Thanks a lot. :)