#704269 (C++17) No.788 トラックの移動

提出ソース
結果

問題	No.788 トラックの移動
ユーザー	Konton7
提出日時	2021-10-02 11:45:02
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	722 ms / 2,000 ms
コード長	28,926 bytes
コンパイル時間	3,584 ms
コンパイル使用メモリ	253,180 KB
実行使用メモリ	35,308 KB
最終ジャッジ日時	2024-05-08 23:08:33
合計ジャッジ時間	8,608 ms
ジャッジサーバーID （参考情報）	judge5 / judge1
このコードへのチャレンジ
（要ログイン）
テストケース

テストケース表示
入力	結果	実行時間実行使用メモリ
testcase_00	AC	711 ms 35,176 KB
testcase_01	AC	2 ms 5,248 KB
testcase_02	AC	2 ms 5,376 KB
testcase_03	AC	2 ms 5,376 KB
testcase_04	AC	170 ms 11,392 KB
testcase_05	AC	698 ms 35,300 KB
testcase_06	AC	720 ms 35,308 KB
testcase_07	AC	2 ms 5,376 KB
testcase_08	AC	2 ms 5,376 KB
testcase_09	AC	2 ms 5,376 KB
testcase_10	AC	2 ms 5,376 KB
testcase_11	AC	2 ms 5,376 KB
testcase_12	AC	2 ms 5,376 KB
testcase_13	AC	2 ms 5,376 KB
testcase_14	AC	1 ms 5,376 KB
testcase_15	AC	344 ms 35,284 KB
testcase_16	AC	722 ms 35,300 KB
権限があれば一括ダウンロードができます
ソースコード

raw source code
#include <bits/stdc++.h>
// #include <set>
// #include <map>
// #include <cmath>
// #include <deque>
// #include <vector>
// #include <iostream>
// #include <algorithm>

using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
using VD = vector<double>;
using VS = vector<string>;
using VB = vector<bool>;
using VVB = vector<vector<bool>>;
using VVI = vector<VI>;
using VVL = vector<VL>;
using VVD = vector<VD>;
using VVVI = vector<VVI>;
using VVVL = vector<VVL>;
using VVVD = vector<VVD>;
using PII = std::pair<int, int>;
using VPII = std::vector<std::pair<int, int>>;
using PLL = std::pair<ll, ll>;
using VPLL = std::vector<std::pair<ll, ll>>;
using TI3 = std::tuple<int, int, int>;
using TI4 = std::tuple<int, int, int, int>;
using TL3 = std::tuple<ll, ll, ll>;
using TL4 = std::tuple<ll, ll, ll, ll>;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define repr2(i, g, n) for (int i = (int)(n)-1; i >= (g); i--)
#define rep3(i, s, n, d) for (int i = (s); i < (int)(n); i += (d))
#define repr3(i, g, n, d) for (int i = (int)(n)-1; i >= (g); i -= (d))
#define allpt(v) (v).begin(), (v).end()
#define allpt_c(v) (v).cbegin(), (v).cend()
#define allpt_r(v) (v).rbegin(), (v).rend()
#define allpt_cr(v) (v).crbegin(), (v).crend()

const int mod1 = 1e9 + 7, mod2 = 998244353, mod3 = 1e9 + 9;
const int mod = mod1;
const ll inf = 1e18;
const int infint = 1e9;
const vector<PII> adjust = { {1, 0}, {-1, 0}, {0, 1}, {0, -1} };

const string wsp = " ";
const string tb = "\t";
const string rt = "\n";
const string alphabets = "abcdefghijklmnopqrstuvwxyz";

template <typename T>
void show1dvec(const vector<T>& v)
{
    if (v.size() == 0)
        return;
    int n = v.size() - 1;
    rep(i, n) cout << v[i] << wsp;
    cout << v[n] << rt;
    return;
}

int get1dcoodinate(int w, int i, int j) { return i * w + j; }

template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v)
{
    if (v.size() == 0)
        return os;
    int n = (int)v.size() - 1;
    rep(i, n) os << v[i] << wsp;
    os << v[n] << rt;
    return os;
}

template <typename T>
istream& operator>>(istream& is, vector<T>& v)
{
    if (v.size() == 0)
        return is;
    int n = v.size();
    rep(i, n) is >> v[i];
    return is;
}

template <typename T>
ostream& operator<<(ostream& os, const vector<vector<T>>& v)
{
    if (v.size() == 0)
        return os;
    auto n = v.size();
    rep(i, n) os << v[i];
    return os;
}

template <typename T>
istream& operator>>(istream& is, vector<vector<T>>& v)
{
    if (v.size() == 0)
        return is;
    int n = v.size();
    rep(i, n) is >> v[i];
    return is;
}

template <typename T, typename S>
istream& operator>>(istream& is, pair<T, S>& p)
{
    is >> p.first >> p.second;
    return is;
}

template <typename T, typename S>
istream& operator>>(istream& is, vector<pair<T, S>>& v)
{
    if (v.size() == 0)
        return is;
    auto n = v.size();
    rep(i, n) is >> v[i].first >> v[i].second;
    return is;
}

template <typename T, typename S>
ostream& operator<<(ostream& os, const vector<pair<T, S>>& v)
{
    if (v.size() == 0)
        return os;
    auto n = v.size();
    rep(i, n) os << v[i].first << wsp << v[i].second << rt;
    return os;
}

void show2dvec(const vector<string>& v)
{
    int n = v.size();
    rep(i, n) cout << v[i] << rt;
}

template <typename T>
void show2dvec(const vector<vector<T>>& v)
{
    int n = v.size();
    rep(i, n) show1dvec(v[i]);
}

template <typename T>
void range_sort(vector<T>& arr, int l, int r)
{
    sort(arr.begin() + l, arr.begin() + r);
}

template <typename T, typename S>
void show1dpair(const vector<pair<T, S>>& v)
{
    int n = v.size();
    rep(i, n) cout << v[i].first << v[i].second << rt;
    return;
}

template <typename T, typename S>
void pairzip(const vector<pair<T, S>>& v, vector<T>& t, vector<T>& s)
{
    int n = v.size();
    rep(i, n)
    {
        t.push_back(v[i].first);
        s.push_back(v[i].second);
    }
    return;
}

template <typename T>
void maxvec(vector<T>& v)
{
    T s = v[0];
    int n = v.size();
    rep(i, n - 1)
    {
        if (s > v[i + 1])
        {
            v[i + 1] = s;
        }
        s = v[i + 1];
    }
}

template <typename T, typename S>
bool myfind(T t, S s)
{
    return find(t.cbegin(), t.cend(), s) != t.cend();
}

bool check(int y, int x, int h, int w)
{
    return 0 <= y && y < h && 0 <= x && x < w;
}

bool check(int y, int x, int h1, int h2, int w1, int w2)
{
    return h1 <= y && y < h2&& w1 <= x && x < w2;
}

bool iskadomatsu(int a, int b, int c)
{
    return (a != b && b != c && c != a) &&
        ((a > b && b < c) || (a < b&& b > c));
}

template <typename T>
bool iskadomatsu(vector<T> v)
{
    T a = v[0], b = v[1], c = v[2];
    return (a != b && b != c && c != a) &&
        ((a > b && b < c) || (a < b&& b > c));
}

double euc_dist(PII a, PII b)
{
    return sqrt(pow(a.first - b.first, 2) + pow(a.second - b.second, 2));
}

// VS split(string s, char c) {
//     VS ret;
//     string part;
//     s += c;
//     rep(i, s.length()) {
//         if (s[i] == c) {
//             if (part != "") ret.emplace_back(part);
//             part = "";
//         } else if (s[i] != c) {
//             part += s[i];
//         }
//     }
//     return ret;
// }

VS split(string s, char c, char d = ' ')
{
    VS ret;
    // reverse(allpt(s));
    string part;
    s += c;
    rep(i, s.length())
    {
        if (s[i] == c)
        {
            if (part != "")
            {
                // string t;
                // t += c;
                // ret.emplace_back(t);
                ret.emplace_back(part);
            }
            part = "";
        }
        else
        {
            part += s[i];
        }
    }
    return ret;
}

template <typename T, typename S, typename R>
ll pow_mod(T p, S q, R mod = 1ll)
{
    ll ret = 1, r = p;
    while (q)
    {
        if (q % 2)
            ret *= r, ret %= mod;
        r = (r * r) % mod, q /= 2;
    }
    return ret % mod;
}

template <typename T, typename S>
ll pow_no_mod(T p, S q)
{
    ll ret = 1, r = p;
    while (q)
    {
        if (q % 2)
            ret *= r;
        r = (r * r), q /= 2;
    }
    return ret;
}

void make_frac_tables(VL& frac_list, VL& frac_inv_list)
{
    rep(i, frac_list.size() - 1)
    {
        frac_list[i + 1] *= frac_list[i] * (i + 1);
        frac_list[i + 1] %= mod;
        frac_inv_list[i + 1] *= frac_inv_list[i] * pow_mod(i + 1, mod - 2, mod);
        frac_inv_list[i + 1] %= mod;
    }
}

pair<VL, VL> make_frac_tables(int n)
{
    VL frac_list(n + 1, 1), frac_inv_list(n + 1, 1);
    rep(i, n)
    {
        frac_list[i + 1] *= frac_list[i] * (i + 1);
        frac_list[i + 1] %= mod;
        frac_inv_list[i + 1] *= frac_inv_list[i] * pow_mod(i + 1, mod - 2, mod);
        frac_inv_list[i + 1] %= mod;
    }
    return make_pair(frac_list, frac_inv_list);
}

ll comb(int a, int b, const VL& frac_list, const VL& frac_inv_list)
{
    if (a < b)
        return 0;
    if (b < 0)
        return 0;
    ll ret = frac_list[a];
    ret *= frac_inv_list[b];
    ret %= mod;
    ret *= frac_inv_list[a - b];
    ret %= mod;
    return ret;
}

struct vec2d
{
    ll x;
    ll y;
    vec2d(ll _x, ll _y)
    {
        x = _x;
        y = _y;
    }
    ll dot(vec2d p) { return x * p.x + y * p.y; }
    vec2d diff(vec2d p) { return vec2d(x - p.x, y - p.y); }
};

struct node
{
    int parent = -1;
    ll weight = 0;
    int depth = -1;
    int degree = -1;
    int subtree = 1;
    int check = 0;
    int scc = -1;

    VPLL children;
    VI parent_list;
    VPLL connect;

    node()
    {
        parent = -1;
        weight = 0;
        depth = -1;
        degree = -1;
        subtree = 1;
        check = 0;

        children;
        parent_list;
        connect;
    }
};

struct graph
{
    int _n;
    int root = 0;
    vector<node> nodes;
    graph(int n)
    {
        _n = n;
        rep(i, _n) nodes.emplace_back(node());
    }
    void getconnect_nocost()
    {
        ll a, b;
        cin >> a >> b;
        nodes[a].connect.emplace_back(b, 1);
        nodes[b].connect.emplace_back(a, 1);
    }
    void getconnect()
    {
        ll a, b, c;
        cin >> a >> b >> c;
        nodes[a].connect.emplace_back(b, c);
        nodes[b].connect.emplace_back(a, c);
    }
    void getconnect_decri_nocost()
    {
        ll a, b;
        cin >> a >> b;
        a--, b--;
        nodes[a].connect.emplace_back(b, 1);
        nodes[b].connect.emplace_back(a, 1);
    }
    void getconnect_decri()
    {
        ll a, b, c;
        cin >> a >> b >> c;
        a--, b--;
        nodes[a].connect.emplace_back(b, c);
        nodes[b].connect.emplace_back(a, c);
    }
    void showparent()
    {
        rep(i, _n - 1) cout << nodes[i].parent << wsp;
        cout << nodes[_n - 1].parent << rt;
    }
    void showweight()
    {
        rep(i, _n - 1) cout << nodes[i].weight << wsp;
        cout << nodes[_n - 1].weight << rt;
    }
    void showsubtree()
    {
        rep(i, _n - 1) cout << nodes[i].subtree << wsp;
        cout << nodes[_n - 1].subtree << rt;
    }
    void showdepth()
    {
        rep(i, _n - 1) cout << nodes[i].depth << wsp;
        cout << nodes[_n - 1].depth << rt;
    }
};

struct point
{
    int x;
    int y;
    point()
    {
        x = 0;
        y = 0;
    }
    point(int _x, int _y)
    {
        x = _x;
        y = _y;
    }
    void pointinput()
    {
        int _x, _y;
        cin >> _x >> _y;
        x = _x;
        y = _y;
    }
    void pointinv() { swap(x, y); }
};

istream& operator>>(istream& is, point& p)
{
    is >> p.x >> p.y;
    return is;
}

ostream& operator<<(ostream& os, point& p)
{
    os << p.x << wsp << p.y << rt;
    return os;
}

double pointseuc(point a, point b)
{
    ll ax = a.x, bx = b.x, ay = a.y, by = b.y;
    return sqrt(pow(ax - bx, 2) + pow(ay - by, 2));
}

ll pointseucsquare(point a, point b)
{
    ll ax = a.x, bx = b.x, ay = a.y, by = b.y;
    return (ax - bx) * (ax - bx) + (ay - by) * (ay - by);
}

double getangle(point l, point m, point r) {
    const double pi = acos(-1);
    double ret;
    double dlmx, dlmy, drmx, drmy;
    dlmx = l.x - m.x;
    dlmy = l.y - m.y;
    drmx = r.x - m.x;
    drmy = r.y - m.y;
    ret = ((atan2(drmy, drmx) - atan2(dlmy, dlmx) + 2 * pi) * 180 / pi);
    ret /= 360;
    return ret;
}

double gettrianglearea(point a, point b, point c) {
    double ret;
    double dbax, dbay, dcbx, dcby;
    dbax = a.x - b.x;
    dbay = a.y - b.y;
    dcbx = c.x - b.x;
    dcby = c.y - b.y;
    ret = 0.5 * (dbay * dcbx - dbax * dcby);
    return ret;
}

ll gettrianglearea2(point a, point b, point c) {
    ll ret;
    ll dbax, dbay, dcbx, dcby;
    dbax = a.x - b.x;
    dbay = a.y - b.y;
    dcbx = c.x - b.x;
    dcby = c.y - b.y;
    ret = dbay * dcbx - dbax * dcby;
    return ret;
}

int relation_point_triangle(point ta, point tb, point tc, point p) {
    int ret{ 0 };
    auto sab = gettrianglearea2(ta, tb, p);
    auto sbc = gettrianglearea2(tb, tc, p);
    auto sca = gettrianglearea2(tc, ta, p);
    if (sab > 0 && sbc > 0 && sca > 0) ret = 2;
    else if (sab == 0 && sbc >= 0 && sca >= 0) ret = 1;
    else if (sab >= 0 && sbc == 0 && sca >= 0) ret = 1;
    else if (sab >= 0 && sbc >= 0 && sca == 0) ret = 1;
    return  ret;
}

int pointsmanhattan(point a, point b)
{
    return abs(a.x - b.x) + abs(a.y - b.y);
}

double dist_segment_point(TL3 segment, point p)
{
    double a = get<0>(segment);
    double b = get<1>(segment);
    double c = get<2>(segment);
    return abs(a * p.x + b * p.y - c) / (a * a + b * b + c * c);
}

TL3 segment_parameter(point p, point q)
{
    ll a, b, c;
    a = q.y - p.y;
    b = p.x - q.x;
    c = a * p.x + b * p.y;
    TL3 ret = (TL3){ a, b, c };
    // cout << a << b << c << rt;
    return ret;
}

int cross_check(TL3 segment, point p)
{
    ll a = get<0>(segment);
    ll b = get<1>(segment);
    ll c = get<2>(segment);

    auto f = a * p.x + b * p.y - c;
    int ret;
    if (f > 0)
        ret = 1;
    if (f == 0)
        ret = 0;
    if (f < 0)
        ret = -1;
    return ret;
}

bool cross_check(point a, point b, point c, point d)
{
    auto sabc = gettrianglearea2(a, b, c);
    auto sabd = gettrianglearea2(a, b, d);
    auto scda = gettrianglearea2(c, d, a);
    auto scdb = gettrianglearea2(c, d, b);
    cout << (VL) { sabc, sabd, scda, scdb };
    bool cond1 = (sabc > 0 && sabd < 0) || (sabc < 0 && sabd > 0);
    bool cond2 = (scda > 0 && scdb < 0) || (scda < 0 && scdb > 0);
    return cond1 && cond2;
}

struct circle {
    point p;
    ll radius_2;
};

int circlecross(circle c1, circle c2) {
    int ret{ 2 };
    ll d = pointseucsquare(c1.p, c2.p);
    if (d > (c1.radius_2 + c2.radius_2) * (c1.radius_2 + c2.radius_2)) ret = 4;
    else if (d == (c1.radius_2 + c2.radius_2) * (c1.radius_2 + c2.radius_2)) ret = 3;
    else if (d == (c1.radius_2 - c2.radius_2) * (c1.radius_2 - c2.radius_2)) ret = 1;
    else if (d < (c1.radius_2 - c2.radius_2) * (c1.radius_2 - c2.radius_2)) ret = 0;
    return ret;
}

struct polygon {
    int _n;
    vector<point> vp;
    polygon(int n) {
        _n = n;
        vp.resize(_n);
    }
    vector<point> getsettriangle() {
        vector<point> ret;
        return ret;
    }
    double getarea() {
        if (_n < 3) return 0.0;
        double ret{ 0.0 };
        rep2(i, 1, _n - 1) {
            ret += gettrianglearea(vp[0], vp[i], vp[i + 1]);
        }
        return ret;
    }
    bool isconvex() {
        if (_n < 3) return false;
        bool ret{ true };
        rep(i, _n) ret &= gettrianglearea(vp[i], vp[(i + 1) % _n], vp[(i + 2) % _n]) >= 0;
        return ret;
    }
    int relation_polygon_triangle(point p) {

        rep(i, _n) {
            auto v1 = vp[i];
            auto v2 = vp[(i + 1) % _n];
            auto [v1x, v1y] = v1;
            auto [v2x, v2y] = v2;
            bool pointisonline = gettrianglearea2(v1, v2, p) == 0;
            bool pointisinsegmentrange = min(v1x, v2x) <= p.x && p.x <= max(v1x, v2x) && min(v1y, v2y) <= p.y && p.y <= max(v1y, v2y);
            // cout << (VI) {v1x, v1y, v2x, v2y} << gettrianglearea2(v1, v2, p) << wsp << (VB) { pointisonline, pointisinsegmentrange };
            if (pointisonline && pointisinsegmentrange) {
                return 1;
            }
        }
        return 0;
    }
};


VI shave(int n)
{
    VI v;
    if (n <= 1)
        return v;
    vector<bool> w(n + 1, true);
    int x;
    w[0] = w[1] = false;
    rep2(i, 2, n + 1)
    {
        if (w[i])
        {
            x = i * 2;
            while (x <= n)
            {
                w[x] = false;
                x += i;
            }
        }
    }
    rep(i, n + 1) if (w[i]) v.emplace_back(i);
    return v;
}

void shave(vector<int>& v, int n)
{
    if (n <= 1)
        return;
    vector<bool> w(n + 1, true);
    int x;
    w[0] = w[1] = false;
    rep2(i, 2, n + 1)
    {
        if (w[i])
        {
            x = i * 2;
            while (x <= n)
            {
                w[x] = false;
                x += i;
            }
        }
    }
    rep(i, n + 1) if (w[i]) v.emplace_back(i);
}

template <typename T>
void coordinate_compress(vector<T>& x, map<T, int>& zip, int& xs)
{
    sort(x.begin(), x.end());
    x.erase(unique(x.begin(), x.end()), x.end());
    xs = x.size();
    for (int i = 0; i < xs; i++)
    {
        zip[x[i]] = i;
    }
}

// ll getpalindrome(int l, int r, const string &s, VL &memo) {
//     if (r - l <= 1) return 1;
//     if (memo[l] != -1) return memo[l];
//     ll ret{1};
//     int n = (r - l) / 2;
//     string sl, sr;
//     rep(i, n) {
//         sl += s[l + i];
//         sr += s[r - 1 - i];
//         string rsr(i + 1, '0');
//         reverse_copy(allpt_c(sr), rsr.begin());
//         // cout << sl << wsp << sr << wsp << rsr << rt;
//         if (sl == rsr) {
//             ret += getpalindrome(l + i + 1, r - i - 1, s, memo);
//             ret %= mod;
//         }
//     }
//     memo[l] = ret;
//     return ret;
// }

void getpalindrome(int l, int r, int n, const string& s, VVB& memo)
{
    if (r - l <= 1 || s[l] == s[r - 1])
    {
        memo[l][r] = true;
        if (l > 0 && r < n)
        {
            getpalindrome(l - 1, r + 1, n, s, memo);
        }
    }
    return;
}

// void djcstra(graph graphs, int s, int t) {
//     const int n = graphs._n;
//     VL shortest(n, inf);
//     shortest[s] = 0;
//     priority_queue<pair<ll, int>> pq;
//     pq.push(make_pair(0, s));
//     while (!pq.empty()) {
//         auto [t, v] = pq.top();
//         pq.pop();
//         t = -t;
//         if (shortest[v] != t) continue;
//         for (auto [u, c] : graphs.nodes[v].connect) {
//             if (t + c < shortest[u]) {
//                 shortest[u] = t + c;
//                 pq.push(make_pair(-(t + c), u));
//             }
//         }
//     }
// }


class Unionfind
{
    vector<int> p;

public:
    Unionfind(int n)
    {
        for (int i = 0; i < n; i++)
        {
            p.push_back(i);
        }
    }
    int find(int x)
    {
        while (p[x] != x)
        {
            p[x] = p[p[x]];
            x = p[x];
        }
        return x;
    }
    int getval(int x) { return p[x]; }
    void unite(int x, int y)
    {
        x = find(x);
        y = find(y);
        if (x != y)
        {
            p[x] = y;
        }
    }

    bool isunion(int x, int y) { return find(x) == find(y); }
    void showtree() { cout << p; }
};

template <typename T>
class RangeMinorMaxorSumQuery // 0-index
{
    int const intmax = 2147483647;
    int const intmin = 0;
    vector<T> sgt;
    int n;
    int k;

public:
    RangeMinorMaxorSumQuery(int n1, T f = -1)
    {
        if (f == -1)
            f = intmax;
        else if (f == 0)
            f = intmin;
        int na = 1;
        int ka = 0;
        while (na < n1)
        {
            na *= 2;
            ka++;
        }
        for (int i = 0; i < 2 * na; i++)
            sgt.push_back(f);
        n = na;
        k = ka;
    }

    void update_min(int i, int x)
    {
        i += n;
        sgt[i] = x;
        while (i > 1)
        {
            i /= 2;
            sgt[i] = min(sgt[2 * i], sgt[2 * i + 1]);
        }
    }
    void update_max(int i, T x)
    {
        i += n;
        sgt[i] = x;
        while (i > 1)
        {
            i /= 2;
            sgt[i] = max(sgt[2 * i], sgt[2 * i + 1]);
        }
    }
    void update_sum(int i, T x)
    {
        i += n;
        sgt[i] = x;
        while (i > 1)
        {
            i /= 2;
            sgt[i] = sgt[2 * i] + sgt[2 * i + 1];
        }
    }
    void update_sum_with_mod(int i, T x)
    {
        i += n;
        sgt[i] = x;
        while (i > 1)
        {
            i /= 2;
            sgt[i] = sgt[2 * i] + sgt[2 * i + 1];
            sgt[i] %= mod;
        }
    }

    void add_sum(int i, T x)
    {
        i += n;
        sgt[i] += x;
        while (i > 1)
        {
            i /= 2;
            sgt[i] = sgt[2 * i] + sgt[2 * i + 1];
        }
    }
    void add_sum_with_mod(int i, T x)
    {
        i += n;
        sgt[i] += x;
        sgt[i] %= mod;
        while (i > 1)
        {
            i /= 2;
            sgt[i] = sgt[2 * i] + sgt[2 * i + 1];
            sgt[i] %= mod;
        }
    }
    void add_min(int i, T x)
    {
        i += n;
        sgt[i] += x;
        while (i > 1)
        {
            i /= 2;
            sgt[i] = min(sgt[2 * i], sgt[2 * i + 1]);
        }
    }

    void add_max(int i, T x)
    {
        i += n;
        sgt[i] += x;
        while (i > 1)
        {
            i /= 2;
            sgt[i] = max(sgt[2 * i], sgt[2 * i + 1]);
        }
    }

    T get_min(int a, int b, int k = 1, int l = 0,
        int r = -1) //閉区間 l <= x < r とする
    {
        if (r == -1)
            r = n;
        if (r <= a || b <= l)
            return intmax;
        if (a == l && b == r)
            return sgt[k];
        else
            return min(
                get_min(a, min(b, (l + r) / 2), 2 * k, l, (l + r) / 2),
                get_min(max(a, (l + r) / 2), b, 2 * k + 1, (l + r) / 2, r));
    }
    T get_max(int a, int b, int k = 1, int l = 0,
        int r = -1) //閉区間 l <= x < r とする
    {
        if (r == -1)
            r = n;
        if (r <= a || b <= l)
            return intmin;
        if (a == l && b == r)
            return sgt[k];
        else
            return max(
                get_max(a, min(b, (l + r) / 2), 2 * k, l, (l + r) / 2),
                get_max(max(a, (l + r) / 2), b, 2 * k + 1, (l + r) / 2, r));
    }
    T get_sum(int a, int b, int k = 1, int l = 0,
        int r = -1) //閉区間 l <= x < r とする
    {
        if (r == -1)
            r = n;
        if (r <= a || b <= l)
            return intmin;
        if (a == l && b == r)
            return sgt[k];
        else
            return get_sum(a, min(b, (l + r) / 2), 2 * k, l, (l + r) / 2) +
            get_sum(max(a, (l + r) / 2), b, 2 * k + 1, (l + r) / 2, r);
    }
    T get_sum_with_mod(int a, int b, int k = 1, int l = 0,
        int r = -1) //閉区間 l <= x < r とする
    {
        if (r == -1)
            r = n;
        if (r <= a || b <= l)
            return intmin;
        if (a == l && b == r)
            return sgt[k];
        else
            return (get_sum_with_mod(a, min(b, (l + r) / 2), 2 * k, l, (l + r) / 2) +
                get_sum_with_mod(max(a, (l + r) / 2), b, 2 * k + 1, (l + r) / 2, r)) % mod;
    }

    T operator[](int i) { return sgt[i + n]; }

    void printsegtree()
    {
        for (int i = 0; i < 2 * n; i++)
        {
            cout << sgt[i] << " ";
        }
        cout << endl;
    }
};


template <typename T>
class Bit_Index_Tree // 1-index

{
    int n = 0;
    vector<T> v;

public:
    Bit_Index_Tree(int _n, T x = 0)
    {
        n = _n;
        v.resize(n + 1);
        fill(allpt(v), x);
    }
    Bit_Index_Tree(vector<T> _v)
    {
        n = _v.size();
        v = _v;
    }
    void add(int i, T x)
    {
        while (i <= n)
        {
            v[i] += x;
            i += i & -i;
        }
    }
    T get_sum(int i)
    {
        T ret = 0;
        while (i > 0)
        {
            ret += v[i];
            i -= i & -i;
        }
        return ret;
    }
    T get_range_sum(int l, int r)
    { // 半開区間　l <= x < r
        return get_sum(r) - get_sum(l);
    }
};



VI smallest_prime_factors(int n)
{
    VI ret(n + 1);
    iota(allpt(ret), 0);
    for (int i = 2; i * i <= n; i++)
    {
        if (ret[i] == i)
        {
            for (int j = i * i; j <= n; j += i)
            {
                if (ret[j] == j)
                    ret[j] = i;
            }
        }
    }
    return ret;
}


class Matrix_n
{
    int matsize;
    VVL mat;

public:
    Matrix_n();
    Matrix_n(int n);
    Matrix_n(int n, const VVL& inmat);

    void showmat();
    void identify();
    ll getone(const int& i, const int& j);
    int getsize();
    const Matrix_n operator+(const Matrix_n& b);
    const Matrix_n operator-(const Matrix_n& b);
    const Matrix_n operator*(const Matrix_n& b);
    Matrix_n& operator+=(const Matrix_n& b);
    Matrix_n& operator-=(const Matrix_n& b);
    const Matrix_n operator+();
    const Matrix_n operator-();
    const Matrix_n operator%(const int& b);
    Matrix_n& operator%=(const int& b);


};

Matrix_n::Matrix_n()
{
    matsize = 0;
    VVL mat;
}

Matrix_n::Matrix_n(int n)
{
    matsize = n;
    mat.resize(n);
    rep(i, n) rep(j, n) mat[i].emplace_back(0);
}

Matrix_n::Matrix_n(int n, const VVL& inmat)
{
    matsize = n;
    mat.resize(n);
    rep(i, n)
    {
        mat[i].resize(n);
        rep(j, n) { mat[i][j] = inmat[i][j]; }
    }
}

void Matrix_n::identify()
{
    rep(i, matsize) rep(j, matsize) { mat[i][j] = i == j ? 1 : 0; }
}

ll Matrix_n::getone(const int& i, const int& j) { return mat[i][j]; }

int Matrix_n::getsize() { return matsize; }

const Matrix_n Matrix_n::operator+(const Matrix_n& b)
{
    Matrix_n ret(matsize);
    rep(i, matsize) rep(j, matsize) { ret.mat[i][j] = mat[i][j] + b.mat[i][j]; }
    return ret;
}

const Matrix_n Matrix_n::operator-(const Matrix_n& b)
{
    Matrix_n ret(matsize);
    rep(i, matsize) rep(j, matsize) { ret.mat[i][j] = mat[i][j] - b.mat[i][j]; }
    return ret;
}

const Matrix_n Matrix_n::operator*(const Matrix_n& b)
{
    Matrix_n ret(matsize);
    rep(i, matsize) rep(j, matsize) rep(k, matsize)
    {
        ret.mat[i][j] += mat[i][k] * b.mat[k][j];
        ret.mat[i][j] %= mod;
    }
    return ret;
}

const Matrix_n Matrix_n::operator%(const int& b)
{
    Matrix_n ret(matsize);
    rep(i, matsize) rep(j, matsize) { ret.mat[i][j] = mat[i][j] % b; }
    return ret;
}

const Matrix_n Matrix_n::operator+() { return *this; }

const Matrix_n Matrix_n::operator-()
{
    Matrix_n ret(matsize);
    rep(i, matsize) rep(j, matsize) { ret.mat[i][j] = -mat[i][j]; }
    return ret;
}

Matrix_n& Matrix_n::operator+=(const Matrix_n& b)
{
    rep(i, matsize) rep(j, matsize) { mat[i][j] += b.mat[i][j]; }
    return *this;
}

Matrix_n& Matrix_n::operator-=(const Matrix_n& b)
{
    rep(i, matsize) rep(j, matsize) { mat[i][j] -= b.mat[i][j]; }
    return *this;
}

Matrix_n& Matrix_n::operator%=(const int& b)
{
    rep(i, matsize) rep(j, matsize) { mat[i][j] %= b; }
    return *this;
}

Matrix_n mat_pow_mod(Matrix_n a, ll p, ll m = mod)
{
    const int n = a.getsize();
    Matrix_n b(n);
    b.identify();

    while (p > 0)
    {
        if (p % 2)
        {
            b = b * a;
            b %= m;
        }
        p /= 2;
        a = a * a;
        a %= m;
    }
    return b;
}

void Matrix_n::showmat() { cout << mat; }


class Unionfind_with_Weight
{
    vector<int> p;
    vector<ll> q;

public:
    Unionfind_with_Weight(int n)
    {
        for (int i = 0; i < n; i++)
        {
            p.push_back(i);
            q.push_back(1);
        }
    }
    Unionfind_with_Weight(VL v)
    {
        const int n = v.size();
        for (int i = 0; i < n; i++)
        {
            p.push_back(i);
            q.push_back(v[i]);
        }
    }
    int find(int x)
    {
        while (p[x] != x)
        {
            p[x] = p[p[x]];
            q[x] = q[p[x]];
            x = p[x];
        }
        return x;
    }
    int getval(int x) { return p[find(x)]; }
    ll getweight(int x) { return q[find(x)]; }
    void unite(int x, int y)
    {
        x = find(x);
        y = find(y);
        if (x != y)
        {
            p[x] = y;
            q[y] += q[x];
            q[x] += q[y];
        }
    }

    bool isunion(int x, int y) { return find(x) == find(y); }
    void showtree() { cout << p << q; }
};

VL getinv(VI num) {
    const int n = num.size();
    RangeMinorMaxorSumQuery<ll> sgt(n + 2, 0);
    VL ret(n);
    rep(i, n) {
        ret[i] = sgt.get_sum(num[i] + 1, n + 2);
        sgt.add_sum(num[i], 1);
    }
    rep(i, n - 1) ret[i + 1] += ret[i];
    return ret;
}

VL djcstra(graph graphs, int s) {
    const int n = graphs._n;
    VL shortest(n, inf);
    shortest[s] = 0;
    priority_queue<pair<ll, int>> pq;
    pq.push(make_pair(0, s));
    while (!pq.empty()) {
        auto [t, v] = pq.top();
        pq.pop();
        t = -t;
        if (shortest[v] != t) continue;
        for (auto [u, c] : graphs.nodes[v].connect) {
            if (t + c < shortest[u]) {
                shortest[u] = t + c;
                pq.push(make_pair(-(t + c), u));
            }
        }
    }
    return shortest;
}


int main()
{
    // cin.tie(0);
    // ios::sync_with_stdio(false);
    // リアクティブ問題のときはコメントアウト

// #define DEBUG

#ifdef DEBUG
    cout << "DEBUG MODE" << endl;
    // ifstream in("input.txt");                             // for debug
    // cin.rdbuf(in.rdbuf());                                // for debug
    chrono::system_clock::time_point timestart, timeend; // for debug
    timestart = std::chrono::system_clock::now();        // for debug

#endif

    int n, m, l;
    cin >> n >> m >> l;
    --l;
    VL tracks(n), basic_cost(n, 0), ans_list(n);
    VVL shortest(n);
    cin >> tracks;
    graph city(n);
    rep(i, m) city.getconnect_decri();
    rep(i, n) shortest[i] = djcstra(city, i);

    rep(i, n) rep(j, n) basic_cost[i] += 2 * shortest[i][j] * tracks[j];
    rep(i, n) {
        ans_list[i] = basic_cost[i];
        rep(j, n) if (tracks[j]) {
            auto d = shortest[l][j] - shortest[i][j];
            ans_list[i] = min(ans_list[i], basic_cost[i] + d);
        }
    }
    // cout << shortest << basic_cost << ans_list;
    cout << *min_element(allpt_c(ans_list)) << rt;






#ifdef DEBUG
    timeend = chrono::system_clock::now();
    auto elapsed =
        chrono::duration_cast<chrono::milliseconds>(timeend - timestart)
        .count();
    cout << "Time is " << elapsed << "ms" << std::endl;
#endif

    return 0;
}
yukicoder

結果

テストケース

ソースコード
