結果

問題 No.1473 おでぶなおばけさん
ユーザー r1933r1933
提出日時 2021-04-09 22:00:33
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 175 ms / 2,000 ms
コード長 6,452 bytes
コンパイル時間 2,497 ms
コンパイル使用メモリ 220,188 KB
実行使用メモリ 13,012 KB
最終ジャッジ日時 2023-09-07 11:15:51
合計ジャッジ時間 8,138 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 128 ms
12,824 KB
testcase_03 AC 79 ms
11,780 KB
testcase_04 AC 77 ms
8,328 KB
testcase_05 AC 33 ms
5,200 KB
testcase_06 AC 135 ms
12,464 KB
testcase_07 AC 117 ms
12,820 KB
testcase_08 AC 175 ms
12,864 KB
testcase_09 AC 100 ms
13,012 KB
testcase_10 AC 42 ms
9,464 KB
testcase_11 AC 42 ms
11,188 KB
testcase_12 AC 39 ms
10,444 KB
testcase_13 AC 24 ms
7,716 KB
testcase_14 AC 19 ms
6,408 KB
testcase_15 AC 36 ms
9,628 KB
testcase_16 AC 37 ms
8,504 KB
testcase_17 AC 4 ms
4,384 KB
testcase_18 AC 6 ms
4,380 KB
testcase_19 AC 44 ms
9,216 KB
testcase_20 AC 63 ms
10,652 KB
testcase_21 AC 85 ms
11,452 KB
testcase_22 AC 60 ms
12,100 KB
testcase_23 AC 47 ms
10,524 KB
testcase_24 AC 48 ms
10,752 KB
testcase_25 AC 121 ms
11,936 KB
testcase_26 AC 121 ms
12,376 KB
testcase_27 AC 33 ms
7,228 KB
testcase_28 AC 119 ms
12,760 KB
testcase_29 AC 86 ms
10,916 KB
testcase_30 AC 113 ms
12,340 KB
testcase_31 AC 91 ms
12,816 KB
testcase_32 AC 85 ms
12,732 KB
testcase_33 AC 68 ms
10,904 KB
testcase_34 AC 35 ms
7,152 KB
testcase_35 AC 37 ms
7,896 KB
testcase_36 AC 70 ms
10,008 KB
testcase_37 AC 82 ms
10,164 KB
testcase_38 AC 17 ms
4,812 KB
testcase_39 AC 36 ms
8,616 KB
testcase_40 AC 35 ms
8,552 KB
testcase_41 AC 42 ms
8,656 KB
testcase_42 AC 41 ms
8,732 KB
testcase_43 AC 46 ms
10,672 KB
testcase_44 AC 47 ms
10,484 KB
testcase_45 AC 46 ms
10,596 KB
testcase_46 AC 63 ms
10,196 KB
testcase_47 AC 80 ms
11,772 KB
testcase_48 AC 84 ms
10,988 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("Ofast")
#include "bits/stdc++.h"

// Begin Header {{{
#pragma region
using namespace std;

#ifndef DEBUG
#define dump(...)
#endif

#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); i < i##_limit; ++i)
#define repc(i, b, e) for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i)
#define repr(i, b, e) for (intmax_t i = (b), i##_limit = (e); i >= i##_limit; --i)
#define var(Type, ...) Type __VA_ARGS__; input(__VA_ARGS__)
#define let const auto

constexpr size_t    operator""_zu(unsigned long long value) { return value; };
constexpr intmax_t  operator""_jd(unsigned long long value) { return value; };
constexpr uintmax_t operator""_ju(unsigned long long value) { return value; };

constexpr int INF = 0x3f3f3f3f;
constexpr intmax_t LINF = 0x3f3f3f3f3f3f3f3f_jd;

using usize = size_t;
using imax = intmax_t;
using uimax = uintmax_t;
using ld = long double;

template <class T, class Compare = less<>>
using MaxHeap = priority_queue<T, vector<T>, Compare>;
template <class T, class Compare = greater<>>
using MinHeap = priority_queue<T, vector<T>, Compare>;

inline void input() {}
template <class Head, class... Tail>
inline void input(Head&& head, Tail&&... tail) {
    cin >> head;
    input(forward<Tail>(tail)...);
}

template <class Container, class Value = typename Container::value_type,
enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>
inline istream& operator>>(istream &is, Container &vs) {
    for (auto &v: vs) is >> v;
    return is;
}

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

inline void output() { cout << "\n"; }
template <class Head, class... Tail>
inline void output(Head&& head, Tail&&... tail) {
    cout << head;
    if (sizeof...(tail)) cout << " ";
    output(forward<Tail>(tail)...);
}

template <class Container, class Value = typename Container::value_type,
enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>
inline ostream& operator<<(ostream &os, const Container &vs) {
    static constexpr const char *delim[] = {" ", ""};
    for (auto it = begin(vs); it != end(vs); ++it) {
        os << delim[it == begin(vs)] << *it;
    }
    return os;
}

template <class Iterator>
inline void join(const Iterator &Begin, const Iterator &End, const string &delim = "\n", const string &last = "\n") {
    for (auto it = Begin; it != End; ++it) {
        cout << ((it == Begin) ? "" : delim) << *it;
    }
    cout << last;
}

template <class T>
inline vector<T> makeVector(const T &init_value, size_t sz) {
    return vector<T>(sz, init_value);
}

template <class T, class... Args>
inline auto makeVector(const T &init_value, size_t sz, Args... args) {
    return vector<decltype(makeVector<T>(init_value, args...))>(sz, makeVector<T>(init_value, args...));
}

template <class Func>
class FixPoint : Func {
public:
    explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {}

    template <class... Args>
    constexpr decltype(auto) operator()(Args&&... args) const {
        return Func::operator()(*this, std::forward<Args>(args)...);
    }
};

template <class Func>
static inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept {
    return FixPoint<Func>{forward<Func>(f)};
}

template <class Container>
struct reverse_t {
    Container &c;
    reverse_t(Container &c) : c(c) {}
    auto begin() { return c.rbegin(); }
    auto end() { return c.rend(); }
};

template <class Container>
auto reversed(Container &c) {
    return reverse_t<Container>(c);
}

template <class T>
inline bool chmax(T &a, const T &b) noexcept {
    return b > a && (a = b, true);
}

template <class T>
inline bool chmin(T &a, const T &b) noexcept {
    return b < a && (a = b, true);
}

template <class T>
inline T diff(const T &a, const T &b) noexcept {
    return a < b ? b - a : a - b;
}

void operator|=(vector<bool>::reference lhs, const bool rhs) {
    lhs = lhs | rhs;
}

void operator&=(vector<bool>::reference lhs, const bool rhs) {
    lhs = lhs & rhs;
}

void operator^=(vector<bool>::reference lhs, const bool rhs) {
    lhs = lhs ^ rhs;
}

void ioinit() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
    clog << fixed << setprecision(10);
}
#pragma endregion
// }}} End Header

// Edge {{{
template <class Weight>
struct Edge {
    size_t from, to;
    Weight weight;

    Edge() {}
    Edge(size_t from, size_t to, Weight weight = 1) :
        from(from), to(to), weight(weight)
    {}

    bool operator<(const Edge &rhs) const {
        return weight < rhs.weight;
    }

    bool operator>(const Edge &rhs) const {
        return weight > rhs.weight;
    }

    operator size_t() const {
        return to;
    }
};
// }}}

// Graph {{{
template <class Weight>
class Graph : public vector<vector<Edge<Weight>>> {
    using graph = vector<vector<Edge<Weight>>>;

public:
    Graph() {}
    Graph(const size_t V) : graph(V) {}

    void connect(size_t from, size_t to, Weight weight = 1) {
        (*this)[from].emplace_back(from, to, weight);
    }

    friend ostream& operator<<(ostream &strm, const Graph &G) {
        for (size_t v = 0; v < G.size(); ++v) {
            strm << '[' << setw(2) << v << ']';
            for (const auto &e: G[v]) {
                strm << ' ' << setw(2) << e.to;
            }
            strm << '\n';
        }
        return strm;
    }
};
// }}}

int main() {
    ioinit();

    var(usize, N, M);

    Graph<imax> G(N);
    rep(_, 0, M) {
        var(usize, s, t);
        var(imax, d);
        s--, t--;
        G.connect(s, t, d);
        G.connect(t, s, d);
    }

    const auto f = [&](imax w) {
        queue<usize> que;
        que.emplace(0);

        vector<imax> dp(N, LINF);
        dp[0] = 0;

        while (!que.empty()) {
            let cur = que.front();
            que.pop();
            for (let e: G[cur]) {
                if (w > e.weight) continue;
                if (chmin(dp[e.to], dp[cur] + 1)) {
                    que.emplace(e.to);
                }
            }
        }

        return dp.back();
    };

    imax ok = 0, ng = LINF;
    while (ng - ok > 1) {
        imax mid = (ok + ng) / 2;
        if (f(mid) != LINF) ok = mid;
        else ng = mid;
    }

    output(ok, f(ok));
    return 0;
}
0