You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
|
|
|
|
#include<iostream>
|
|
|
|
|
using namespace std;
|
|
|
|
|
int main()
|
|
|
|
|
{
|
|
|
|
|
// dev<65><76><EFBFBD>뿽<EFBFBD><EBBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ľ<EFBFBD><C4BD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|
|
|
|
// .cpp<70>ļ<EFBFBD><C4BC>ü<EFBFBD><C3BC>±<EFBFBD><C2B1><EFBFBD><F2BFAAA3>ٿ<EFBFBD><D9BF><EFBFBD>
|
|
|
|
|
//<2F>ƺ<EFBFBD>ע<EFBFBD><D7A2>
|
|
|
|
|
int e[10][10], dis[10], book[10], i, j, n, m, t1, t2, t3, u, v, min;
|
|
|
|
|
int inf = 99999999;
|
|
|
|
|
cin >> n >> m;
|
|
|
|
|
for (i = 1; i <= n; i++)
|
|
|
|
|
for (j = 1; j <= n; j++)
|
|
|
|
|
{
|
|
|
|
|
if (i == j) {
|
|
|
|
|
e[i][j] = 0;
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
e[i][j] = inf;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
for (i = 1; i <= m; i++)
|
|
|
|
|
{
|
|
|
|
|
cin >> t1 >> t2 >> t3;
|
|
|
|
|
e[t1][t2] = t3;
|
|
|
|
|
}
|
|
|
|
|
for (i = 1; i <= n; i++)
|
|
|
|
|
{
|
|
|
|
|
dis[i] = e[1][i];
|
|
|
|
|
}
|
|
|
|
|
for (i = 1; i <= n; i++)
|
|
|
|
|
{
|
|
|
|
|
book[i] = 0;
|
|
|
|
|
}
|
|
|
|
|
book[1] = 1;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
for (i = 1; i <= n - 1; i++)
|
|
|
|
|
{
|
|
|
|
|
min = inf;
|
|
|
|
|
for (j = 1; j <= n; j++)
|
|
|
|
|
{
|
|
|
|
|
if (book[j] == 0 && dis[j] < min)
|
|
|
|
|
{
|
|
|
|
|
min = dis[j];
|
|
|
|
|
u = j;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
book[u] = 1;
|
|
|
|
|
for (v = 1; v <= n; v++)
|
|
|
|
|
{
|
|
|
|
|
if (e[u][v] < inf)
|
|
|
|
|
{
|
|
|
|
|
if (dis[v] > dis[u] + e[u][v])
|
|
|
|
|
{
|
|
|
|
|
dis[v] = dis[u] + e[u][v];
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
for (i = 1; i <= n; i++)
|
|
|
|
|
cout << dis[i] << " ";
|
|
|
|
|
return 0;
|
|
|
|
|
}
|