Mai intai trebuie sa te autentifici.
Cod sursa(job #3005360)
Utilizator | Data | 16 martie 2023 21:50:09 | |
---|---|---|---|
Problema | Algoritmul Bellman-Ford | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.18 kb |
#include <fstream>
#include <vector>
#include <deque>
#define DIM 50001
#define INF 1000000001
using namespace std;
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");
int n,m,x,y,c,d[DIM],ap[DIM];
bool viz[DIM];
vector<pair<int,int>> l[DIM];
deque<int> q;
int main() {
fin>>n>>m;
while (m--) {
fin>>x>>y>>c;
l[x].push_back({y,c});
}
for (int i=2;i<=n;i++)
d[i]=INF;
d[1]=0;
viz[1]=1;
ap[1]=1;
q.push_back(1);
while (!q.empty()) {
int nod=q.front();
q.pop_front();
viz[nod]=0;
for (int i=0;i<l[nod].size();i++) {
int vec=l[nod][i].first;
int cost=l[nod][i].second;
if (d[nod]+cost<d[vec]) {
d[vec]=d[nod]+cost;
if (viz[vec]==0) {
ap[vec]++;
if (ap[vec]==n) {
fout<<"Ciclu negativ!";
return 0;
}
viz[vec]=1;
q.push_back(vec);
}
}
}
}
for (int i=2;i<=n;i++)
fout<<d[i]<<" ";
return 0;
}