CCC '16 S3 - Phonomenal Reviews - DMOJ: Modern Online Judge

CCC '16 S3 - Phonomenal Reviews

Points: 12 (partial)

Time limit: 2.0s

Memory limit: 256M

Author:

Problem type

Canadian Computing Competition: 2016 Stage 1, Senior #3

Jo is a blogger, specializing in the critique of restaurants. Today, she wants to visit all the Vietnamese Pho restaurants in the Waterloo area, in order to determine which one is the best.

There are $N$ ~N~ restaurants in the city of Waterloo, numbered $0$ ~0~ to $N-1$ ~N-1~. However, only $M$ ~M~ of them are Pho restaurants. Jo can choose to start at any restaurant. There are $N-1$ ~N-1~ roads in Waterloo, each road connecting exactly two restaurants. It is possible to reach every restaurant from any restaurant using these roads. It takes Jo exactly 1 minute to travel along any road.

In computer science, a road network with this structure is called a tree. Here are three examples of trees:

$\text{[math]}$

One property that is true for all trees is that there is exactly one path that does not repeat any roads between any two points in the tree.

What is the minimal length of time that Jo needs to spend on traveling on roads to visit all of the Pho restaurants?

Input Specification

The first line of input contains 2 integers, $N$ ~N~ and $M$ ~M~ $(2 \le M \le N \le 100\,000)$ ~(2 \le M \le N \le 100\,000)~.

The second line of input contains $M$ ~M~ distinct integers indicating the restaurants which are Pho restaurants.

The next $N-1$ ~N-1~ lines contain 2 integers each. The $i^\text{th}$ ~i^\text{th}~ line contains $a_i$ ~a_i~ and $b_i$ ~b_i~ $(0 \le a_i, b_i \le N-1)$ ~(0 \le a_i, b_i \le N-1)~, representing a path between the two restaurants numbered $a_i$ ~a_i~ and $b_i$ ~b_i~.

For 3 of the 15 available marks, $M = 2$ ~M = 2~ and $N \le 100$ ~N \le 100~.
For an additional 3 of the 15 available marks, $M \le 3$ ~M \le 3~ and $N \le 100$ ~N \le 100~.
For an additional 3 of the 15 available marks, $M \le 8$ ~M \le 8~ and $N \le 100$ ~N \le 100~.
For an additional 4 of the 15 available marks, $M \le N \le 1\,000$ ~M \le N \le 1\,000~.

Output Specification

Your program should output one line, containing one integer - the minimum amount of time Jo needs to spend traveling on roads in order to visit all Pho restaurants, in minutes.

Sample Input 1

Output for Sample Input 1

Explanation for Output for Sample Input 1

The path between $5$ ~5~ and $2$ ~2~ goes through $5 \to 1 \to 0 \to 2$ ~5 \to 1 \to 0 \to 2~, which uses 3 roads.

Sample Input 2

Output for Sample Input 2

Explanation for Output for Sample Input 2

If Jo begins at restaurant 6, she will only need to use 7 roads. One possible path that she can take is: $6 \to 1 \to 0 \to 2 \to 3 \to 7 \to 3 \to 4$ . Notice that she doesn't need to visit restaurant 5, since it is not a Pho restaurant. A diagram of the road network is shown below:

$\text{[math]}$

Comments

6
SimonV commented on Nov. 25, 2023, 11:02 p.m.
If youre having trouble, try this:

6 2 2 5 0 3 1 3 2 1 4 3 4 5

The answer should be 4

35

puppy commented on Dec. 26, 2019, 3:00 p.m. ← edit 2 →

Who's Jo?

229

Jonathan_Uy commented on Dec. 27, 2019, 4:25 p.m.

Jo Mama

13

ThatGuyOnTheStreet commented on Feb. 3, 2019, 8:38 p.m.

The tree examples look like they are trying to spell something