There is a graph with N vertices and two types of queries:
1) connect U and V
2) disconnect U and V
After each query, the number of connected components should be printed. Is there a better solution than O(NQ)?
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 146 |
| 3 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2026 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 29.04.2026 14:53:06 (g2).
Десктопная версия, переключиться на мобильную.
При поддержке
Auto comment: topic has been updated by Is1500EnoughForEGOI (previous revision, new revision, compare).
You can see it done here: https://cp-algorithms.com/data_structures/deleting_in_log_n.html in O(qlogn)
This is a dynamic connectivity problem. It was explained on Brazil's 2016 ICPC Summer School here.
Auto comment: topic has been updated by Is1500EnoughForEGOI (previous revision, new revision, compare).