| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
Minimum Spanning Tree under 2 constraints instead of just 1
Each edge — 'i' in the graph has two values associated with it — v1[i] and v2[i].
Let M be one of the possible MST of the graph. Then define A = max(v1[i]'s for all the edges in MST) and B = max(v2[i]'s for all the edges in the MST).
Then for all the possible MSTs of this graph find the minimum value of A + B.
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en3 |
|
Impostor_Syndrome | 2022-04-10 12:33:08 | 8 | ||
| en2 |
|
Impostor_Syndrome | 2022-04-10 12:24:19 | 26 | ||
| en1 |
|
Impostor_Syndrome | 2022-04-09 22:54:22 | 392 | Initial revision (published) |
