# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
96944 | Kastanda | Cities (BOI16_cities) | C++11 | 6064 ms | 34876 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;
const int N = 100005, K = 5;
int n, m, k, A[K];
bool M[N];
long long dp[1 << K][N];
vector < pair < int , int > > Adj[N];
int main()
{
scanf("%d%d%d", &n, &k, &m);
memset(dp, 63, sizeof(dp));
for (int i = 0; i < k; i++)
scanf("%d", &A[i]), dp[1 << i][A[i]] = 0;
for (int i = 1; i <= m; i++)
{
int v, u, w;
scanf("%d%d%d", &v, &u, &w);
Adj[v].push_back({u, w});
Adj[u].push_back({v, w});
}
for (int mask = 1; mask < (1 << k); mask ++)
{
if (__builtin_popcount(mask) > 1)
for (int v = 1; v <= n; v ++)
for (int sub = mask; sub; sub = (sub - 1) & mask)
if (sub && (sub ^ mask))
for (auto &u : Adj[v])
if (dp[mask][v] > dp[sub][v] + dp[mask ^ sub][u.first] + u.second)
dp[mask][v] = dp[sub][v] + dp[mask ^ sub][u.first] + u.second;
queue < int > Pq;
for (int v = 1; v <= n; v ++)
Pq.push(v), M[v] = 1;
while (Pq.size())
{
int v = Pq.front();
M[v] = 0; Pq.pop();
for (auto &u : Adj[v])
if (dp[mask][u.first] > dp[mask][v] + u.second)
{
dp[mask][u.first] = dp[mask][v] + u.second;
if (!M[u.first])
M[u.first] = 1, Pq.push(u.first);
}
}
}
return !printf("%lld\n", dp[(1 << k) - 1][A[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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |