# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
853816 | kthng | Crocodile's Underground City (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<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef pair<int, int> pii;
vector<pii> a[100001];
int d[100001];
int n, m, k;
int inf = 1e9 + 100;
int f(int x) {
if (d[x] != -1) return d[x];
d[x] = inf;
vector<pii> tmp;
for (int i = 0; i < a[x].size(); i++) {
tmp.push_back(pii(f(a[x][i].first) + a[x][i].second, a[x][i].first));
}
sort(tmp.begin(), tmp.end());
if (a[x].size() != 1) d[x] = min(d[x], tmp[1].first);
return d[x];
}
int main() {
scanf("%d%d%d", &n, &m, &k);
for (int i = 0; i < m; i++) {
int t0, t1, t2;
scanf("%d%d%d", &t0, &t1, &t2);
a[t0].push_back(pii(t1, t2));
a[t1].push_back(pii(t0, t2));
}
for (int i = 0; i < n; i++) d[i] = -1;
for (int i = 0; i < k; i++) {
int t0;
scanf("%d", &t0);
d[t0] = 0;
}
printf("%d\n", f(0));
return 0;
}