Cod sursa(job #2522397)

Utilizator bigmixerVictor Purice bigmixer Data 12 ianuarie 2020 14:58:11
Problema Algoritmul Bellman-Ford Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.65 kb
#include <bits/stdc++.h>
#define ll long long
#define all(a) (a).begin(), (a).end()
//#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz() size()
#define fr first
#define sc second
#define pb push_back
#define er erase
#define in insert
#define pi pair<int,int>
#define pii pair<pair<int,int>,int>
#define mp make_pair
//#define int long long
#define rc(s) return cout<<s,0
#define rcc(s) cout<<s,exit(0)
using namespace std;

const int mod=1e9+7;
const int modx=998244353;
const int per=666013;

const int inf=1e9;

int n,m,dist[50005];
vector<pair<int,int>>nod[50005];

int32_t main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
    srand(chrono::steady_clock::now().time_since_epoch().count());
    ifstream cin("bellmanford.in");
    ofstream cout("bellmanford.out");
    cin >> n >> m;
    for(int i=1;i<=m;i++){
        int x,y,z;
        cin >> x >> y >> z;
        nod[x].push_back({y,z});
    }
    for(int i=2;i<=n;i++) dist[i]=inf;
    vector<int>parc;
    set<int>tz;
    parc.push_back(1);
    for(int i=1;i<=n;i++){
        tz.clear();
        for(int j:parc){
            for(auto it:nod[j]){
                if(dist[it.fr]>dist[j]+it.sc){
                    dist[it.fr]=dist[j]+it.sc;
                    tz.insert(it.fr);
                    if(i==n){
                        rc("Ciclu negativ!");
                    }
                }
            }
        }
        parc.clear();
        for(auto j:tz) parc.push_back(j);
    }
    for(int i=2;i<=n;i++) cout << dist[i] << ' ';
}