結果
問題 |
No.1393 Median of Walk
|
ユーザー |
|
提出日時 | 2021-02-13 10:17:20 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 40 ms / 2,000 ms |
コード長 | 3,330 bytes |
コンパイル時間 | 2,530 ms |
コンパイル使用メモリ | 217,768 KB |
最終ジャッジ日時 | 2025-01-18 20:05:05 |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 39 |
ソースコード
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for(int i = 0; i < n; i++) #define rep2(i, x, n) for(int i = x; i <= n; i++) #define rep3(i, x, n) for(int i = x; i >= n; i--) #define each(e, v) for(auto &e: v) #define pb push_back #define eb emplace_back #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define sz(x) (int)x.size() using ll = long long; using pii = pair<int, int>; using pil = pair<int, ll>; using pli = pair<ll, int>; using pll = pair<ll, ll>; const int MOD = 1000000007; //const int MOD = 998244353; const int inf = (1<<30)-1; const ll INF = (1LL<<60)-1; template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;}; template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;}; struct io_setup{ io_setup(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout << fixed << setprecision(15); } } io_setup; template<typename T> struct Weighted_Graph{ struct edge{ int to; T cost; edge(int to, T cost) : to(to), cost(cost) {} }; vector<vector<edge>> es; vector<T> d; vector<int> pre_v; vector<int> keep; const T INF_T; const int n; Weighted_Graph(int n) : INF_T(numeric_limits<T>::max()/2), n(n){ es.resize(n), d.resize(n), pre_v.resize(n); } void add_edge(int from, int to, T cost, bool directed = false){ es[from].eb(to, cost); if(!directed) es[to].eb(from, cost); } T dijkstra(int s, int t = 0){ fill(all(d), INF_T); using P = pair<T, int>; priority_queue<P, vector<P>, greater<P> > que; que.emplace(d[s] = 0, s); while(!que.empty()){ auto [p, i] = que.top(); que.pop(); if(p > d[i]) continue; each(e, es[i]){ if(chmin(d[e.to], d[i]+e.cost)){ pre_v[e.to] = i, que.emplace(d[e.to], e.to); } } } return d[t]; } vector<int> shortest_path(int s, int t){ keep.clear(); if(dijkstra(s, t) == INF_T) return keep; for(int now = t; now != s; now = pre_v[now]) keep.pb(now); keep.pb(s), reverse(all(keep)); return keep; } void update(int u, int v){ queue<int> que; vector<bool> used(n, false); add_edge(u, v, -1, true); que.emplace(u), used[u] = true; while(!que.empty()){ int i = que.front(); que.pop(); used[i] = false; each(e, es[i]){ if(d[e.to] == -n) continue; if(chmin(d[e.to], d[i]+e.cost)){ if(!used[e.to]) que.emplace(e.to), used[e.to] = true; } } } } }; int main(){ int N, M; cin >> N >> M; vector<int> u(M), v(M), w(M); map<int, vector<int>> mp; Weighted_Graph<int> G(N); rep(i, M){ cin >> u[i] >> v[i] >> w[i]; u[i]--, v[i]--; mp[w[i]].eb(i); G.add_edge(u[i], v[i], 1, true); } G.dijkstra(0); vector<int> ans(N, inf); each(e, mp){ each(x, e.second) G.update(u[x], v[x]); rep(i, N){ if(G.d[i] <= 0) chmin(ans[i], e.first); } } rep2(i, 1, N-1) cout << (ans[i] == inf? -1 : ans[i]) << '\n'; }