Mag
레이팅 미적용의견: 0
4 \(s / 256\) \(MB / 120\) points
You are given an undirected tree with each of its node assigned a magic \(X\)
\(i\)
.
1
The magic of a path is defined as the product of the magic of the nodes on that path divided
2
by the number of the nodes on the path. For example, the magic of a path that consists of
nodes with magic 3 and 5 is 7.5 (\(3 \cdot 5 / 2\)).
In the given tree, find the path with the minimal magic and output the magic of that path.
In test cases worth 24 points total, it will hold \(N\)
≤ 1 000.
In test cases worth 36 additional points total, there will not be a node that is connected to
more than 2 other nodes.
The first line of input contains the integer \(N\)
(1 ≤ \(N\)
≤ 10 {6}{ }), the number of nodes in the tree.
Each of the following \(N - 1\) lines contains two integers, \(A\)
\(i\)
and \(B\)
\(i\)
(1 ≤ \(A\)
\(i\)
, \(B\)
\(i\)
≤ \(N\)
), the labels of
nodes connected with an edge.
The \(i\)
{th}{ } of the following \(N\)
lines contains the integer \(X\)
\(i\)
( 1
≤ \(X\)
\(i\)
≤
10 {9}{ }) ,
magic of the \(i\)
{th}{ } node.
Output the magic of the path with minimal magic in the form of a completely reduced fraction
\(P\)/ \(Q\)
( \(P\)
and \(Q\)
are relatively prime integers).
In all test cases, it will hold that the required \(P\)
and \(Q\)
are smaller than 10 {18}{ }.
2
1 2
3
4
5
1 2
2 4
1 3
5 2
2
1
1
1
1 An undirected tree is a connected graph that consists of N
nodes and N
- 1 undirected
edges.
2 A path in a graph is a finite sequence of edges which connect a sequence of vertices
which are all distinct from one another
4 s / 256 MB / 120 points
3output
3/1
1/2Clarification of the first test case:
Notice that the path may begin and end in the same node. The path with the minimal magic consists of
the node with magic 3, so the entire path’s magic is 3 / 1.
Clarification of the second test case:
The path that consists of nodes with labels 2 and 4 is of magic (1⋅1) / 2 = 1 / 2.
That is also the path with the minimal possible magic.
평가 및 의견
Mag
Log in to rate problems.
아직 의견이 없습니다. 자격이 된다면 위 양식에서 가장 먼저 평가해 보세요.
풀이 제출
Mag