結果
問題 |
No.1473 おでぶなおばけさん
|
ユーザー |
![]() |
提出日時 | 2021-04-09 21:43:40 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 4,814 bytes |
コンパイル時間 | 11,726 ms |
コンパイル使用メモリ | 275,284 KB |
最終ジャッジ日時 | 2025-01-20 13:57:57 |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 43 TLE * 4 |
ソースコード
#ifndef _DEBUG #define _DEBUG #include __FILE__ signed main() { int N, M; cin >> N >> M; vector<tuple<int, int, int>> V(M); for (int i = 0; i < M; i++) { int a, b, c; cin >> a >> b >> c, a--, b--; V.at(i) = {a, b, c}; } auto f = [&](long mid) { Dijkstra<long> D(N); for (const auto& [a, b, c] : V) { if (c >= mid) D.add_edge(a, b, 1); } auto ans = D.solve(0).at(N - 1); if (ans == LONG_MAX) return false; return true; }; long ok = 0, ng = INT_MAX; while (abs(ok - ng) > 1) { long mid = (ok + ng) / 2; (f(mid)) ? ok = mid : ng = mid; } auto f2 = [&](long mid) { Dijkstra<long> D(N); for (const auto& [a, b, c] : V) { if (c >= mid) D.add_edge(a, b, 1); } auto ans = D.solve(0).at(N - 1); return ans; }; cout << ok << " " << f2(ok) << "\n"; } #else // #undef _DEBUG #pragma GCC diagnostic warning "-Wextra" #pragma GCC diagnostic warning "-Wshadow" #include <bits/stdc++.h> using namespace std; template <typename T> class Dijkstra { private: using edge = tuple<int, T>; vector<vector<edge>> G; vector<T> D; public: Dijkstra(int v) : G(v), D(v, numeric_limits<T>::max()) {} void add_edge(int from, int to, T cost) { G[from].push_back({to, cost}); G[to].push_back({from, cost}); } vector<T> solve(int s) { D[s] = 0; using pti = pair<T, int>; priority_queue<pti, vector<pti>, greater<pti>> que; que.push({0, s}); while (que.size()) { auto [dist, now] = que.top(); que.pop(); if (dist > D[now]) continue; for (const auto& [to, cost] : G[now]) { if (D[now] + cost < D[to]) { D[to] = D[now] + cost; que.push({D[to], to}); } } } return D; } }; struct io_setup { io_setup() { cin.tie(nullptr)->sync_with_stdio(false); } } io_setup; template <class A, class B> bool cmin(A& a, const B& b) { if (a > b) return a = b, true; return false; } template <class A, class B> bool cmax(A& a, const B& b) { if (a < b) return a = b, true; return false; } template <class A, class B> ostream& operator<<(ostream& os, const pair<A, B>& p); template <class A, class B, class C> ostream& operator<<(ostream& os, const tuple<A, B, C>& t); template <class A, class B, class C, class D> ostream& operator<<(ostream& os, const tuple<A, B, C, D>& t); #define foreach(it, a) for (auto it = a.begin(); it != a.end(); it++) ostream& operator<<(ostream& os, const vector<char>& vec) { os << "{"; foreach (it, vec) { os << (it == vec.begin() ? "" : " ") << *it; } return os << "}"; } template <class A> ostream& operator<<(ostream& os, const vector<A>& vec) { os << "{"; foreach (it, vec) { os << (it == vec.begin() ? "" : ", ") << *it; } return os << "}"; } template <class A> ostream& operator<<(ostream& os, const vector<vector<A> >& vec) { os << "{\n"; foreach (it, vec) { os << (it == vec.begin() ? " " : "\n ") << *it; } return os << "\n}"; } template <class A> ostream& operator<<(ostream& os, const vector<vector<vector<A> > >& vec) { os << "{\n"; foreach (it, vec) { os << (it == vec.begin() ? "" : "\n") << it - vec.begin() << ": " << *it; } return os << "\n}"; } template <class A> ostream& operator<<(ostream& os, const set<A>& se) { os << "{"; foreach (it, se) { os << (it == se.begin() ? "" : ", ") << *it; } return os << "}"; } template <class A> ostream& operator<<(ostream& os, const multiset<A>& ms) { os << "{"; foreach (it, ms) { os << (it == ms.begin() ? "" : ", ") << *it; } return os << "}"; } template <class A, class B> ostream& operator<<(ostream& os, const map<A, B>& ma) { os << "{"; foreach (it, ma) { os << (it == ma.begin() ? "" : ", ") << *it; } return os << "}"; } template <class A> ostream& operator<<(ostream& os, priority_queue<A> pq) { os << "{"; while (!pq.empty()) { os << pq.top(), pq.pop(); if (!pq.empty()) os << ", "; } return os << "}"; } template <class A, class B> ostream& operator<<(ostream& os, const pair<A, B>& p) { const auto& [a, b] = p; return os << "(" << a << ", " << b << ")"; } template <class A, class B, class C> ostream& operator<<(ostream& os, const tuple<A, B, C>& t) { const auto& [a, b, c] = t; return os << "(" << a << ", " << b << ", " << c << ")"; } template <class A, class B, class C, class D> ostream& operator<<(ostream& os, const tuple<A, B, C, D>& t) { const auto& [a, b, c, d] = t; return os << "(" << a << ", " << b << ", " << c << ", " << d << ")"; } void dump_func() {} template <class A, class... B> void dump_func(const A& a, const B&... b) { cout << a << (sizeof...(b) ? ", " : "\n"); dump_func(b...); } #ifdef _DEBUG #define dump(...) cout << "[" << (#__VA_ARGS__) << "]: ", dump_func(__VA_ARGS__) #else #define dump(...) #endif #endif