| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1280448 | hoangtien69 | 악어의 지하 도시 (IOI11_crocodile) | C++20 | 0 ms | 0 KiB |
#include "crocodile.h"
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 5;
#define int long long
#define pii pair<int,int>
const int INF = 1e18;
int n, m, k;
pii R[MAXN];
int L[MAXN];
vector<int> P;
vector<pii> adj[MAXN];
int d[MAXN][2];
void dijkstra()
{
for (int i = 0; i <= n; i++)
{
d[i][0] = d[i][1] = INF;
}
priority_queue<pii, vector<pii>, greater<pii>> pq;
for (int u : P)
{
d[u][0] = 0;
d[u][1] = 0;
pq.push({0, u});
}
while(!pq.empty())
{
auto[dist, u] = pq.top();
pq.pop();
if (dist > d[u][1]) continue;
for (auto [v, w] : adj[u])
{
int new_dist = dist + w;
if (d[v][0] > new_dist)
{
if (d[v][1] != d[v][0])
{
d[v][1] = d[v][0];
pq.push({d[v][1], v});
}
d[v][0] = new_dist;
}
else if (d[v][1] > new_dist)
{
d[v][1] = new_dist;
pq.push({d[v][1], v});
}
}
}
}
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m >> k;
for (int i = 1; i <= m; i++)
{
cin >> R[i].first >> R[i].second >> L[i];
}
for (int i = 1; i <= k; i++)
{
int u;
cin >> u;
P.push_back(u);
}
for (int i = 1; i <= m; i++)
{
int u = R[i].first;
int v = R[i].second;
int w = L[i];
adj[u].push_back({v, w});
adj[v].push_back({u, w});
}
dijkstra();
cout << d[0][1];
}