結果
問題 | No.1473 おでぶなおばけさん |
ユーザー | miscalc |
提出日時 | 2021-04-09 22:36:37 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 137 ms / 2,000 ms |
コード長 | 2,767 bytes |
コンパイル時間 | 2,076 ms |
コンパイル使用メモリ | 185,256 KB |
実行使用メモリ | 14,612 KB |
最終ジャッジ日時 | 2023-09-07 12:09:05 |
合計ジャッジ時間 | 8,467 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,384 KB |
testcase_02 | AC | 129 ms
13,620 KB |
testcase_03 | AC | 102 ms
11,508 KB |
testcase_04 | AC | 68 ms
9,080 KB |
testcase_05 | AC | 25 ms
5,076 KB |
testcase_06 | AC | 112 ms
11,512 KB |
testcase_07 | AC | 130 ms
14,612 KB |
testcase_08 | AC | 137 ms
14,564 KB |
testcase_09 | AC | 136 ms
14,468 KB |
testcase_10 | AC | 88 ms
5,380 KB |
testcase_11 | AC | 89 ms
5,380 KB |
testcase_12 | AC | 87 ms
5,324 KB |
testcase_13 | AC | 53 ms
4,700 KB |
testcase_14 | AC | 39 ms
4,384 KB |
testcase_15 | AC | 75 ms
5,240 KB |
testcase_16 | AC | 86 ms
5,632 KB |
testcase_17 | AC | 7 ms
4,380 KB |
testcase_18 | AC | 12 ms
4,380 KB |
testcase_19 | AC | 66 ms
5,904 KB |
testcase_20 | AC | 82 ms
10,588 KB |
testcase_21 | AC | 90 ms
8,268 KB |
testcase_22 | AC | 96 ms
12,304 KB |
testcase_23 | AC | 83 ms
11,636 KB |
testcase_24 | AC | 81 ms
10,972 KB |
testcase_25 | AC | 117 ms
11,980 KB |
testcase_26 | AC | 121 ms
12,084 KB |
testcase_27 | AC | 49 ms
5,960 KB |
testcase_28 | AC | 124 ms
14,280 KB |
testcase_29 | AC | 95 ms
8,288 KB |
testcase_30 | AC | 108 ms
9,132 KB |
testcase_31 | AC | 107 ms
14,212 KB |
testcase_32 | AC | 96 ms
11,508 KB |
testcase_33 | AC | 77 ms
10,192 KB |
testcase_34 | AC | 43 ms
7,084 KB |
testcase_35 | AC | 45 ms
6,284 KB |
testcase_36 | AC | 87 ms
8,940 KB |
testcase_37 | AC | 89 ms
10,924 KB |
testcase_38 | AC | 20 ms
4,436 KB |
testcase_39 | AC | 88 ms
5,392 KB |
testcase_40 | AC | 88 ms
5,508 KB |
testcase_41 | AC | 77 ms
5,436 KB |
testcase_42 | AC | 73 ms
5,368 KB |
testcase_43 | AC | 91 ms
10,748 KB |
testcase_44 | AC | 89 ms
10,416 KB |
testcase_45 | AC | 91 ms
10,540 KB |
testcase_46 | AC | 97 ms
10,508 KB |
testcase_47 | AC | 116 ms
12,100 KB |
testcase_48 | AC | 106 ms
11,564 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using pll = pair<ll, ll>; constexpr ll MOD = 1e9 + 7; //constexpr ll MOD = 998244353; //constexpr ll MOD = ; ll mod(ll A, ll M) {return (A % M + M) % M;} constexpr ll INF = 1LL << 60; template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;} template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;} ll divceil(ll A, ll B) {return (A + (B - 1)) / B;} #define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false) template <class Abel> class unionfind { public: vector<ll> parent; vector<ll> rank; vector<Abel> diffw; unionfind(ll N, Abel U = 0) { parent = vector<ll>(N, -1); rank = vector<ll>(N, 0); diffw = vector<Abel>(N, U); } ll root(ll X) { if (parent.at(X) < 0) return X; ll R = root(parent.at(X)); diffw.at(X) += diffw.at(parent.at(X)); return parent.at(X) = R; } ll size(ll X) { return -parent.at(root(X)); } Abel weight(ll X) { root(X); return diffw.at(X); } Abel diff(ll X, ll Y) { return weight(Y) - weight(X); } bool same(ll X, ll Y) { return (root(X) == root(Y)); } bool unite(ll X, ll Y, Abel W = 0) { W += weight(X); W -= weight(Y); X = root(X); Y = root(Y); if (X == Y) return false; if (rank.at(X) < rank.at(Y)) { swap(X, Y); W = -W; } if (rank.at(X) == rank.at(Y)) rank.at(X)++; parent.at(X) += parent.at(Y); parent.at(Y) = X; diffw.at(Y) = W; return true; } }; int main() { ll N, M; cin >> N >> M; using tlll = tuple<ll, ll, ll>; vector<tlll> DST(M); for (ll i = 0; i < M; i++) { ll s, t, d; cin >> s >> t >> d; s--, t--; DST.at(i) = make_tuple(d, s, t); } sort(DST.begin(), DST.end(), greater<tlll>()); unionfind<ll> uf(N); ll maxw = INF; for (ll i = 0; i < M; i++) { ll d = get<0>(DST.at(i)), s = get<1>(DST.at(i)), t = get<2>(DST.at(i)); if (!uf.same(s, t)) { uf.unite(s, t); if (uf.same(0, N - 1)) { maxw = d; break; } } } cout << maxw << " "; vector<vector<ll>> G(N); for (ll i = 0; i < M; i++) { ll d = get<0>(DST.at(i)), s = get<1>(DST.at(i)), t = get<2>(DST.at(i)); if (maxw <= d) { G.at(s).push_back(t); G.at(t).push_back(s); } } queue<ll> que; vector<ll> dist(N, -1); que.push(0); dist.at(0) = 0; while (!que.empty()) { ll v = que.front(); que.pop(); for (auto nv : G.at(v)) { if (dist.at(nv) != -1) continue; dist.at(nv) = dist.at(v) + 1; que.push(nv); } } cout << dist.at(N - 1) << endl; }