# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
554183 | d4xn | 악어의 지하 도시 (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.
#pragma GCC optimize ("Ofast")
//#pragma GCC target ("avx2")
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define ll long long
#define ld long double
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define ii pair<int, int>
#define ff first
#define ss second
#define mp make_pair
#define UB upper_bound
#define LB lower_bound
#define pb push_back
#define vi vector<int>
#define vvi vector<vi>
#define vb vector<bool>
#define vvb vector<vb>
#define vs vector<string>
#define vii vector<ii>
#define vvii vector<vii>
#define vll vector<ll>
#define vld vector<ld>
const int inf = 2e9;
int n, m, k;
vvii adj;
vb vis;
vi dp; // minimo tiempo para escapar des de el nodo i
int mnToExit(int u) {
if (dp[u] != -1) return dp[u];
vis[u] = 1;
int mn, sMn;
mn = sMn = inf;
for (auto &[v, w] : adj[u]) {
if (vis[v]) continue;
int x = mnToExit(v) + w;
if (x < mn) {
sMn = mn;
mn = x;
}
else if (x < sMn) {
sMn = x;
}
}
vis[u] = 0;
return dp[u] = sMn;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> m >> k;
adj.resize(n);
vis.resize(n, 0);
dp.resize(n, -1);
while (m--) {
int x, y, z;
cin >> x >> y >> z;
adj[x].pb(mp(y, z));
adj[y].pb(mp(x, z));
}
while (k--) {
int x;
cin >> x;
dp[x] = 0;
}
cout << mnToExit(0) << "\n";
return 0;
}