| # | 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 | Dominater069 | 154 |
| 8 | awoo | 154 |
| 10 | luogu_official | 150 |
how to approach this problem ??
you have been given tree, find a shortest path to travel from 1 to N, such that you visits some given set of nodes in your path from 1 to N. you are allowed to visit same node multiple times.
eg — N = 5
1
/ \
2 3
/ \
4 5
CONSTRAINTS — N UPTO ( 1e5 )
node_to_visit_in_path = { 2 ,4 } solution — 6 ( 1 -> 2 -> 1 -> 3 -> 4 -> 3 -> 5)
is this a famous kind of problem ?, i think similar problem i have see somewhere.
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en8 |
|
computer_jock | 2023-07-26 08:26:02 | 9 | ||
| en7 |
|
computer_jock | 2023-07-26 08:25:32 | 130 | ||
| en6 |
|
computer_jock | 2023-07-26 08:25:01 | 72 | ||
| en5 |
|
computer_jock | 2023-07-26 08:21:06 | 36 | ||
| en4 |
|
computer_jock | 2023-07-26 08:20:22 | 132 | ||
| en3 |
|
computer_jock | 2023-07-26 08:16:59 | 140 | Tiny change: ' \n ' -> ' \n \n ' | |
| en2 |
|
computer_jock | 2023-07-26 08:10:50 | 9 | Tiny change: ' \n ' -> ' \n \n ' | |
| en1 |
|
computer_jock | 2023-07-26 08:08:34 | 508 | Initial revision (published) |
