# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
517679 | ivls | Alias (COCI21_alias) | C++14 | 144 ms | 17232 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;
int n, m;
map<string, int> nn;
vector<int> g[5000];
int dst[5000][5000];
int dist(int st, int fi) {
int dist[5000] = {};
set<pair<int, int>> s;
for (int i = 1; i <= n; i++) {
s.insert(make_pair((i == st ? 0 : 2000000000), i));
dist[i] = (i == st ? 0 : 2000000000);
}
while (!s.empty()) {
int v = (*s.begin()).second;
s.erase(s.begin());
for (int u : g[v]) {
if (dist[u] > dist[v] + dst[v][u]) {
s.erase(make_pair(u, dist[u]));
s.insert(make_pair(u, dist[v] + dst[v][u]));
dist[u] = dist[v] + dst[v][u];
}
}
}
return dist[fi] == 2000000000 ? -1 : dist[fi];
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |