Problem p03866 (C++)

Buggy submission (status: Runtime Error):
#include <bits/stdc++.h>
#include <random>

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define int ll
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;

#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for (int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cerr << (#x) << " = " << (x) << endl;

#ifdef RUS_HOME
#define cerr cout
#else
#define cerr                                                                   \
  if (false)                                                                   \
  cerr
#endif

const double PI = 2 * acos(0.0);
#define rand shittttty_shit
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());

const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";

template <class T0, class T1>
inline ostream &operator<<(ostream &out, pair<T0, T1> &a) {
  return out << "{" << a.first << ", " << a.second << "}";
}

template <class T0, class T1>
inline istream &operator>>(istream &in, pair<T0, T1> &a) {
  return in >> a.first >> a.second;
}

template <class T0, class T1, class T2>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2> &a) {
  return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a)
             << "}";
}

template <class T0, class T1, class T2, class T3>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2, T3> &a) {
  return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a)
             << ", " << get<3>(a) << "}";
}

template <class T> inline ostream &operator<<(ostream &out, vector<T> &a) {
  out << "[";
  fori(i, a.size()) out << a[i]
                        << vector<string>{", ", "]  "}[i + 1 == a.size()];
  return out;
}

void smain();

signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
#ifdef RUS_HOME
  freopen("input", "r", stdin);
  // freopen("output.txt", "w", stdout);
  clock_t start = clock();
#else
  //("input.txt", "r", stdin);
  // freopen("output.txt", "w", stdout);
#endif
  cout << setprecision(12) << fixed;
  smain();
#ifdef RUS_HOME
  cout << "\n\n\n\nTOTAL EXECUTION TIME: "
       << float(clock() - start) / CLOCKS_PER_SEC << endl;
#endif
  return 0;
}

const int MOD = 1e9 + 7, N = 101, oo = 1e9 + 10, A = 26, M = 3e5 + 100,
          K = 5e5 + 100;

ld a[N][N];
int n;

void kek(int v) {
  vld dist(n + 1, 1e18);
  vector<bool> us(n + 1);
  dist[v] = 0;
  for (int i = 0; i <= n; i++) {
    ld mx = 1e18;
    int k;
    for (int j = 0; j <= n; j++) {
      if (!us[j] && dist[j] < mx) {
        mx = dist[j];
        k = j;
      }
    }
    us[k] = true;
    for (int j = 0; j <= n; j++) {
      if (!us[j]) {
        inmin(dist[j], dist[k] + a[j][k]);
      }
    }
  }

  cout << dist[n];
}

void smain() {

  int sx, sy, fx, fy;
  cin >> sx >> sy >> fx >> fy >> n;
  vi x(n + 2), y(n + 2), r(n + 2);
  for (int i = 1; i <= n; i++) {
    cin >> x[i] >> y[i] >> r[i];
  }
  x[0] = sx;
  y[0] = sy;
  x[n + 1] = fx;
  y[n + 1] = fy;
  n++;

  for (int i = 0; i <= n; i++) {
    for (int j = 0; j <= n; j++) {
      a[i][j] =
          sqrt((x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j])) -
          r[i] - r[j];
      inmax(a[i][j], (ld)0);
    }
  }

  kek(0);
}


Fixed submission:
#include <bits/stdc++.h>
#include <random>

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define int ll
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;

#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for (int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cerr << (#x) << " = " << (x) << endl;

#ifdef RUS_HOME
#define cerr cout
#else
#define cerr                                                                   \
  if (false)                                                                   \
  cerr
#endif

const double PI = 2 * acos(0.0);
#define rand shittttty_shit
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());

const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";

template <class T0, class T1>
inline ostream &operator<<(ostream &out, pair<T0, T1> &a) {
  return out << "{" << a.first << ", " << a.second << "}";
}

template <class T0, class T1>
inline istream &operator>>(istream &in, pair<T0, T1> &a) {
  return in >> a.first >> a.second;
}

template <class T0, class T1, class T2>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2> &a) {
  return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a)
             << "}";
}

template <class T0, class T1, class T2, class T3>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2, T3> &a) {
  return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a)
             << ", " << get<3>(a) << "}";
}

template <class T> inline ostream &operator<<(ostream &out, vector<T> &a) {
  out << "[";
  fori(i, a.size()) out << a[i]
                        << vector<string>{", ", "]  "}[i + 1 == a.size()];
  return out;
}

void smain();

signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
#ifdef RUS_HOME
  freopen("input", "r", stdin);
  // freopen("output.txt", "w", stdout);
  clock_t start = clock();
#else
  //("input.txt", "r", stdin);
  // freopen("output.txt", "w", stdout);
#endif
  cout << setprecision(12) << fixed;
  smain();
#ifdef RUS_HOME
  cout << "\n\n\n\nTOTAL EXECUTION TIME: "
       << float(clock() - start) / CLOCKS_PER_SEC << endl;
#endif
  return 0;
}

const int MOD = 1e9 + 7, N = 1010, oo = 1e9 + 10, A = 26, M = 3e5 + 100,
          K = 5e5 + 100;

ld a[N][N];
int n;

void kek(int v) {
  vld dist(n + 1, 1e18);
  vector<bool> us(n + 1);
  dist[v] = 0;
  for (int i = 0; i <= n; i++) {
    ld mx = 1e18;
    int k;
    for (int j = 0; j <= n; j++) {
      if (!us[j] && dist[j] < mx) {
        mx = dist[j];
        k = j;
      }
    }
    us[k] = true;
    for (int j = 0; j <= n; j++) {
      if (!us[j]) {
        inmin(dist[j], dist[k] + a[j][k]);
      }
    }
  }

  cout << dist[n];
}

void smain() {

  int sx, sy, fx, fy;
  cin >> sx >> sy >> fx >> fy >> n;
  vi x(n + 2), y(n + 2), r(n + 2);
  for (int i = 1; i <= n; i++) {
    cin >> x[i] >> y[i] >> r[i];
  }
  x[0] = sx;
  y[0] = sy;
  x[n + 1] = fx;
  y[n + 1] = fy;
  n++;

  for (int i = 0; i <= n; i++) {
    for (int j = 0; j <= n; j++) {
      a[i][j] =
          sqrt((x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j])) -
          r[i] - r[j];
      inmax(a[i][j], (ld)0);
    }
  }

  kek(0);
}