100 #P1602. [Usaco2008 Oct]牧场行走

[Usaco2008 Oct]牧场行走

[USACO08OCT] Pasture Walking G

题目描述

The NN cows (2≤N≤1,000)(2 \leq N \leq 1,000) conveniently numbered 1⋯N1\cdots N are grazing among the NN pastures also conveniently numbered 1⋯N1\cdots N. Most conveniently of all, cow ii is grazing in pasture ii.

Some pairs of pastures are connected by one of N−1N-1 bidirectional walkways that the cows can traverse. Walkway ii connects pastures AiA_i and Bi(1≤Ai≤N;1≤Bi≤N)B_i (1 \leq A_i \leq N; 1 \leq B_i \leq N) and has a length of Li(1≤Li≤10,000)L_i (1 \leq L_i \leq 10,000).

The walkways are set up in such a way that between any two distinct pastures, there is exactly one path of walkways that travels between them. Thus, the walkways form a tree.

The cows are very social and wish to visit each other often. Ever in a hurry, they want you to help them schedule their visits by computing the lengths of the paths between QQ pairs of pastures (each pair given as a query p1,p2(1≤p1≤N;1≤p2≤N)p_1,p_2 (1 \leq p_1 \leq N; 1 \leq p_2 \leq N).

有 N(2≤N≤1000)N(2\leq N\leq 1000) 头奶牛,编号为 11 到 NN,它们正在同样编号为 11 到 NN 的牧场上行走.为了方便,我们假设编号为 ii 的牛恰好在第 ii 号牧场上.

有一些牧场间每两个牧场用一条双向道路相连,道路总共有 N−1N - 1 条,奶牛可以在这些道路上行走.第 ii 条道路把第 AiA_i 个牧场和第 BiB_i 个牧场连了起来 (1≤Ai≤N;1≤Bi≤N)(1 \leq A_i \leq N; 1 \leq B_i \leq N),而它的长度是 1≤Li≤10,0001 \leq L_i \leq 10,000.在任意两个牧场间,有且仅有一条由若干道路组成的路径相连.也就是说,所有的道路构成了一棵树.

奶牛们十分希望经常互相见面.它们十分着急,所以希望你帮助它们计划它们的行程,你只需要计算出 Q(1<Q<1000)Q(1 < Q < 1000) 对点之间的路径长度•每对点以一个询问 p1,p2(1≤p1≤N;1≤p2≤N)p_1,p_2 (1 \leq p_1 \leq N; 1 \leq p_2 \leq N). 的形式给出.

输入格式

Line 11: Two space-separated integers: NN and QQ.

Lines 2⋯N2\cdots N: Line i+1 contains three space-separated integers: Ai,BiA_i, B_i, and LiL_i.

Lines N+1⋯N+QN+1\cdots N+Q: Each line contains two space-separated integers representing two distinct pastures between which the cows wish to travel: p1p_1 and p2p_2

输出格式

Lines 1⋯Q1\cdots Q: Line ii contains the length of the path between the two pastures in query ii.

样例 #1

样例输入 #1

4 2 
2 1 2 
4 3 2 
1 4 3 
1 2 
3 2

样例输出 #1

2 
7

提示

Query 1: The walkway between pastures 1 and 2 has length 2.

Query 2: Travel through the walkway between pastures 3 and 4, then the one between 4 and 1, and finally the one between 1 and 2, for a total length of 7.

Source

资格赛