結果
問題 | No.1473 おでぶなおばけさん |
ユーザー | shimarut |
提出日時 | 2021-04-10 22:13:21 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 205 ms / 2,000 ms |
コード長 | 3,692 bytes |
コンパイル時間 | 3,524 ms |
コンパイル使用メモリ | 189,512 KB |
実行使用メモリ | 9,444 KB |
最終ジャッジ日時 | 2023-09-08 17:51:30 |
合計ジャッジ時間 | 10,833 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,380 KB |
testcase_01 | AC | 2 ms
4,376 KB |
testcase_02 | AC | 179 ms
9,232 KB |
testcase_03 | AC | 131 ms
8,380 KB |
testcase_04 | AC | 104 ms
6,520 KB |
testcase_05 | AC | 41 ms
4,384 KB |
testcase_06 | AC | 181 ms
8,760 KB |
testcase_07 | AC | 161 ms
9,396 KB |
testcase_08 | AC | 204 ms
9,444 KB |
testcase_09 | AC | 153 ms
9,392 KB |
testcase_10 | AC | 93 ms
5,196 KB |
testcase_11 | AC | 106 ms
6,440 KB |
testcase_12 | AC | 93 ms
5,796 KB |
testcase_13 | AC | 55 ms
4,720 KB |
testcase_14 | AC | 42 ms
4,380 KB |
testcase_15 | AC | 88 ms
5,536 KB |
testcase_16 | AC | 85 ms
5,204 KB |
testcase_17 | AC | 8 ms
4,380 KB |
testcase_18 | AC | 13 ms
4,376 KB |
testcase_19 | AC | 81 ms
6,008 KB |
testcase_20 | AC | 94 ms
7,800 KB |
testcase_21 | AC | 123 ms
6,920 KB |
testcase_22 | AC | 88 ms
8,416 KB |
testcase_23 | AC | 70 ms
7,984 KB |
testcase_24 | AC | 70 ms
7,640 KB |
testcase_25 | AC | 201 ms
8,324 KB |
testcase_26 | AC | 205 ms
8,120 KB |
testcase_27 | AC | 61 ms
4,788 KB |
testcase_28 | AC | 176 ms
9,420 KB |
testcase_29 | AC | 122 ms
7,112 KB |
testcase_30 | AC | 151 ms
7,928 KB |
testcase_31 | AC | 127 ms
9,268 KB |
testcase_32 | AC | 137 ms
8,880 KB |
testcase_33 | AC | 104 ms
7,880 KB |
testcase_34 | AC | 54 ms
5,404 KB |
testcase_35 | AC | 58 ms
5,592 KB |
testcase_36 | AC | 104 ms
6,212 KB |
testcase_37 | AC | 123 ms
7,604 KB |
testcase_38 | AC | 23 ms
4,380 KB |
testcase_39 | AC | 88 ms
5,216 KB |
testcase_40 | AC | 85 ms
4,932 KB |
testcase_41 | AC | 77 ms
5,072 KB |
testcase_42 | AC | 76 ms
4,888 KB |
testcase_43 | AC | 92 ms
7,272 KB |
testcase_44 | AC | 92 ms
6,928 KB |
testcase_45 | AC | 92 ms
7,096 KB |
testcase_46 | AC | 105 ms
7,440 KB |
testcase_47 | AC | 128 ms
8,192 KB |
testcase_48 | AC | 120 ms
7,860 KB |
ソースコード
#pragma region #define _USE_MATH_DEFINES #include <iostream> #include <string> #include <algorithm> #include <cmath> #include <cstdlib> #include <vector> #include <map> #include <queue> #include <stack> #include <set> #include <list> #include <iomanip> #include <cstdint> #include <bitset> #include <sstream> #include <regex> #include <fstream> #include <array> #include <atcoder/all> using namespace atcoder; //using mint = modint1000000007; //using mint = modint998244353; using mint = modint; using namespace std; typedef long long ll; using vi = vector<int>; using vvi = vector<vi>; using vl = vector<ll>; using vvl = vector<vl>; using vmint = vector<mint>; using vvmint = vector<vmint>; using pint = pair<int, int>; using pll = pair<ll, ll>; using vpint = vector<pint>; using vvpint = vector<vpint>; //#define rep(i, s, e) for (int(i) = (s); (i) < (e); ++(i)) #define rep(i, e) for (int(i) = 0; (i) < (e); ++(i)) #define rrep(i, s) for (int(i) = (s) - 1; (i) >= 0; --(i)) #define all(x) x.begin(),x.end() #define rall(x) x.rbegin(),x.rend() #pragma region UnionFind struct UnionFind { vector<int> par; UnionFind(int n) : par(n, -1) {} void init(int n) { par.assign(n, -1); } int root(int x) { if (par[x] < 0) return x; else return par[x] = root(par[x]); } bool issame(int x, int y) { return root(x) == root(y); } bool merge(int x, int y) { x = root(x); y = root(y); if (x == y) return false; if (par[x] > par[y]) swap(x, y); par[x] += par[y]; par[y] = x; return true; } int size(int x) { return -par[root(x)]; } }; #pragma endregion #pragma region GCD ll gcd(ll a, ll b) { if (b == 0)return a; return gcd(b, a%b); } #pragma endregion #pragma region LCM ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } #pragma endregion #pragma region chmin template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } #pragma endregion #pragma region chmax template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } #pragma endregion #pragma region グリッド内チェック bool out(int x, int y, int h, int w) { if (x < 0 || h <= x || y < 0 || w <= y)return true; else return false; } #pragma endregion #pragma region Dijkstra vl dijkstra(vector<vector<pair<int, ll>>> v, int s) { ll INF = 1e18; int MAX = 1e6; vl res(MAX, INF); priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> q; q.push({ 0,s }); while (!q.empty()) { int now; ll d; tie(d, now) = q.top(); q.pop(); if (!chmin(res[now], d))continue; for (auto p : v[now]) { int next; ll c; tie(next, c) = p; if (res[next] <= res[now] + c)continue; q.push({ res[now] + c,next }); } } return res; } #pragma endregion #pragma endregion int main() { int n, m; cin >> n >> m; vvpint v(n); rep(i, m) { int s, t, d; cin >> s >> t >> d; --s, --t; v[s].push_back({ t,d }); v[t].push_back({ s,d }); } int ok = 1, ng = 1e9 + 1; while (ng - ok > 1) { int mid = (ok + ng) / 2; vi dp(n, -1); dp[0] = 0; queue<int> q; q.push(0); while (!q.empty()) { int now = q.front(); q.pop(); for (auto p : v[now]) { int next, d; tie(next, d) = p; if (dp[next] == -1 && mid <= d) { dp[next] = dp[now] + 1; q.push(next); } } } if (dp[n - 1] != -1)ok = mid; else ng = mid; } vi dp(n, -1); dp[0] = 0; queue<int> q; q.push(0); while (!q.empty()) { int now = q.front(); q.pop(); for (auto p : v[now]) { int next, d; tie(next, d) = p; if (dp[next] == -1 && ok <= d) { dp[next] = dp[now] + 1; q.push(next); } } } cout << ok << " " << dp[n - 1] << endl; }