lmori's Library

This documentation is automatically generated by competitive-verifier/competitive-verifier

View the Project on GitHub lmorinn/library

:heavy_check_mark: verify/AizuOnlineJudge/graph/shortest-path/ALDS1_12_C.test.cpp

Depends on

Code

#include "../../../../template/template.hpp"
#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/lesson/1/ALDS1/12/ALDS1_12_C"

#include "../../../../graph/shortest-path/Dijkstra.hpp"


int main() {
    cin.tie(0)->sync_with_stdio(0);

    int n;
    in(n);
    vector<vector<pair<int, lint>>> g(n);
    rep(i, n) {
        int u, k;
        in(u, k);
        rep(j, k) {
            int v, c;
            in(v, c);
            g[u].emplace_back(v, c);
        }
    }

    Dijkstra<lint> d(g);
    rep(i, n) {
        out(i, d.get_dist(i));
    }
}
#line 2 "template/template.hpp"
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using ull = unsigned long long;
using ld = long double;
using int128 = __int128_t;
#define all(x) (x).begin(), (x).end()
#define uniqv(v) v.erase(unique(all(v)), v.end())
#define OVERLOAD_REP(_1, _2, _3, name, ...) name
#define REP1(i, n) for (auto i = std::decay_t<decltype(n)>{}; (i) != (n); ++(i))
#define REP2(i, l, r) for (auto i = (l); (i) != (r); ++(i))
#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)
#define logfixed(x) cout << fixed << setprecision(10) << x << endl;

ostream &operator<<(ostream &dest, __int128_t value) {
  ostream::sentry s(dest);
  if (s) {
    __uint128_t tmp = value < 0 ? -value : value;
    char buffer[128];
    char *d = end(buffer);
    do {
      --d;
      *d = "0123456789"[tmp % 10];
      tmp /= 10;
    } while (tmp != 0);
    if (value < 0) {
      --d;
      *d = '-';
    }
    int len = end(buffer) - d;
    if (dest.rdbuf()->sputn(d, len) != len) {
      dest.setstate(ios_base::badbit);
    }
  }
  return dest;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  for (int i = 0; i < (int)v.size(); i++) {
    os << v[i] << (i + 1 != (int)v.size() ? " " : "");
  }
  return os;
}

template <typename T>
ostream &operator<<(ostream &os, const set<T> &set_var) {
  for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
    os << *itr;
    ++itr;
    if (itr != set_var.end()) os << " ";
    itr--;
  }
  return os;
}

template <typename T>
ostream &operator<<(ostream &os, const unordered_set<T> &set_var) {
  for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
    os << *itr;
    ++itr;
    if (itr != set_var.end()) os << " ";
    itr--;
  }
  return os;
}

template <typename T, typename U>
ostream &operator<<(ostream &os, const map<T, U> &map_var) {
  for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
    os << itr->first << " -> " << itr->second << "\n";
  }
  return os;
}

template <typename T, typename U>
ostream &operator<<(ostream &os, const unordered_map<T, U> &map_var) {
  for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
    os << itr->first << " -> " << itr->second << "\n";
  }
  return os;
}

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &pair_var) {
  os << pair_var.first << " " << pair_var.second;
  return os;
}

void out() { cout << '\n'; }
template <class T, class... Ts>
void out(const T &a, const Ts &...b) {
  cout << a;
  (cout << ... << (cout << ' ', b));
  cout << '\n';
}

void outf() { cout << '\n'; }
template <class T, class... Ts>
void outf(const T &a, const Ts &...b) {
  cout << fixed << setprecision(14) << a;
  (cout << ... << (cout << ' ', b));
  cout << '\n';
}

template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (T &in : v) is >> in;
  return is;
}

inline void in(void) { return; }
template <typename First, typename... Rest>
void in(First &first, Rest &...rest) {
  cin >> first;
  in(rest...);
  return;
}

template <typename T>
bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}

vector<lint> dx8 = {1, 1, 0, -1, -1, -1, 0, 1};
vector<lint> dy8 = {0, 1, 1, 1, 0, -1, -1, -1};
vector<lint> dx4 = {1, 0, -1, 0};
vector<lint> dy4 = {0, 1, 0, -1};

#pragma endregion
#line 2 "verify/AizuOnlineJudge/graph/shortest-path/ALDS1_12_C.test.cpp"
#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/lesson/1/ALDS1/12/ALDS1_12_C"

#line 1 "graph/shortest-path/Dijkstra.hpp"
template <class T>
class Dijkstra {
   private:
    vector<vector<pair<int, T>>> g;
    vector<T> dist;
    vector<int> prev;
    int n;

   public:
    Dijkstra(vector<vector<pair<int, T>>> _g, int start = 0) {
        g = _g;
        n = g.size();
        dist.assign(n, -1);
        prev.assign(n, -1);
        vector<bool> fin(n, false);
        priority_queue<tuple<T, int, int>, vector<tuple<T, int, int>>, greater<tuple<T, int, int>>> q;
        dist[start] = 0;
        q.emplace(0, start, -1);
        while (!q.empty()) {
            int cur = get<1>(q.top());
            int pre = get<2>(q.top());
            q.pop();
            if (fin[cur]) continue;
            fin[cur] = true;
            prev[cur] = pre;
            for (auto p : g[cur]) {
                int nex = p.first;
                int weight = p.second;
                if (dist[nex] == -1 or dist[nex] > dist[cur] + weight) {
                    dist[nex] = dist[cur] + weight;
                    q.emplace(dist[nex], nex, cur);
                }
            }
        }
    }

    void rebuild(int start) {
        dist.assign(n, -1);
        prev.assign(n, -1);
        vector<bool> fin(n, false);
        priority_queue<tuple<T, int, int>, vector<tuple<T, int, int>>, greater<tuple<T, int, int>>> q;
        dist[start] = 0;
        q.emplace(0, start, -1);
        while (!q.empty()) {
            int cur = get<1>(q.top());
            int pre = get<2>(q.top());
            q.pop();
            if (fin[cur]) continue;
            fin[cur] = true;
            prev[cur] = pre;
            for (auto p : g[cur]) {
                int nex = p.first;
                int weight = p.second;
                if (dist[nex] == -1 or dist[nex] > dist[cur] + weight) {
                    dist[nex] = dist[cur] + weight;
                    q.emplace(dist[nex], nex, cur);
                }
            }
        }
    }

    vector<T> get_dist() {
        return dist;
    }

    T get_dist(int t) {
        return dist[t];
    }

    vector<int> get_route(int t) {
        vector<int> ret;
        if (dist[t] == -1) return ret;

        int cur = t;
        while (cur != -1) {
            ret.emplace_back(cur);
            cur = prev[cur];
        }
        reverse(ret.begin(), ret.end());
        return ret;
    }
};
#line 5 "verify/AizuOnlineJudge/graph/shortest-path/ALDS1_12_C.test.cpp"


int main() {
    cin.tie(0)->sync_with_stdio(0);

    int n;
    in(n);
    vector<vector<pair<int, lint>>> g(n);
    rep(i, n) {
        int u, k;
        in(u, k);
        rep(j, k) {
            int v, c;
            in(v, c);
            g[u].emplace_back(v, c);
        }
    }

    Dijkstra<lint> d(g);
    rep(i, n) {
        out(i, d.get_dist(i));
    }
}
Back to top page