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 | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 165 |
| 2 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 4 | adamant | 160 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 8 | Dominater069 | 154 |
| 8 | nor | 154 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 15.11.2024 08:02:48 (h1).
Десктопная версия, переключиться на мобильную.
При поддержке
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.