# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
714478 | tcmmichaelb139 | 악어의 지하 도시 (IOI11_crocodile) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bits/stdc++.h"
using namespace std;
struct node {
int v;
long long time;
bool operator<(const node &rhs) const {
return time > rhs.time;
}
};
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m, k;
cin >> n >> m >> k;
vector<pair<int, long long>> adj[n + 1];
for (int i = 0; i < m; i++) {
long long a, b, c;
cin >> a >> b >> c;
adj[a].push_back({b, c});
adj[b].push_back({a, c});
}
vector<int> p(k);
for (int i = 0; i < k; i++)
cin >> p[i];
vector<int> vis(n + 1, 0);
priority_queue<node> q;
for (auto i : p) {
q.push({i, 0}), vis[i] = 2;
}
while (!q.empty()) {
node v = q.top();
q.pop();
vis[v.v]++;
if (vis[v.v] < 2) continue;
if (v.v == 0) {
cout << v.time << '\n';
break;
}
for (auto u : adj[v.v]) {
q.push({u.first, u.second + v.time});
}
}
}