Здравствуйте. Я ищу какие-нибудь задачи на переливания (то есть когда в динамике по поддеревьям сливаются два множества, и если переливать большее в меньшее, то общее количество операций будет $$$O(nlogn)$$$ ). Если кто-нибудь знает такие задачи, напишите о них в комментариях, пожалуйста.
→ Обратите внимание
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | jiangly | 3631 |
| 4 | Kevin114514 | 3574 |
| 5 | maroonrk | 3521 |
| 6 | strapple | 3515 |
| 7 | Radewoosh | 3461 |
| 8 | tourist | 3428 |
| 9 | turmax | 3378 |
| 10 | Um_nik | 3376 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2026 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 26.05.2026 03:26:05 (g2).
Десктопная версия, переключиться на мобильную.
При поддержке
Auto comment: topic has been translated by Dannypa (original revision, translated revision, compare)
You can see the "dsu"-taged problems.
Thanks for narrowing the search space down to a couple hundreds
If your "set" means
std::setor any self balancing tree, the total time complexity is $$$\mathcal{O}(n\log^2n)$$$, not $$$\mathcal{O}(n\log n)$$$.Why the downvotes smh
The technique is called "small to large" you will find some problems here
I thnk OP also meant small to large but just to be clear, the complexity is actually $$$\mathcal{O}(n\log^2n)$$$
UPD: I mean specifically with set, but guy below has better explanation :)
There are many ways to store a set. One of them is
std::unordered_set, which has $$$O(1)$$$ insertion and $$$O(size)$$$ traversal, which yields $$$O(n\log n)$$$ total time for some problems. So, the "small to large" idea is not tied to a certain complexity.Also, sometimes we are allowed to store duplicates (or we can prove that there are no duplicates). Then, we can store sets in linked lists and merge two of them in just $$$O(1)$$$. This wouldn't require "small to large" then, but I've seen at least one problem in this comment section, which can be solved this way.
Thanks!
Great! This list is helpful.
Can you share more lists of other topics? would be more helpful :)
link
credits: Abdelrhman_Akram
https://mirror.codeforces.com/blog/entry/44351 в конце есть задачи
Спасибо!
https://usaco.guide/plat/merging?lang=cpp
https://mirror.codeforces.com/contest/1620/problem/E This one
It is called Small to Large technique.
Problem.