Can someone help me to solve this problem ? I try trie with sets in each vertex. It is TLE. how to reduce time?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | awoo | 158 |
4 | cry | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
Can someone help me to solve this problem ? I try trie with sets in each vertex. It is TLE. how to reduce time?
Название |
---|
Maybe ternary search trie instead of a normal trie. Note I did not read the problem.
What is ternary search trie?..
from what I tried:
Persistent trie: per query, AC, 0.61s
It's clear how to solve using segment tree storing sorted arrays in each vertex in O(n·log(n)) memory and O(log2(n)·log(maxX)) time per query.
But I haven't a clue how to solve it using persistent segment tree, can you explain please?
Non persistent trie , AC, 0.75s
Used vectors in each vertex instead of sets.