A9448 | Dima and Bacteria
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
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  to .
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$ .
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$ .
输入格式
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 .
输出格式
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».
输入输出样例
输入 #1
4 4 2 1 3 2 3 0 3 4 0 2 4 1 2 1 2
输出 #1
Yes 0 2 2 0
输入 #2
3 1 2 2 1 1 2 0
输出 #2
Yes 0 -1 -1 0
输入 #3
3 2 2 2 1 1 2 0 2 3 1
输出 #3
Yes 0 1 1 0
输入 #4
3 0 2 1 2
输出 #4
No
暂无题解
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted