Critical Cities
Link to problem: Critical Cities
Kindly share your approach to solve this problem.
Any help is highly appreciated.
Kindly share your approach to solve this problem.
Any help is highly appreciated.
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 154 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 146 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 135 |
| 9 | maroonrk | 133 |
| 10 | cry | 130 |
That problem is a direct application of Dominator Tree.
Thanx for answering. I did the same but getting a WA verdict. Mostly because i still don't understand what has to be printed as the result. Could anybody make the problem statement more clear.
Thanx in advance
If you did the Dominator Tree sol, you are just supposed to print all ancestors of n on the tree. Did you forget to sort you answer? :p
From which website the problem is taken? I've never heard.
CSES
Link to problem: https://cses.fi/problemset/task/1703/
My bad, the graph is directed :/
Do you have code for this? How are you dealing with the fact graph is directed? I don't think this is correct unless I am greatly misunderstanding...