結果
問題 |
No.1812 Uribo Road
|
ユーザー |
|
提出日時 | 2022-01-14 23:13:34 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 775 ms / 5,000 ms |
コード長 | 2,967 bytes |
コンパイル時間 | 4,298 ms |
コンパイル使用メモリ | 210,376 KB |
最終ジャッジ日時 | 2025-01-27 12:15:58 |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 30 |
ソースコード
#include <bits/stdc++.h> using namespace std; struct edge{ int to; int cost; }; typedef tuple<int, int> P; int main(){ int N, M, K; cin >> N >> M >> K; vector<int> R(K); for(int i = 0; i < K; i++) { cin >> R[i]; R[i]--; } vector<vector<edge>> G(N); 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({B[i], C[i]}); G[B[i]].push_back({A[i], C[i]}); } int INF = 1000000000; vector<vector<int>> d(2 * K + 1, vector<int>(N, INF)); for(int i = 0; i < K; i++){ priority_queue<P, vector<P>, greater<P>> q; d[i][A[R[i]]] = 0; q.push({0, A[R[i]]}); while(!q.empty()){ auto [dis, now] = q.top(); q.pop(); if(d[i][now] > dis) continue; for(auto [to, cost] : G[now]){ if(d[i][to] > dis + cost){ d[i][to] = dis + cost; q.push({d[i][to], to}); } } } d[i + K][B[R[i]]] = 0; q.push({0, B[R[i]]}); while(!q.empty()){ auto [dis, now] = q.top(); q.pop(); if(d[i + K][now] > dis) continue; for(auto [to, cost] : G[now]){ if(d[i + K][to] > dis + cost){ d[i + K][to] = dis + cost; q.push({d[i + K][to], to}); } } } } { priority_queue<P, vector<P>, greater<P>> q; d[2 * K][0] = 0; q.push({0, 0}); while(!q.empty()){ auto [dis, now] = q.top(); q.pop(); if(d[2 * K][now] > dis) continue; for(auto [to, cost] : G[now]){ if(d[2 * K][to] > dis + cost){ d[2 * K][to] = dis + cost; q.push({d[2 * K][to], to}); } } } } vector<vector<int>> dp(2 * K + 1, vector<int>((1 << K), INF)); dp[2 * K][0] = 0; for(int bit = 0; bit < (1 << K); bit++){ for(int i = 0; i < 2 * K + 1; i++){ if(dp[i][bit] == INF) continue; for(int j = 0; j < 2 * K; j++){ if(j < K){ if(bit & (1 << j)) continue; dp[j][bit | (1 << j)] = min(dp[j][bit | (1 << j)], dp[i][bit] + d[i][B[R[j]]] + C[R[j]]); } else{ if(bit & (1 << (j - K))) continue; dp[j][bit | (1 << (j - K))] = min(dp[j][bit | (1 << (j - K))], dp[i][bit] + d[i][A[R[j - K]]] + C[R[j - K]]); } } } } int ans = INF; for(int i = 0; i < 2 * K + 1; i++){ //cout << dp[i][(1 << K) - 1] << ' ' << d[i][N - 1] << endl; ans = min(ans, dp[i][(1 << K) - 1] + d[i][N - 1]); } cout << ans << endl; }