#646092 (C++17) No.1473 おでぶなおばけさん

提出ソース

結果

問題	No.1473 おでぶなおばけさん
ユーザー	haruki_K
提出日時	2021-04-09 21:46:09
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	123 ms / 2,000 ms
コード長	7,692 bytes
コンパイル時間	2,692 ms
コンパイル使用メモリ	216,188 KB
実行使用メモリ	12,800 KB
最終ジャッジ日時	2024-06-25 04:53:14
合計ジャッジ時間	6,842 ms
ジャッジサーバーID （参考情報）	judge2 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,376 KB
testcase_02	AC	116 ms 12,160 KB
testcase_03	AC	85 ms 10,240 KB
testcase_04	AC	62 ms 8,320 KB
testcase_05	AC	23 ms 5,376 KB
testcase_06	AC	91 ms 10,240 KB
testcase_07	AC	123 ms 12,800 KB
testcase_08	AC	121 ms 12,800 KB
testcase_09	AC	123 ms 12,672 KB
testcase_10	AC	31 ms 5,632 KB
testcase_11	AC	31 ms 5,632 KB
testcase_12	AC	31 ms 5,504 KB
testcase_13	AC	20 ms 5,376 KB
testcase_14	AC	15 ms 5,376 KB
testcase_15	AC	27 ms 5,376 KB
testcase_16	AC	30 ms 5,632 KB
testcase_17	AC	4 ms 5,376 KB
testcase_18	AC	5 ms 5,376 KB
testcase_19	AC	30 ms 5,888 KB
testcase_20	AC	52 ms 9,344 KB
testcase_21	AC	53 ms 7,680 KB
testcase_22	AC	47 ms 11,392 KB
testcase_23	AC	39 ms 10,240 KB
testcase_24	AC	40 ms 10,112 KB
testcase_25	AC	78 ms 11,008 KB
testcase_26	AC	82 ms 11,136 KB
testcase_27	AC	28 ms 6,016 KB
testcase_28	AC	92 ms 12,544 KB
testcase_29	AC	54 ms 7,808 KB
testcase_30	AC	72 ms 8,448 KB
testcase_31	AC	90 ms 12,544 KB
testcase_32	AC	59 ms 10,240 KB
testcase_33	AC	54 ms 9,216 KB
testcase_34	AC	33 ms 6,528 KB
testcase_35	AC	27 ms 6,144 KB
testcase_36	AC	54 ms 8,448 KB
testcase_37	AC	60 ms 9,856 KB
testcase_38	AC	13 ms 5,376 KB
testcase_39	AC	31 ms 5,632 KB
testcase_40	AC	30 ms 5,504 KB
testcase_41	AC	28 ms 5,632 KB
testcase_42	AC	28 ms 5,504 KB
testcase_43	AC	43 ms 9,584 KB
testcase_44	AC	44 ms 9,712 KB
testcase_45	AC	43 ms 9,712 KB
testcase_46	AC	88 ms 9,600 KB
testcase_47	AC	108 ms 11,008 KB
testcase_48	AC	94 ms 10,368 KB

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

ソースコード

raw source code

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define repR(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i, n) for (int i = (int)(n); i >= 1; i--)
#define loop(i, a, B) for (int i = a; i B; i++)
#define loopR(i, a, B) for (int i = a; i B; i--)
#define all(x) begin(x), end(x)
#define allR(x) rbegin(x), rend(x)
#define rng(x, l, r) begin(x) + (l), begin(x) + (r)
#define pb push_back
#define eb emplace_back
#define fst first
#define snd second
template <class A, class B> constexpr auto mp(A &&a, B &&b) { return make_pair(forward<A>(a), forward<B>(b)); }
template <class... T> constexpr auto mt(T&&... x) { return make_tuple(forward<T>(x)...); }
template <class Int> auto constexpr inf_ = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf_<int32_t>;
auto constexpr INF64 = inf_<int64_t>;
auto constexpr INF   = inf_<int>;
#ifdef LOCAL
#include "debug.hpp"
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T, class Comp> struct pque : priority_queue<T, vector<T>, Comp> { vector<T> &data() { return this->c; } void clear() { this->c.clear(); } };
template <class T> using pque_max = pque<T, less<T>>;
template <class T> using pque_min = pque<T, greater<T>>;
template <class T, class = typename T::iterator, enable_if_t<!is_same<T, string>::value, int> = 0>
ostream& operator<<(ostream& os, T const& a) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, size_t N, enable_if_t<!is_same<T, char>::value, int> = 0>
ostream& operator<<(ostream& os, const T (&a)[N]) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = decltype(begin(declval<T&>())), class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &a) { for (auto& x : a) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T, S> const& p) { return os << p.first << " " << p.second; }
template <class T, class S> istream& operator>>(istream& is, pair<T, S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint { template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); } };
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T, d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T, d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T, 0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T, d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T, d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b, e, typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) { return lower_bound(begin(v), end(v), x)-begin(v); }
template <class C, class T> int ubd(C const& v, T const& x) { return upper_bound(begin(v), end(v), x)-begin(v); }
constexpr int64_t mod(int64_t x, int64_t m) { assert(m > 0); return (x %= m) < 0 ? x+m : x; }
constexpr int64_t div_floor(int64_t x, int64_t y) { assert(y != 0); return x/y - ((x^y) < 0 and x%y); }
constexpr int64_t div_ceil(int64_t x, int64_t y) { assert(y != 0); return x/y + ((x^y) > 0 and x%y); }
constexpr int dx[] = { 1, 0, -1, 0, 1, -1, -1, 1 };
constexpr int dy[] = { 0, 1, 0, -1, 1, 1, -1, -1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
mt19937_64 seed_{random_device{}()};
template <class Int> Int rand(Int a, Int b) { return uniform_int_distribution<Int>(a, b)(seed_); }
i64 irand(i64 a, i64 b) { return rand<i64>(a, b); } // [a, b]
u64 urand(u64 a, u64 b) { return rand<u64>(a, b); } //
template <class It> void shuffle(It l, It r) { shuffle(l, r, seed_); }
vector<int> &operator--(vector<int> &v) { for (int &x : v) --x; return v; }
vector<int> &operator++(vector<int> &v) { for (int &x : v) ++x; return v; }
// <<<
// >>> union find

struct UnionFind {
    int n, sz; // id : 0...n-1
    vector<int32_t> par;

    UnionFind(int n = 0) : n(n), sz(n), par(n, -1) { }
    void clear() {
        rep (i, n) par[i] = -1;
        sz = n;
    }
    int root(int x) {
        assert(0 <= x); assert(x < n);
        return par[x] < 0 ? x : par[x] = root(par[x]);
    }
    bool unite(int x, int y) {
        x = root(x), y = root(y);
        if (x == y) return false;
        sz--;
        if (par[x] < par[y]) swap(x, y);
        par[y] += par[x];
        par[x] = y;
        return true;
    }
    bool same(int x, int y) { return root(x) == root(y); }
    int size(int x) { return -par[root(x)]; }
    int size() const { return sz; }
    vector<vector<int>> groups() {
        vector<vector<int>> g(n);
        rep (i, n) if (par[i] < 0) g[i].reserve(-par[i]);
        rep (i, n) g[root(i)].push_back(i);
        vector<vector<int>> grp; grp.reserve(size());
        rep (i, n) if (g[i].size()) grp.emplace_back(move(g[i]));
        return grp;
    }
};

// <<<
// >>> bfs
#ifndef EDGE_INFO
#define EDGE_INFO
constexpr int dest(int v) { return v; }
template <class E, class = decltype(declval<E>().to)>
constexpr int dest(E const& e) { return e.to; }
constexpr int cost(int) { return 1; }
template <class E, class = decltype(declval<E>().cost)>
constexpr auto cost(E const& e) { return e.cost; }
template <class E> using cost_t = decltype(cost(declval<E>()));
#endif
template <class E>
vector<int> bfs(vector<vector<E>> const& g, int s, int inf) {
    vector<int> d(g.size(), inf);
    queue<int> q;
    d[s] = 0;
    q.push(s);
    while (q.size()) {
        int x = q.front(); q.pop();
        for (auto const& e : g[x]) {
            const int y = dest(e);
            if (chmin(d[y], d[x]+1)) q.push(y);
        }
    }
    return d;
}
// <<<

int32_t main() {
    int n, m; cin >> n >> m;
    vector<int> s(m), t(m), d(m);
    rep (i, m) cin >> s[i] >> t[i] >> d[i], --s[i], --t[i];

    auto check = [&](int w) {
        static UnionFind uf(n);
        uf.clear();
        rep (i, m) if (d[i] >= w) uf.unite(s[i], t[i]);
        return uf.same(0, n-1);
    };

    int l = 0, r = INF32;
    while (l+1 < r) {
        auto mid = (l+r)/2;
        (check(mid) ? l : r) = mid;
    }
    int w = l;
    cout << w << " ";

    vector<vector<int>> g(n);
    rep (i, m) if (d[i] >= w) {
        int x = s[i], y = t[i];
        g[x].eb(y);
        g[y].eb(x);
    }
    cout << bfs(g, 0, INF)[n-1] << '\n';

}

yukicoder

結果

テストケース

ソースコード