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)?
# | User | Rating |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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)?
Name |
---|
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).