結果
問題 | No.1473 おでぶなおばけさん |
ユーザー | みしあ |
提出日時 | 2022-05-15 20:04:54 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,940 ms / 2,000 ms |
コード長 | 3,979 bytes |
コンパイル時間 | 4,692 ms |
コンパイル使用メモリ | 281,740 KB |
実行使用メモリ | 19,868 KB |
最終ジャッジ日時 | 2023-10-11 07:15:05 |
合計ジャッジ時間 | 34,422 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,348 KB |
testcase_01 | AC | 1 ms
4,348 KB |
testcase_02 | AC | 1,297 ms
17,604 KB |
testcase_03 | AC | 747 ms
14,080 KB |
testcase_04 | AC | 772 ms
11,656 KB |
testcase_05 | AC | 159 ms
5,592 KB |
testcase_06 | AC | 972 ms
14,872 KB |
testcase_07 | AC | 1,570 ms
17,752 KB |
testcase_08 | AC | 1,940 ms
19,868 KB |
testcase_09 | AC | 1,473 ms
17,884 KB |
testcase_10 | AC | 88 ms
8,716 KB |
testcase_11 | AC | 87 ms
9,828 KB |
testcase_12 | AC | 88 ms
9,248 KB |
testcase_13 | AC | 53 ms
7,108 KB |
testcase_14 | AC | 37 ms
5,984 KB |
testcase_15 | AC | 71 ms
8,680 KB |
testcase_16 | AC | 85 ms
8,360 KB |
testcase_17 | AC | 8 ms
4,348 KB |
testcase_18 | AC | 12 ms
4,348 KB |
testcase_19 | AC | 107 ms
7,076 KB |
testcase_20 | AC | 367 ms
13,420 KB |
testcase_21 | AC | 246 ms
11,472 KB |
testcase_22 | AC | 132 ms
16,488 KB |
testcase_23 | AC | 118 ms
15,024 KB |
testcase_24 | AC | 109 ms
14,472 KB |
testcase_25 | AC | 1,809 ms
16,492 KB |
testcase_26 | AC | 1,806 ms
16,988 KB |
testcase_27 | AC | 267 ms
8,836 KB |
testcase_28 | AC | 1,204 ms
19,416 KB |
testcase_29 | AC | 456 ms
14,908 KB |
testcase_30 | AC | 801 ms
16,596 KB |
testcase_31 | AC | 936 ms
19,552 KB |
testcase_32 | AC | 528 ms
14,836 KB |
testcase_33 | AC | 421 ms
13,584 KB |
testcase_34 | AC | 204 ms
9,084 KB |
testcase_35 | AC | 116 ms
7,276 KB |
testcase_36 | AC | 398 ms
13,284 KB |
testcase_37 | AC | 804 ms
14,584 KB |
testcase_38 | AC | 64 ms
5,176 KB |
testcase_39 | AC | 86 ms
8,712 KB |
testcase_40 | AC | 87 ms
8,700 KB |
testcase_41 | AC | 73 ms
8,268 KB |
testcase_42 | AC | 72 ms
7,944 KB |
testcase_43 | AC | 246 ms
14,292 KB |
testcase_44 | AC | 245 ms
14,288 KB |
testcase_45 | AC | 247 ms
14,136 KB |
testcase_46 | AC | 841 ms
14,160 KB |
testcase_47 | AC | 1,199 ms
16,200 KB |
testcase_48 | AC | 1,018 ms
15,476 KB |
ソースコード
#pragma region Macros #include <bits/stdc++.h> #if defined(LOCAL) || defined(ONLINE_JUDGE) || defined(_DEBUG) #include <atcoder/all> #endif using namespace std; #define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i) #define REPR(i, n) for(int i=(n); i>=0; --i) #define FOR(i, n, m) for(int i=(m), i##_len=(n); i<i##_len; ++i) #define EACH(i, v) for(const auto& i : v) #define ALL(x) (x).begin(),(x).end() #define ALLR(x) (x).rbegin(),(x).rend() template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; } template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; } template<class T>using vec = vector<T>; template<class T, class U>using umap = unordered_map<T, U>; template<class T>using uset = unordered_set<T>; using ll = long long; using ld = long double; using P = pair<ll, ll>; //using T = tuple<ll, ll, ll>; using vl = vec<ll>; #define fi first #define se second #define el endl constexpr ll INF = numeric_limits<ll>::max()/2-1; #pragma endregion #pragma region IOMacros template<class T> istream &operator>>(istream &stream, vec<T>& o){REP(i, o.size())stream >> o[i];return stream;} template<class T> ostream &operator<<(ostream &stream, vec<T>& objs){REP(i, objs.size())stream << objs[i] << " ";stream << el;return stream;} #define I(T, ...) ;T __VA_ARGS__;__i(__VA_ARGS__); void __i() {} template<class T, class... Ts> void __i(T&& o, Ts&&... args){cin >> o;__i(forward<Ts>(args)...);} void O() {cout << el;} template<class T, class... Ts> void O(T&& o, Ts&&... args){cerr << o << " ";O(forward<Ts>(args)...);} #pragma endregion void Main(); int main(){ std::cin.tie(nullptr); std::cout << std::fixed << std::setprecision(15); Main(); return 0; } #pragma region graph struct edge{ ll from, to, cost; bool operator<(const edge& r) const{return cost<r.cost;} bool operator>(const edge& r) const{return cost>r.cost;} }; struct graph{ ll V; vector<vector<edge> > G; graph(ll n){ init(n); } void init(ll n){ V = n; G.resize(V); } // 無向グラフ void add_edge(ll s, ll t, ll cost = 1){ add_diedge(s, t, cost); add_diedge(t, s, cost); } // 有向グラフ void add_diedge(ll s, ll t, ll cost = 1){ if(s < 0 || t < 0 || s >= V || t >= V) return; G[s].push_back({s, t, cost}); } auto pos2d(ll height, ll width){ return [height, width](ll y, ll x){ return (y < 0 || y >= height || x < 0 || x >= width) ? -1 : y*width + x; }; } }; #pragma endregion // O(V+E) umap<ll, ll> BFS(const graph& g, ll s, ll limit = INF){ vector<ll> d(g.V, INF); umap<ll, ll> ret; d[s] = 0; queue<P> que; que.push({0, s}); ret[s] = 0; while(!que.empty()){ auto [c, v] = que.front(); que.pop(); if(d[v]<c) continue; for(auto e : g.G[v]){ ll l = d[v]+e.cost; if(d[e.to]>l && limit>=l){ d[e.to] = l; que.push({d[e.to],e.to}); ret[e.to] = d[e.to]; } } } return ret; } // x∈[l, r] | f(x) = true となる最大のxを返す template <class Func> ll binarySearch(ll l, ll r, Func f){ while(l < r){ const ll m = (l+r+1)/2; if(f(m)) l = m; else r = m-1; } return l; } void Main(){ I(ll, N, M); vec<tuple<ll, ll, ll>> A(M); REP(i, M){ I(ll, S, T, D); S--;T--; A[i] = {S, T, D}; } ll t = 0; ll x = binarySearch(0, 1e9, [&](ll m){ graph g(N); REP(i, M){ auto [S, T, D] = A[i]; if(m > D) continue; g.add_edge(S, T); } auto d = BFS(g, 0); if(d.find(N-1) != d.end()){ t = d[N-1]; return true; }else{ return false; } }); cout << x << " " << t << el; }