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 that O(NQ)?
Number of connected components with queries
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 that O(NQ)?
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en4 |
|
Is1500EnoughForEGOI | 2020-06-01 00:13:03 | 2 | Tiny change: 'lution that O(NQ)?' -> 'lution than O(NQ)?' | |
| en3 |
|
Is1500EnoughForEGOI | 2020-05-31 22:43:54 | 0 | (published) | |
| en2 |
|
Is1500EnoughForEGOI | 2020-05-31 22:43:45 | 6 | (saved to drafts) | |
| en1 |
|
Is1500EnoughForEGOI | 2020-05-31 22:43:06 | 256 | Initial revision (published) |
| # | User | Rating |
|---|---|---|
| 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 |
| # | User | Contrib. |
|---|---|---|
| 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 |
