#774993 (C++17) No.1995 CHIKA Road

提出ソース

結果

問題	No.1995 CHIKA Road
ユーザー	iiljj
提出日時	2022-07-01 21:44:44
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	385 ms / 2,000 ms
コード長	16,182 bytes
コンパイル時間	2,247 ms
コンパイル使用メモリ	163,436 KB
実行使用メモリ	55,692 KB
最終ジャッジ日時	2024-05-04 16:04:17
合計ジャッジ時間	6,903 ms
ジャッジサーバーID （参考情報）	judge2 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	1 ms 5,376 KB
testcase_02	AC	1 ms 5,376 KB
testcase_03	AC	2 ms 5,376 KB
testcase_04	AC	2 ms 5,376 KB
testcase_05	AC	2 ms 5,376 KB
testcase_06	AC	14 ms 6,656 KB
testcase_07	AC	52 ms 13,936 KB
testcase_08	AC	2 ms 5,376 KB
testcase_09	AC	1 ms 5,376 KB
testcase_10	AC	57 ms 15,480 KB
testcase_11	AC	385 ms 55,692 KB
testcase_12	AC	188 ms 32,400 KB
testcase_13	AC	93 ms 20,940 KB
testcase_14	AC	99 ms 21,768 KB
testcase_15	AC	318 ms 49,384 KB
testcase_16	AC	24 ms 8,576 KB
testcase_17	AC	134 ms 24,992 KB
testcase_18	AC	251 ms 38,788 KB
testcase_19	AC	249 ms 39,004 KB
testcase_20	AC	108 ms 22,852 KB
testcase_21	AC	100 ms 21,228 KB
testcase_22	AC	237 ms 37,164 KB
testcase_23	AC	52 ms 14,080 KB
testcase_24	AC	192 ms 32,960 KB
testcase_25	AC	31 ms 9,464 KB
testcase_26	AC	64 ms 15,988 KB
testcase_27	AC	183 ms 32,076 KB
testcase_28	AC	102 ms 21,228 KB
testcase_29	AC	230 ms 37,980 KB
testcase_30	AC	27 ms 9,344 KB
testcase_31	AC	13 ms 6,144 KB
testcase_32	AC	36 ms 11,192 KB
testcase_33	AC	183 ms 31,528 KB
testcase_34	AC	16 ms 6,656 KB
testcase_35	AC	61 ms 15,268 KB
testcase_36	AC	73 ms 17,328 KB
testcase_37	AC	216 ms 35,344 KB
testcase_38	AC	135 ms 27,008 KB
testcase_39	AC	13 ms 6,036 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

/* #region Head */

// #include <bits/stdc++.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert> // assert.h
#include <cmath>   // math.h
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;

#define TREP(T, i, m, n) for (T i = (m), i##_len = (T)(n); i < i##_len; ++(i))
#define TREPM(T, i, m, n) for (T i = (m), i##_max = (T)(n); i <= i##_max; ++(i))
#define TREPR(T, i, m, n) for (T i = (m), i##_min = (T)(n); i >= i##_min; --(i))
#define TREPD(T, i, m, n, d) for (T i = (m), i##_len = (T)(n); i < i##_len; i += (d))
#define TREPMD(T, i, m, n, d) for (T i = (m), i##_max = (T)(n); i <= i##_max; i += (d))

#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define REPIR(itr, ds) for (auto itr = ds.rbegin(); itr != ds.rend(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define ISIZE(x) ((int)(x).size())
#define PERM(c)                                                                                                        \
    sort(ALL(c));                                                                                                      \
    for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());
#define CEIL(a, b) (((a) + (b)-1) / (b))

#define endl '\n'

constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr int IINF = 1'000'000'007LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
// constexpr ll MOD = 998244353;
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;

template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
    for (T &x : vec) is >> x;
    return is;
}
template <typename T> ostream &operator<<(ostream &os, const vc<T> &vec) { // vector 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}
template <typename T> ostream &operator>>(ostream &os, const vc<T> &vec) { // vector 出力 (inline)
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
    return os;
}

template <typename T, size_t _Nm> istream &operator>>(istream &is, array<T, _Nm> &arr) { // array 入力
    REP(i, 0, SIZE(arr)) is >> arr[i];
    return is;
}
template <typename T, size_t _Nm> ostream &operator<<(ostream &os, const array<T, _Nm> &arr) { // array 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(arr)) os << arr[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}

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

// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, const T &map_var) {
    os << "{";
    REPI(itr, map_var) {
        os << *itr;
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    return os << "}";
}
template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &map_var) {
    return out_iter(os, map_var);
}
template <typename T, typename U> ostream &operator<<(ostream &os, const um<T, U> &map_var) {
    os << "{";
    REPI(itr, map_var) {
        auto [key, value] = *itr;
        os << "(" << key << ", " << value << ")";
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    os << "}";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, const us<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, const pq<T> &pq_var) {
    pq<T> pq_cp(pq_var);
    os << "{";
    if (!pq_cp.empty()) {
        os << pq_cp.top(), pq_cp.pop();
        while (!pq_cp.empty()) os << ", " << pq_cp.top(), pq_cp.pop();
    }
    return os << "}";
}

// tuple 出力
template <size_t N = 0, bool end_line = false, typename... Args> ostream &operator<<(ostream &os, tuple<Args...> &a) {
    if constexpr (N < std::tuple_size_v<tuple<Args...>>) {
        os << get<N>(a);
        if constexpr (N + 1 < std::tuple_size_v<tuple<Args...>>) {
            os << ' ';
        } else if constexpr (end_line) {
            os << '\n';
        }
        return operator<< <N + 1, end_line>(os, a);
    }
    return os;
}
template <typename... Args> void print_tuple(tuple<Args...> &a) { operator<< <0, true>(cout, a); }

void pprint() { cout << endl; }
template <class Head, class... Tail> void pprint(Head &&head, Tail &&...tail) {
    cout << head;
    if (sizeof...(Tail) > 0) cout << ' ';
    pprint(move(tail)...);
}

// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&...tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) DUMPOUT << ", ";
    dump_func(move(tail)...);
}

// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {
    if (comp(xmax, x)) {
        xmax = x;
        return true;
    }
    return false;
}

// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {
    if (comp(x, xmin)) {
        xmin = x;
        return true;
    }
    return false;
}

// ローカル用
#ifndef ONLINE_JUDGE
#define DEBUG_
#endif

#ifndef MYLOCAL
#undef DEBUG_
#endif

#ifdef DEBUG_
#define DEB
#define dump(...)                                                                                                      \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                                                                    \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl                                        \
            << "    ",                                                                                                 \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

#define VAR(type, ...)                                                                                                 \
    type __VA_ARGS__;                                                                                                  \
    assert((cin >> __VA_ARGS__));

template <typename T> istream &operator,(istream &is, T &rhs) { return is >> rhs; }
template <typename T> ostream &operator,(ostream &os, const T &rhs) { return os << ' ' << rhs; }

struct AtCoderInitialize {
    static constexpr int IOS_PREC = 15;
    static constexpr bool AUTOFLUSH = false;
    AtCoderInitialize() {
        ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
        cout << fixed << setprecision(IOS_PREC);
        if (AUTOFLUSH) cout << unitbuf;
    }
} ATCODER_INITIALIZE;

void Yn(bool p) { cout << (p ? "Yes" : "No") << endl; }
void YN(bool p) { cout << (p ? "YES" : "NO") << endl; }

template <typename T> constexpr void operator--(vc<T> &v, int) noexcept {
    for (int i = 0; i < ISIZE(v); ++i) v[i]--;
}
template <typename T> constexpr void operator++(vc<T> &v, int) noexcept {
    for (int i = 0; i < ISIZE(v); ++i) v[i]++;
}

/* #endregion */

// #include <atcoder/all>
// using namespace atcoder;

/* #region Graph */

// エッジ（本来エッジは双方向だが，ここでは単方向で管理）
template <class weight_t = int, class flow_t = int> struct Edge {
    int src;         // エッジ始点となる頂点
    int dst;         // エッジ終点となる頂点
    weight_t weight; // 重み
    flow_t cap;
    Edge() : src(0), dst(0), weight(0) {}
    Edge(int src, int dst, weight_t weight) : src(src), dst(dst), weight(weight) {}
    Edge(int src, int dst, weight_t weight, flow_t cap) : src(src), dst(dst), weight(weight), cap(cap) {}
    // Edge 標準出力
    friend ostream &operator<<(ostream &os, Edge &edge) {
        os << "(" << edge.src << " -> " << edge.dst << ", " << edge.weight << ")";
        return os;
    }
};

// 同じ頂点を始点とするエッジ集合
template <class weight_t = int, class flow_t = int> class Node : public vc<Edge<weight_t, flow_t>> {
  public:
    int idx;
    Node() : vc<Edge<weight_t, flow_t>>() {}
    // void add(int a, int b, weight_t w, flow_t cap) { this->emplace_back(a, b, w, cap); };
};

// graph[i] := 頂点 i を始点とするエッジ集合
template <class weight_t = int, class flow_t = int> class Graph : public vc<Node<weight_t, flow_t>> {
  public:
    Graph() : vc<Node<weight_t, flow_t>>() {}
    Graph(int n) : vc<Node<weight_t, flow_t>>(n) { REP(i, 0, n)(*this)[i].idx = i; }
    /** 単方向 */
    void add_arc(int a, int b, weight_t w = 1, flow_t cap = 1) { (*this)[a].emplace_back(a, b, w, cap); }
    /** 双方向 */
    void add_edge(int a, int b, weight_t w = 1, flow_t cap = 1) { add_arc(a, b, w, cap), add_arc(b, a, w, cap); }
    /** ノード追加 */
    int add_node() {
        int idx = (int)this->size();
        this->emplace_back();
        Node<weight_t, flow_t> &node = this->back();
        node.idx = idx;
        return idx;
    }
};
// using Array = vc<Weight>;
// using Matrix = vc<Array>;

/* #endregion */

/* #region Dijkstra */
// ダイクストラ法
// グラフを陽に持つ
template <class Weight = ll> struct Dijkstra {
    // pair 比較よりも struct 比較のほうが速い
    struct state {
        Weight cost;
        int dst;
        state(Weight cost, int dst) : cost(cost), dst(dst) {}
        bool operator<(const state &o) const { return cost > o.cost; }
        // bool operator>(const state &o) const { return cost > o.cost; }
    };

    Graph<Weight> graph;
    vc<Weight> dist;
    vc<int> bs; // 経路復元用情報
    Weight inf;

    /** コンストラクタ */
    Dijkstra(const int n, const Weight inf = INF) : graph(n), dist(n, inf), bs(n, -1), inf(inf) {}
    /** コンストラクタ，グラフを使って初期化するバージョン */
    Dijkstra(const Graph<Weight> &graph, const Weight inf = INF)
        : graph(graph), dist(graph.size(), inf), bs(graph.size(), -1), inf(inf) {}

    // 有向辺の追加
    void add_edge(const int src, const int dst, const Weight cost) { graph.add_arc(src, dst, cost); }

    void build(const int start, const Weight init = 0) {
        priority_queue<state> que; // 昇順に並べ替え，小さい順に取り出す
        fill(ALL(dist), inf);
        fill(ALL(bs), -1);
        dist[start] = init;
        que.emplace(init, start);
        while (que.size()) {
            const state cur = que.top(); // tie(d, v) = que.top();
            que.pop();
            const int cur_node = cur.dst;
            const Weight cur_cost = cur.cost;

            if (dist[cur_node] < cur_cost) continue;
            for (const Edge<Weight> &edge : graph[cur_node])
                if (chmin(dist[edge.dst], dist[cur_node] + edge.weight)) {
                    que.emplace(dist[edge.dst], edge.dst);
                    bs[edge.dst] = cur_node;
                }
        }
    }

    // あるノードまでの距離を返す
    Weight operator[](const int dst) const { return dist[dst]; }

    // 経路復元
    // dst がスタート地点の場合は空ベクトルが返るため注意
    vc<int> restore(int dst) const {
        vc<int> res;
        if (bs[dst] < 0) return res;
        while (~dst) res.emplace_back(dst), dst = bs[dst];
        reverse(ALL(res));
        return res;
    }
};

/* #endregion */

/* #region CoordCompress1D */

// 1次元座圧
template <typename T = ll> class CoordCompress1D {
    map<T, ll> coord2zipped; // キーが座標値
    vc<T> zipped2coord;      // 各要素が座標値
    ll sz;
    T MAX, MIN;

  public:
    CoordCompress1D() {}
    CoordCompress1D(vc<T> coords, const T &MAX = INF, const T &MIN = -INF) : MAX(MAX), MIN(MIN) {
        sort(ALL(coords));
        UNIQ(coords);
        sz = SIZE(coords);
        zipped2coord = coords;
        REP(i, 0, sz) coord2zipped[coords[i]] = i;
    }
    // 座標の圧縮（コンストラクタに与えた座標限定）
    ll zip(const T &coord) const { return coord2zipped.at(coord); }
    T unzip(const ll &zipped) const { return zipped2coord.at(zipped); }

    // coord 以上の最小の座標値を返す．
    // 戻り値は圧縮前なので注意．入力も圧縮前．
    T coord_geq(const T &coord) const {
        auto it = lower_bound(ALL(zipped2coord), coord);
        if (it != zipped2coord.end()) return *it;
        return MAX;
    }

    // coord より大きいの最小の座標値を返す．
    // 戻り値は圧縮前なので注意．入力も圧縮前．
    T coord_gt(const T &coord) const {
        auto it = upper_bound(ALL(zipped2coord), coord);
        if (it != zipped2coord.end()) return *it;
        return MAX;
    }

    // coord 以下の最小の座標値を返す．
    // 戻り値は圧縮前なので注意．入力も圧縮前．
    T coord_leq(const T &coord) const {
        auto rit = lower_bound(zipped2coord.rbegin(), zipped2coord.rend(), coord,
                               [](ll const lhs, ll const rhs) { return lhs > rhs; });
        if (rit != zipped2coord.rend()) return *rit;
        return MIN;
    }

    // coord 未満の最小の座標値を返す．
    // 戻り値は圧縮前なので注意．入力も圧縮前．
    T coord_lt(const T &coord) const {
        auto rit = upper_bound(zipped2coord.rbegin(), zipped2coord.rend(), coord,
                               [](ll const lhs, ll const rhs) { return lhs > rhs; });
        if (rit != zipped2coord.rend()) return *rit;
        return MIN;
    }

    ll size() const { return sz; }
};

/* #endregion */

// Problem
void solve() {
    VAR(ll, n, m);
    vll a(m), b(m);
    REP(i, 0, m) cin >> a[i], b[i];
    a--, b--;

    vll towns;
    towns.push_back(0);
    towns.push_back(n - 1);
    REP(i, 0, m) {
        towns.push_back(a[i]);
        towns.push_back(b[i]);
    }
    sort(ALL(towns));
    UNIQ(towns);

    CoordCompress1D<> cc(towns);

    ll sz = cc.size();
    Dijkstra<ll> dijkstra(sz, INF);
    REP(i, 0, sz - 1) {
        ll cost = 2LL * (towns[i + 1] - towns[i]);
        dijkstra.add_edge(i, i + 1, cost);
        dijkstra.add_edge(i + 1, i, cost);
    }

    REP(i, 0, m) {
        ll from = cc.zip(a[i]);
        ll to = cc.zip(b[i]);
        ll cost = 2LL * b[i] - 2LL * a[i] - 1;
        dijkstra.add_edge(from, to, cost);
        dijkstra.add_edge(to, from, cost);
    }

    dijkstra.build(0);
    pprint(dijkstra[sz - 1]);
}

// entry point
int main() {
    solve();
    return 0;
}

yukicoder

結果

テストケース

ソースコード