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 | 3880 |
| 2 | jiangly | 3669 |
| 3 | ecnerwala | 3654 |
| 4 | Benq | 3627 |
| 5 | orzdevinwang | 3612 |
| 6 | Geothermal | 3569 |
| 6 | cnnfls_csy | 3569 |
| 8 | jqdai0815 | 3532 |
| 9 | Radewoosh | 3522 |
| 10 | gyh20 | 3447 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | awoo | 161 |
| 2 | maomao90 | 160 |
| 3 | adamant | 156 |
| 4 | maroonrk | 153 |
| 5 | atcoder_official | 149 |
| 6 | -is-this-fft- | 148 |
| 6 | SecondThread | 148 |
| 8 | Petr | 147 |
| 9 | Vladosiya | 144 |
| 9 | nor | 144 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Jul/28/2024 17:18:34 (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. :)