# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
976520 | phcbaka | Relay Marathon (NOI20_relaymarathon) | C++17 | 3 ms | 6488 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;
#define int long long
using ii = pair <int, int>;
int n, m, k;
void read()
{
cin >> n >> m >> k;
}
struct vet
{
int spec[510]={},a[510][510];
ii dp[510][510];
void calc()
{
memset(a, 0x3f3f, sizeof(a));
for (int i = 1; i <= n; ++i) a[i][i] = 0;
for (int i = 1; i <= m; ++i)
{
int u, v, L;
cin >> u >> v >> L;
a[u][v] = min(a[u][v], L);
a[v][u] = min(a[v][u], L);
}
for (int i = 1; i <= k; ++i)
{
int u;
cin >> u;
spec[u] = 1;
}
for (int k = 1; k <= n; ++k)
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
a[i][j] = min(a[i][j], a[i][k]+a[k][j]);
for (int i = 1; i <= n; ++i)
{
for (int j = 1; j <= n; ++j)
if (spec[i] == 0 or spec[j] == 0 or i == j)
{
dp[i][j]={1e9,j};
}
else dp[i][j]={a[i][j],j};
sort (dp[i]+1, dp[i]+n+1);
}
int ans = LLONG_MAX;
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
for (int t = 1; t <= min(5ll, n); ++t)
for (int c = 1; c <= min(5ll, n); ++c)
if (i != j and i != dp[i][t].second and i != dp[j][c].second
and j != dp[i][t].second and j != dp[j][c].second
and dp[i][t].second != dp[j][c].second)
{
ans = min(ans, dp[i][t].first + dp[j][c].first);
}
cout << ans;
exit(0);
}
}Vetcan;
signed main()
{
cin.tie(0)->sync_with_stdio(0);
#define task "cities"
if (fopen(task ".inp", "r"))
{
freopen(task ".inp", "r", stdin);
freopen(task ".out", "w", stdout);
}
read ();
if (n <= 500 and m <= 500)
{
Vetcan.calc();
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |