Cod sursa(job #3164853)

Utilizator DenisONIcBanu Denis Andrei DenisONIc Data 4 noiembrie 2023 14:37:37
Problema Algoritmul lui Dijkstra Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 2.08 kb
#include <bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template<class T> ostream& prnt(ostream& out, T v) { out << v.size() << '\n'; for(auto e : v) out << e << ' '; return out;}
template<class T> ostream& operator<<(ostream& out, vector <T> v) { return prnt(out, v); }
template<class T> ostream& operator<<(ostream& out, set <T> v) { return prnt(out, v); }
template<class T1, class T2> ostream& operator<<(ostream& out, map <T1, T2> v) { return prnt(out, v); }
template<class T1, class T2> ostream& operator<<(ostream& out, pair<T1, T2> p) { return out << '(' << p.first << ' ' << p.second << ')'; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << " " << H; debug_out(T...);}
#define dbg(...) cerr << #__VA_ARGS__ << " ->", debug_out(__VA_ARGS__)
#define dbg_v(x, n) do{cerr<<#x"[]: ";for(int _=0;_<n;++_)cerr<<x[_]<<" ";cerr<<'\n';}while(0)
#define dbg_ok cerr<<"OK!\n"
#define ll long long
#define ld long double
#define ull unsigned long long
#define pii pair<int,int>
#define MOD 1000000007
#define zeros(x) x&(x-1)^x
#define fi first
#define se second
#define NMAX 50005
const long double PI = acos(-1);


int n, m, viz[NMAX], d[NMAX];
vector<pair<int, int>> v[NMAX];
set<pair<int, int> > s; 


int main(){
  ios::sync_with_stdio(false);
  
  freopen("dijkstra.in", "r", stdin);
  freopen("dijkstra.out", "w", stdout);
  
  cin >> n >> m;
  for (int i=1;i<=m;i++) {
    int a, b, c;
    cin >> a >> b >> c;
    v[a].push_back({b,c});
  }

  for (int i=1;i<=n;i++) {
    d[i] = 2e9;
  }

  s.insert({0, 1});
  d[1] = 0;

  while (!s.empty()) {
    pair<int, int> el = *s.begin();
    s.erase(el);
    int nod = el.second;
    int val = el.first;
    viz[nod] = 1;

    for (auto it : v[nod]) {
      int nxt = it.first;
      int cst = it.second;

      if (viz[nxt]) continue;

      if (d[nxt] > val + cst) {
        s.erase({d[nxt], nxt});
        d[nxt] = val + cst;
        s.insert({d[nxt], nxt});
      }
    }
  }

  for (int i=2;i<=n;i++) {
    if (d[i] == 2e9) {
      d[i] = 0;
    }
    cout << d[i] << ' ';
  }
  cout << '\n';


  return 0;
}