Help with a problem

Revision en2, by Mysterious109, 2023-07-02 09:02:09

Hi, I made a graph problem that I couldn't solve and I was wondering if it's solvable at all, so I'd appreciate if someone solved it (doesn't have to be solvable in the given constraints just any solution).

given a rooted weighted tree made of n nodes you start from the root and go to any adjacent node you are given m resturants each one will be on a node you are required to print the minimum cost to visit k resturants (you can visit an edge more than once) $$$n \le 1e5$$$, m <= n, k <= m, cost <= 1e9

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en7 English Mysterious109 2023-07-02 11:57:52 0 (published)
en6 English Mysterious109 2023-07-02 11:57:43 10 Tiny change: 'visit $k$ resturant' -> 'visit $k$ different resturant' (saved to drafts)
en5 English Mysterious109 2023-07-02 09:03:46 0 (published)
en4 English Mysterious109 2023-07-02 09:03:29 2 Tiny change: 'an once)\n$1\le n ' -> 'an once)\n\n$1\le n '
en3 English Mysterious109 2023-07-02 09:03:11 44
en2 English Mysterious109 2023-07-02 09:02:09 19
en1 English Mysterious109 2023-07-02 09:01:36 543 Initial revision (saved to drafts)