| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 717597 | hafo | Crocodile's Underground City (IOI11_crocodile) | C++14 | 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.
int travel_plan(int n, int m, int r[][2], int l[], int k, int p[])
{
ll f[n][2];
int trace[n][2];
priority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>>> q;
memset(f, 0x3f, sizeof f);
memset(trace, -1, sizeof trace);
for(int i = 0; i < k; i++) {
f[p[i]][0] = 0;
q.push({0, p[i]});
}
vector<pair<int, int>> g[n];
for(int i = 0; i < m; i++) {
int u = r[i][0], v = r[i][1];
g[u].push_back({v, l[i]});
g[v].push_back({u, l[i]});
}
while(!q.empty()) {
int u = q.top().second;
long long fu = q.top().first;
q.pop();
if(fu > f[u][1]) continue;
for(auto e:g[u]) {
int v = e.first, w = e.second;
if(f[v][0] == 0) continue;
if(trace[u][0] == v || trace[u][1] == v) continue;
if(f[v][0] > fu + w) {
f[v][1] = f[v][0];
trace[v][1] = trace[v][0];
f[v][0] = fu + w;
trace[v][0] = u;
q.push({fu + w, v});
} else if(f[v][1] > fu + w) {
f[v][1] = fu + w;
trace[v][1] = u;
q.push({fu + w, v});
}
}
}
int res = 0, u = 0;
vector<int> path;
while(trace[u][1] != -1) {
path.pb(u);
u = trace[u][1];
}
path.pb(u);
for(int i = 0; i < (int) path.size() - 1; i++) {
int u = path[i], v = path[i + 1];
for(auto e:g[u]) {
if(e.first == v) res += e.second;
}
}
return res;
}
