Codeforces Round 234 (Div. 2)
D
Dima and Bacteria
Codeforces
2000
原题
← CE →
翻译中…

Dima took up the biology of bacteria, as a result of his experiments, he invented $*k*$ types of bacteria. Overall, there are $*n*$ bacteria at his laboratory right now, and the number of bacteria of type $*i*$ equals $*c*_{*i*}$. For convenience, we will assume that all the bacteria are numbered from $1$ to $*n*$. The bacteria of type $*c*_{*i*}$ are numbered from image to image.

翻译中…

With the help of special equipment Dima can move energy from some bacteria into some other one. Of course, the use of such equipment is not free. Dima knows $*m*$ ways to move energy from some bacteria to another one. The way with number $*i*$ can be described with integers $*u*_{*i*}$, $*v*_{*i*}$ and $*x*_{*i*}$ mean that this way allows moving energy from bacteria with number $*u*_{*i*}$ to bacteria with number $*v*_{*i*}$ or vice versa for $*x*_{*i*}$ dollars.

翻译中…

Dima's Chef (Inna) calls the type-distribution correct if there is a way (may be non-direct) to move energy from any bacteria of the particular type to any other bacteria of the same type (between any two bacteria of the same type) for zero cost.

翻译中…

As for correct type-distribution the cost of moving the energy depends only on the types of bacteria help Inna to determine is the type-distribution correct? If it is, print the matrix $*d*$ with size $*k* × *k*$. Cell $*d*[*i*][*j*]$ of this matrix must be equal to the minimal possible cost of energy-moving from bacteria with type $*i*$ to bacteria with type $*j*$.

翻译中…

Input

翻译中…

The first line contains three integers $*n*, *m*, *k*$ $(1 ≤ *n* ≤ 10^{5}; 0 ≤ *m* ≤ 10^{5}; 1 ≤ *k* ≤ 500)$. The next line contains $*k*$ integers $*c*_{1}, *c*_{2}, ..., *c*_{*k*}$ $(1 ≤ *c*_{*i*} ≤ *n*)$. Each of the next $*m*$ lines contains three integers $*u*_{*i*}, *v*_{*i*}, *x*_{*i*}$ $(1 ≤ *u*_{*i*}, *v*_{*i*} ≤ 10^{5}; 0 ≤ *x*_{*i*} ≤ 10^{4})$. It is guaranteed that image.

翻译中…

Output

翻译中…

If Dima's type-distribution is correct, print string «Yes», and then $*k*$ lines: in the $*i*$-th line print integers $*d*[*i*][1], *d*[*i*][2], ..., *d*[*i*][*k*]$ $(*d*[*i*][*i*] = 0)$. If there is no way to move energy from bacteria $*i*$ to bacteria $*j*$ appropriate $*d*[*i*][*j*]$ must equal to -1. If the type-distribution isn't correct print «No».

翻译中…

样例

Input #1
4 4 2
1 3
2 3 0
3 4 0
2 4 1
2 1 2
Output #1
Yes
0 2
2 0
InputCopy OutputCopy
Input #2
3 1 2
2 1
1 2 0
Output #2
Yes
0 -1
-1 0
InputCopy OutputCopy
Input #3
3 2 2
2 1
1 2 0
2 3 1
Output #3
Yes
0 1
1 0
InputCopy OutputCopy
Input #4
3 0 2
1 2
Output #4
No
InputCopy OutputCopy
题目信息
题号
400D
时间限制
2 s
内存限制
256 MB
标签
并查集
图论
最短路

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。