Language: C++

#include <bits/stdc++.h>
using namespace std;

void solve(long long x_s, long long y_s, long long x_t, long long y_t,
           long long N, std::vector<long long> x, std::vector<long long> y,
           std::vector<long long> r) {}

// Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You
// use the default template now. You can remove this line by using your custom
// template)
int main() {
  long long x_s;
  scanf("%lld", &x_s);#include <bits/stdc++.h>
#include <stdio.h>
#include <iostream>
#include <cstdio>
#include <bitset>
#include <algorithm>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <string.h>
#include <cmath>
#include <utility>
#include <functional>
#include <map>
#include <set>
#include <cctype>
#include <fstream>
#include <numeric>
#include <iomanip>
#include <cstring>
using namespace std;
using ll = long long;
#define ALL(a) (a).begin(), (a).end()

#define FOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (long long int i = (a); i >= (b); i--)

//#define MOD 1000000007
//const int MOD = 1000000007;
const int MOD = 998244353;

#define LLONG_MAXs 9223372036854775800 / 2
//#define bit(n, k) ((n >> k) & 1) /*nのk bit目*/
#define ALL(a) (a).begin(), (a).end()

#include <iostream>
#include <cmath>
using namespace std;

bool isPrimeNum(ll x)
{ // 素数である場合 true を返す
    if (x <= 1)
    { // 1以下である場合は素数でないことがすぐにわかる
        return false;
    }
    // sqrt( double型 ) は引数の平方根を double型で返すので、int型でキャスト
    int n = (int)sqrt((double)x);
    for (int i = 2; i <= n; i++)
    {
        if (x % i == 0)
        { // 割り切る整数がある場合、即判定終了
            return false;
        }
    }
    return true; // 割り切る整数がない場合、素数である
}

ll myPow(ll x, ll n, ll m)
{
    if (n == 0)
        return 1;
    if (n % 2 == 0)
        return myPow(x * x % m, n / 2, m);
    else
        return x * myPow(x, n - 1, m) % m;
}

constexpr ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
constexpr ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
constexpr ll abs(ll a, ll b)
{
    if (a >= b)
        return a - b;
    if (a < b)
        return b - a;
}
constexpr double dabs(double a, double b)
{
    if (a >= b)
        return a - b;
    if (a < b)
        return b - a;
}
constexpr ll min(ll a, ll b)
{
    if (a >= b)
        return b;
    if (a < b)
        return a;
}

constexpr ll max(ll a, ll b)
{
    if (a >= b)
        return a;
    if (a < b)
        return b;
}
constexpr double maxd(double a, double b)
{
    if (a >= b)
        return a;
    if (a < b)
        return b;
}

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

int dx8[8] = {1, 0, -1, 0, 1, -1, 1, -1};
int dy8[8] = {0, 1, 0, -1, 1, 1, -1, -1};

class UnionFind
{
public:
    //親の番号を格納する。親だった場合は-(その集合のサイズ)
    vector<int> Parent;

    //作るときはParentの値を全て-1にする
    //こうすると全てバラバラになる
    UnionFind(int N)
    {
        Parent = vector<int>(N, -1);
    }

    //Aがどのグループに属しているか調べる
    int root(int A)
    {
        if (Parent[A] < 0)
            return A;
        return Parent[A] = root(Parent[A]);
    }

    //自分のいるグループの頂点数を調べる
    int size(int A)
    {
        return -Parent[root(A)]; //親をとってきたい]
    }
    bool issame(int x, int y)
    {
        return root(x) == root(y);
    }
    //AとBをくっ付ける
    bool connect(int A, int B)
    {
        //AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける
        A = root(A);
        B = root(B);
        if (A == B)
        {
            //すでにくっついてるからくっ付けない
            return false;
        }

        //大きい方(A)に小さいほう(B)をくっ付けたい
        //大小が逆だったらひっくり返しちゃう。
        if (size(A) < size(B))
            swap(A, B);

        //Aのサイズを更新する
        Parent[A] += Parent[B];
        //Bの親をAに変更する
        Parent[B] = A;

        return true;
    }
};

long long fac[510000], finv[510000], inv[510000];

// テーブルを作る前処理
void COMinit()
{
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < 510000; i++)
    {
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}

// 二項係数計算
long long COM(int n, int k)
{
    if (n < k)
        return 0;
    if (n < 0 || k < 0)
        return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}

long long modinv(long long a, long long m)
{
    long long b = m, u = 1, v = 0;
    while (b)
    {
        long long t = a / b;
        a -= t * b;
        swap(a, b);
        u -= t * v;
        swap(u, v);
    }
    u %= m;
    if (u < 0)
        u += m;
    return u;
}

void yn(bool flag)
{
    if (flag)
    {
        cout << "Yes" << endl;
    }
    else
    {
        cout << "No" << endl;
    }
    return;
}
void YN(bool flag)
{
    if (flag)
    {
        cout << "YES" << endl;
    }
    else
    {
        cout << "NO" << endl;
    }
    return;
}

std::vector<ll> enum_div(ll n) //nの約数を列挙
{
    std::vector<ll> ret;
    for (ll i = 1; i * i <= n; ++i)
    {
        if (n % i == 0)
        {
            ret.push_back(i);
            if (i != 1 && i * i != n)
            {
                ret.push_back(n / i);
            }
        }
    }
    ret.push_back(n);
    return ret;
}

// modint: mod 計算を int を扱うように扱える構造体
template <int MOD>
struct Fp
{
    long long val;
    constexpr Fp(long long v = 0) noexcept : val(v % MOD)
    {
        if (val < 0)
            val += MOD;
    }
    constexpr int getmod() { return MOD; }
    constexpr Fp operator-() const noexcept
    {
        return val ? MOD - val : 0;
    }
    constexpr Fp operator+(const Fp &r) const noexcept { return Fp(*this) += r; }
    constexpr Fp operator-(const Fp &r) const noexcept { return Fp(*this) -= r; }
    constexpr Fp operator*(const Fp &r) const noexcept { return Fp(*this) *= r; }
    constexpr Fp operator/(const Fp &r) const noexcept { return Fp(*this) /= r; }
    constexpr Fp &operator+=(const Fp &r) noexcept
    {
        val += r.val;
        if (val >= MOD)
            val -= MOD;
        return *this;
    }
    constexpr Fp &operator-=(const Fp &r) noexcept
    {
        val -= r.val;
        if (val < 0)
            val += MOD;
        return *this;
    }
    constexpr Fp &operator*=(const Fp &r) noexcept
    {
        val = val * r.val % MOD;
        return *this;
    }
    constexpr Fp &operator/=(const Fp &r) noexcept
    {
        long long a = r.val, b = MOD, u = 1, v = 0;
        while (b)
        {
            long long t = a / b;
            a -= t * b;
            swap(a, b);
            u -= t * v;
            swap(u, v);
        }
        val = val * u % MOD;
        if (val < 0)
            val += MOD;
        return *this;
    }
    constexpr bool operator==(const Fp &r) const noexcept
    {
        return this->val == r.val;
    }
    constexpr bool operator!=(const Fp &r) const noexcept
    {
        return this->val != r.val;
    }
    friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept
    {
        return os << x.val;
    }
    friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept
    {
        if (n == 0)
            return 1;
        auto t = modpow(a, n / 2);
        t = t * t;
        if (n & 1)
            t = t * a;
        return t;
    }
};

using mint = Fp<MOD>;

// グラフセット
struct Edge
{
    ll to;         // 辺の行き先
    double weight; // 辺の重み
    Edge(int t, double w) : to(t), weight(w) {}
};
//using Graph = vector<vector<Edge>>;
#define def 0
template <class V, int NV>
struct SegTree
{ //[l,r)
    V comp(V &l, V &r) { return max(l, r); };

    vector<V> val;
    SegTree() { val = vector<V>(NV * 2, def); }
    V get(int x, int y, int l = 0, int r = NV, int k = 1)
    {
        if (r <= x || y <= l)
            return def;
        if (x <= l && r <= y)
            return val[k];
        auto a = get(x, y, l, (l + r) / 2, k * 2);
        auto b = get(x, y, (l + r) / 2, r, k * 2 + 1);
        return comp(a, b);
    }
    void update(int i, V v)
    {
        i += NV;
        val[i] = v;
        while (i > 1)
            i >>= 1, val[i] = comp(val[i * 2], val[i * 2 + 1]);
    }
    void add(int i, V v) { update(i, val[i + NV] + v); }
    V operator[](int x) { return get(x, x + 1); }
};

typedef vector<vector<long long>> matrix;
matrix mul_mod(matrix A, matrix B)
{
    int H = A.size();
    int W = B[0].size();
    int K = A[0].size();

    matrix C(H, vector<ll>(W, 0));
    for (int i = 0; i < H; i++)
    {
        for (int j = 0; j < W; j++)
        {
            for (int k = 0; k < K; k++)
            {
                C[i][j] += A[i][k] * B[k][j];
                C[i][j] %= MOD;
            }
        }
    }
    return C;
}
matrix pow_mod_matrix(matrix A, ll p)
{
    matrix ret = matrix(A.size(), vector<long long>(A.size(), 0));
    for (int i = 0; i < A.size(); i++)
        ret[i][i] = 1;

    while (p > 0)
    {
        if (p & 1)
            ret = mul_mod(ret, A);
        A = mul_mod(A, A);
        p >>= 1;
    }
    return ret;
}
// 区間加算にも対応した BIT
template <class Abel>
struct BIT
{
    vector<Abel> dat[2];
    Abel UNITY_SUM = 0; // to be set

    /* [1, n] */
    BIT(int n) { init(n); }
    void init(int n)
    {
        for (int iter = 0; iter < 2; ++iter)
            dat[iter].assign(n + 1, UNITY_SUM);
    }

    /* a, b are 1-indexed, [a, b) */
    inline void sub_add(int p, int a, Abel x)
    {
        for (int i = a; i < (int)dat[p].size(); i += i & -i)
            dat[p][i] = dat[p][i] + x;
    }
    inline void add(int a, int b, Abel x)
    {
        sub_add(0, a, x * -(a - 1));
        sub_add(1, a, x);
        sub_add(0, b, x * (b - 1));
        sub_add(1, b, x * (-1));
    }

    /* a is 1-indexed, [a, b) */
    inline Abel sub_sum(int p, int a)
    {
        Abel res = UNITY_SUM;
        for (int i = a; i > 0; i -= i & -i)
            res = res + dat[p][i];
        return res;
    }
    inline Abel sum(int a, int b)
    {
        return sub_sum(0, b - 1) + sub_sum(1, b - 1) * (b - 1) - sub_sum(0, a - 1) - sub_sum(1, a - 1) * (a - 1);
    }

    /* debug */
    void print()
    {
        for (int i = 1; i < (int)dat[0].size(); ++i)
            cout << sum(i, i + 1) << ",";
        cout << endl;
    }
};
//cout << std::setprecision(30) << ans << endl;
using Graph = vector<vector<Edge>>;

string solve(string S)
{
    string T = S;
    string s1, s2, s3;
    if (S.find("(") != string::npos)
    {
        reverse(T.begin(), T.end());
        return S + T;
    }
}

int main()
{
    cout << std::setprecision(30);
    ;
    ll xs, xg, ys, yg;
    cin >> xs >> ys >> xg >> yg;

    ll N;
    cin >> N;

    Graph G(N + 2);
    ll x[N], y[N], r[N];
    FOR(i, 0, N - 1)
    {
        cin >> x[i] >> y[i] >> r[i];
    }

    FOR(i, 0, N - 1)
    {
        G[N].push_back(Edge(i, maxd(0, -r[i] + sqrt((xs - x[i]) * (xs - x[i]) + (ys - y[i]) * (ys - y[i])))));
        G[i].push_back(Edge(N + 1, maxd(0, -r[i] + sqrt((xg - x[i]) * (xg - x[i]) + (yg - y[i]) * (yg - y[i])))));
        //cout << i << endl;
        //cout << "N-i " << maxd(0, -r[i] + sqrt((xs - x[i]) * (xs - x[i]) + (ys - y[i]) * (ys - y[i]))) << endl;
        //cout << "i-N+1 " << maxd(0, -r[i] + sqrt((xg - x[i]) * (xg - x[i]) + (yg - y[i]) * (yg - y[i]))) << endl;
        FOR(j, 0, N - 1)
        {
            if (i == j)
                continue;
            G[i].push_back(Edge(j, maxd(0, -r[i] - r[j] + sqrt((x[j] - x[i]) * (x[j] - x[i]) + (y[j] - y[i]) * (y[j] - y[i])))));
            //cout << "i-j " << maxd(0, -r[i] - r[j] + sqrt((x[j] - x[i]) * (x[j] - x[i]) + (y[j] - y[i]) * (y[j] - y[i]))) << endl;
        }
    };
    using P = pair<double, ll>;
    vector<double> dis(N + 2);

    FOR(i, 0, N + 1)
    {
        dis[i] = 999999999;
    }

    priority_queue<P, vector<P>, greater<P>> pq; // 「仮の最短距離, 頂点」が小さい順に並ぶ
    dis[N] = 0;
    pq.emplace(dis[N], N);
    while (!pq.empty())
    {
        P p = pq.top();
        pq.pop();
        int v = p.second;
        //cout << v << dis[v] << p.first << endl;
        if (dis[v] < p.first)
        { // 最短距離で無ければ無視
            continue;
        }
        for (auto &e : G[v])
        {
            cout << "disto " << dis[e.to] << " " << dis[v] << " " << e.weight << endl;
            if (dis[e.to] > dis[v] + e.weight)
            { // 最短距離候補なら priority_queue に追加
                dis[e.to] = dis[v] + e.weight;
                pq.emplace(dis[e.to], e.to);
            }
        }
    }

    cout << dis[N + 1] << endl;

    return 0;
}

  long long y_s;
  scanf("%lld", &y_s);
  long long x_t;
  scanf("%lld", &x_t);
  long long y_t;
  scanf("%lld", &y_t);
  long long N;
  scanf("%lld", &N);
  std::vector<long long> x(N);
  std::vector<long long> y(N);
  std::vector<long long> r(N);
  for (int i = 0; i < N; i++) {
    scanf("%lld", &x[i]);
    scanf("%lld", &y[i]);
    scanf("%lld", &r[i]);
  }
  solve(x_s, y_s, x_t, y_t, N, std::move(x), std::move(y), std::move(r));
  return 0;
}


Compiler output:
a.cc:13:23: error: stray '#' in program
   13 |   scanf("%lld", &x_s);#include <bits/stdc++.h>
      |                       ^
a.cc: In function 'int main()':
a.cc:13:24: error: 'include' was not declared in this scope
   13 |   scanf("%lld", &x_s);#include <bits/stdc++.h>
      |                        ^~~~~~~
a.cc:13:33: error: 'bits' was not declared in this scope
   13 |   scanf("%lld", &x_s);#include <bits/stdc++.h>
      |                                 ^~~~
a.cc:13:38: error: 'stdc' was not declared in this scope; did you mean 'std'?
   13 |   scanf("%lld", &x_s);#include <bits/stdc++.h>
      |                                      ^~~~
      |                                      std
a.cc:35:1: error: expected primary-expression before 'using'
   35 | using namespace std;
      | ^~~~~
a.cc:55:1: error: a function-definition is not allowed here before '{' token
   55 | { // 素数である場合 true を返す
      | ^
a.cc:73:1: error: a function-definition is not allowed here before '{' token
   73 | {
      | ^
a.cc:82:30: error: a function-definition is not allowed here before '{' token
   82 | constexpr ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
      |                              ^
a.cc:83:30: error: a function-definition is not allowed here before '{' token
   83 | constexpr ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
      |                              ^
a.cc:85:1: error: a function-definition is not allowed here before '{' token
   85 | {
      | ^
a.cc:92:1: error: a function-definition is not allowed here before '{' token
   92 | {
      | ^
a.cc:99:1: error: a function-definition is not allowed here before '{' token
   99 | {
      | ^
a.cc:107:1: error: a function-definition is not allowed here before '{' token
  107 | {
      | ^
a.cc:114:1: error: a function-definition is not allowed here before '{' token
  114 | {
      | ^
a.cc:187:1: error: a function-definition is not allowed here before '{' token
  187 | {
      | ^
a.cc:201:1: error: a function-definition is not allowed here before '{' token
  201 | {
      | ^
a.cc:210:1: error: a function-definition is not allowed here before '{' token
  210 | {
      | ^
a.cc:227:1: error: a function-definition is not allowed here before '{' token
  227 | {
      | ^
a.cc:239:1: error: a function-definition is not allowed here before '{' token
  239 | {
      | ^
a.cc:252:1: error: a function-definition is not allowed here before '{' token
  252 | {
      | ^
a.cc:270:1: error: a template declaration cannot appear at block scope
  270 | template <int MOD>
      | ^~~~~~~~
a.cc:347:14: error: 'Fp' does not name a type
  347 | using mint = Fp<MOD>;
      |              ^~
a.cc:358:1: error: a template declaration cannot appear at block scope
  358 | template <class V, int NV>
      | ^~~~~~~~
a.cc:388:1: error: a function-definition is not allowed here before '{' token
  388 | {
      | ^
a.cc:408:1: error: a function-definition is not allowed here before '{' token
  408 | {
      | ^
a.cc:423:1: error: a template declaration cannot appear at block scope
  423 | template <class Abel>
      | ^~~~~~~~
a.cc:476:1: error: a function-definition is not allowed here before '{' token
  476 | {
      | ^
a.cc:486:9: warning: empty parentheses were disambiguated as a function declaration [-Wvexing-parse]
  486 | int main()
      |         ^~
a.cc:486:9: note: remove parentheses to default-initialize a variable
  486 | int main()
      |         ^~
      |         --
a.cc:486:9: note: or replace parentheses with braces to value-initialize a variable
a.cc:487:1: error: a function-definition is not allowed here before '{' token
  487 | {
      | ^