結果

問題 No.1473 おでぶなおばけさん
ユーザー rniyarniya
提出日時 2021-04-09 21:45:31
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 155 ms / 2,000 ms
コード長 6,810 bytes
コンパイル時間 2,413 ms
コンパイル使用メモリ 217,920 KB
実行使用メモリ 21,732 KB
最終ジャッジ日時 2023-09-07 10:39:44
合計ジャッジ時間 8,373 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 147 ms
20,772 KB
testcase_03 AC 102 ms
17,844 KB
testcase_04 AC 67 ms
12,832 KB
testcase_05 AC 21 ms
6,580 KB
testcase_06 AC 118 ms
18,588 KB
testcase_07 AC 153 ms
21,732 KB
testcase_08 AC 155 ms
21,480 KB
testcase_09 AC 155 ms
21,520 KB
testcase_10 AC 95 ms
14,408 KB
testcase_11 AC 90 ms
14,436 KB
testcase_12 AC 93 ms
14,372 KB
testcase_13 AC 53 ms
10,784 KB
testcase_14 AC 36 ms
8,620 KB
testcase_15 AC 83 ms
13,564 KB
testcase_16 AC 90 ms
14,196 KB
testcase_17 AC 6 ms
4,380 KB
testcase_18 AC 9 ms
4,744 KB
testcase_19 AC 40 ms
5,940 KB
testcase_20 AC 53 ms
9,372 KB
testcase_21 AC 56 ms
7,712 KB
testcase_22 AC 51 ms
10,232 KB
testcase_23 AC 42 ms
9,408 KB
testcase_24 AC 42 ms
9,040 KB
testcase_25 AC 55 ms
10,004 KB
testcase_26 AC 58 ms
9,940 KB
testcase_27 AC 20 ms
5,288 KB
testcase_28 AC 61 ms
11,216 KB
testcase_29 AC 35 ms
6,536 KB
testcase_30 AC 42 ms
6,940 KB
testcase_31 AC 102 ms
21,228 KB
testcase_32 AC 77 ms
18,836 KB
testcase_33 AC 66 ms
16,156 KB
testcase_34 AC 35 ms
10,240 KB
testcase_35 AC 36 ms
10,452 KB
testcase_36 AC 39 ms
7,364 KB
testcase_37 AC 44 ms
8,784 KB
testcase_38 AC 9 ms
4,380 KB
testcase_39 AC 95 ms
14,472 KB
testcase_40 AC 94 ms
14,364 KB
testcase_41 AC 91 ms
14,372 KB
testcase_42 AC 89 ms
14,304 KB
testcase_43 AC 75 ms
18,920 KB
testcase_44 AC 75 ms
18,784 KB
testcase_45 AC 74 ms
18,748 KB
testcase_46 AC 106 ms
16,180 KB
testcase_47 AC 131 ms
18,848 KB
testcase_48 AC 110 ms
17,252 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(), (x).end()

template <typename T> istream& operator>>(istream& is, vector<T>& v) {
    for (T& x : v) is >> x;
    return is;
}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <typename T, typename U, typename V> ostream& operator<<(ostream& os, const tuple<T, U, V>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';
    return os;
}
template <typename T, typename U, typename V, typename W> ostream& operator<<(ostream& os, const tuple<T, U, V, W>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}

void debug_out() { cerr << '\n'; }
template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {
    cerr << head;
    if (sizeof...(Tail) > 0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...)                                                                   \
    cerr << " ";                                                                     \
    cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \
    cerr << " ";                                                                     \
    debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }

template <class T1, class T2> inline bool chmin(T1& a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T1, class T2> inline bool chmax(T1& a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
#pragma endregion

/**
 * @brief UnionFind
 * @docs docs/datastructure/UnionFind.md
 */
struct UnionFind {
    int num;
    vector<int> par, rank;
    UnionFind(int n) : num(n), par(n), rank(n, 1) { iota(par.begin(), par.end(), 0); }
    int root(int x) { return (par[x] == x ? x : par[x] = root(par[x])); }
    bool merge(int x, int y) {
        x = root(x);
        y = root(y);
        if (x == y) return false;
        if (rank[x] < rank[y]) swap(x, y);
        par[y] = x;
        rank[x] += rank[y];
        num--;
        return true;
    }
    bool same(int x, int y) { return root(x) == root(y); }
    int size(int x) { return rank[root(x)]; }
    int count() { return num; }
    int operator[](int x) { return root(x); }
};

/**
 * @brief Dijkstra
 * @docs docs/graph/Dijkstra.md
 */
template <typename T> struct Dijkstra {
    struct edge {
        int to;
        T cost;
        edge(int to, T cost) : to(to), cost(cost) {}
        bool operator<(const edge& e) const { return cost > e.cost; }
    };
    vector<vector<edge>> G;
    vector<T> dp;
    vector<int> pre;
    Dijkstra(int n) : G(n), dp(n), pre(n) {}
    void add_edge(int u, int v, T c) { G[u].emplace_back(v, c); }
    void build(int s) {
        int n = G.size();
        fill(dp.begin(), dp.end(), numeric_limits<T>::max());
        fill(pre.begin(), pre.end(), -1);
        priority_queue<edge> pq;
        dp[s] = 0;
        pq.emplace(s, dp[s]);
        while (!pq.empty()) {
            auto p = pq.top();
            pq.pop();
            int v = p.to;
            if (dp[v] < p.cost) continue;
            for (auto e : G[v]) {
                if (dp[v] + e.cost < dp[e.to]) {
                    dp[e.to] = dp[v] + e.cost;
                    pre[e.to] = v;
                    pq.emplace(e.to, dp[e.to]);
                }
            }
        }
    }
    vector<int> restore(int t) {
        vector<int> res;
        if (pre[t] < 0) return res;
        while (~t) {
            res.emplace_back(t);
            t = pre[t];
        }
        reverse(res.begin(), res.end());
        return res;
    }
    T operator[](int to) { return dp[to]; }
};

const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'D', 'R', 'U', 'L'};
const long long MOD = 1000000007;
// const long long MOD = 998244353;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n, m;
    cin >> n >> m;
    map<int, vector<pair<int, int>>> mp;
    for (int i = 0; i < m; i++) {
        int s, t, d;
        cin >> s >> t >> d;
        mp[-d].emplace_back(--s, --t);
    }

    Dijkstra<int> D(n);
    UnionFind UF(n);
    int ans = -1;
    for (auto& p : mp) {
        for (auto& e : p.second) {
            int u = e.first, v = e.second;
            UF.merge(u, v);
            D.add_edge(u, v, 1);
            D.add_edge(v, u, 1);
        }
        if (UF.same(0, n - 1)) {
            ans = p.first;
            break;
        }
    }

    D.build(0);
    cout << -ans << ' ';
    cout << D[n - 1] << '\n';
    return 0;
}
0