Pagini recente » algoritmiada-2019/clasament/maraton-preoni-preoji | Cod sursa (job #1002204) | Cod sursa (job #2230971) | Cod sursa (job #991796) | Cod sursa (job #2499528)
#include <fstream>
#define inf 100000000
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
struct muchii{
long x, y, c;
}G[250005];
int N, M, i, x ,y, c, D[250005], ok;
int main()
{
fin >> N >> M;
for (i = 1; i <= M; i ++){
fin >> x >> y >> c;
G[i].x = x; G[i].y = y; G[i].c = c;
if (x == 1)
D[y] = c;
}
for (i = 2; i <= N; i ++)
if (D[i] == 0)
D[i] = inf;
while (ok == 0){
ok = 1;
for (i = 1; i <= M; i ++)
if (D[G[i].y] > D[G[i].x] + G[i].c){
D[G[i].y] = D[G[i].x] + G[i].c;
ok = 0;
}
}
for (i = 2; i <= N; i ++){
if (D[i] != inf)
fout << D[i] << " ";
else
fout << "0 ";
}
return 0;
}