結果
問題 | No.1812 Uribo Road |
ユーザー | milanis48663220 |
提出日時 | 2022-01-14 23:36:47 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 150 ms / 5,000 ms |
コード長 | 3,545 bytes |
コンパイル時間 | 1,933 ms |
コンパイル使用メモリ | 144,764 KB |
実行使用メモリ | 7,136 KB |
最終ジャッジ日時 | 2024-04-30 18:02:08 |
合計ジャッジ時間 | 3,879 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,944 KB |
testcase_02 | AC | 1 ms
6,944 KB |
testcase_03 | AC | 34 ms
6,944 KB |
testcase_04 | AC | 1 ms
6,944 KB |
testcase_05 | AC | 2 ms
6,940 KB |
testcase_06 | AC | 1 ms
6,940 KB |
testcase_07 | AC | 3 ms
6,940 KB |
testcase_08 | AC | 4 ms
6,940 KB |
testcase_09 | AC | 6 ms
6,940 KB |
testcase_10 | AC | 3 ms
6,944 KB |
testcase_11 | AC | 3 ms
6,944 KB |
testcase_12 | AC | 69 ms
6,944 KB |
testcase_13 | AC | 37 ms
6,944 KB |
testcase_14 | AC | 40 ms
6,944 KB |
testcase_15 | AC | 36 ms
6,940 KB |
testcase_16 | AC | 41 ms
6,940 KB |
testcase_17 | AC | 110 ms
6,944 KB |
testcase_18 | AC | 46 ms
6,940 KB |
testcase_19 | AC | 150 ms
6,944 KB |
testcase_20 | AC | 147 ms
7,092 KB |
testcase_21 | AC | 112 ms
7,136 KB |
testcase_22 | AC | 92 ms
6,944 KB |
testcase_23 | AC | 8 ms
6,940 KB |
testcase_24 | AC | 2 ms
6,944 KB |
testcase_25 | AC | 14 ms
6,940 KB |
testcase_26 | AC | 3 ms
6,940 KB |
testcase_27 | AC | 25 ms
6,944 KB |
testcase_28 | AC | 28 ms
6,944 KB |
testcase_29 | AC | 2 ms
6,940 KB |
testcase_30 | AC | 4 ms
6,944 KB |
testcase_31 | AC | 85 ms
6,940 KB |
testcase_32 | AC | 4 ms
6,944 KB |
testcase_33 | AC | 47 ms
6,944 KB |
ソースコード
#include <iostream> #include <algorithm> #include <iomanip> #include <vector> #include <queue> #include <deque> #include <set> #include <map> #include <tuple> #include <cmath> #include <numeric> #include <functional> #include <cassert> #define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl; #define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl; template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } using namespace std; typedef long long ll; template<typename T> vector<vector<T>> vec2d(int n, int m, T v){ return vector<vector<T>>(n, vector<T>(m, v)); } template<typename T> vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){ return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v))); } template<typename T> void print_vector(vector<T> v, char delimiter=' '){ if(v.empty()) { cout << endl; return; } for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter; cout << v.back() << endl; } const ll INF = 1e+15; typedef pair<ll, int> P; struct edge{ int to; ll cost; }; vector<ll> dijkstra(int s, vector<vector<edge>> G){ priority_queue<P, vector<P>, greater<P>> que; int n = G.size(); vector<ll> d(n, INF); d[s] = 0; que.push(P(0, s)); while(!que.empty()){ P p = que.top();que.pop(); int v = p.second; if(d[v] < p.first) continue; for(int i = 0; i < G[v].size(); i++){ edge e = G[v][i]; if(d[v] + e.cost < d[e.to]){ d[e.to] = d[v] + e.cost; que.push(P(d[e.to], e.to)); } } } return d; } using T = tuple<ll, int, int>; int main(){ ios::sync_with_stdio(false); cin.tie(0); cout << setprecision(10) << fixed; int n, m, k; cin >> n >> m >> k; vector<int> t(k); for(int i = 0; i < k; i++){ cin >> t[i]; t[i]--; } vector<vector<edge>> g(n+2*k); vector<int> a(m), b(m), c(m); for(int i = 0; i < m; i++) { cin >> a[i] >> b[i] >> c[i]; a[i]--; b[i]--; g[a[i]].push_back(edge{b[i], c[i]}); g[b[i]].push_back(edge{a[i], c[i]}); } vector<int> r = {0}; vector<int> idx = {-1}; int cur = n; for(int j = 0; j < k; j++){ r.push_back(cur); idx.push_back(j); int i = t[j]; g[a[i]].push_back(edge{cur, 0}); g[cur].push_back(edge{b[i], c[i]}); cur++; r.push_back(cur); idx.push_back(j); g[b[i]].push_back(edge{cur, 0}); g[cur].push_back(edge{a[i], c[i]}); cur++; } r.push_back(n-1); idx.push_back(-1); auto h = vec2d(2*k+2, 2*k+2, 0ll); for(int i = 0; i <= 2*k+1; i++){ auto d = dijkstra(r[i], g); for(int j = 0; j <= 2*k+1; j++){ h[i][j] = d[r[j]]; } } auto dist = vec2d(2*k+2, 1<<k, INF); priority_queue<T, vector<T>, greater<T>> que; auto set_dist = [&](int v, int s, ll d){ if(chmin(dist[v][s], d)){ que.push(T(d, v, s)); } }; set_dist(0, 0, 0); while(!que.empty()){ auto [d, v, s] = que.top(); que.pop(); for(int i = 0; i <= 2*k+1; i++){ int t = s; if(idx[i] != -1) t |= (1<<idx[i]); set_dist(i, t, d + h[v][i]); } } cout << dist[2*k+1][(1<<k)-1] << endl; }