# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
467880 | shanem_1401 | Cities (BOI16_cities) | C++14 | 246 ms | 262148 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>
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
using namespace std;
typedef long long ll;
int n, m, k;
int main()
{
scanf("%d %d %d",& n,& k,& m);
vector<int>penting;
for(int i=0; i<k; i++)
{
int temp;
scanf("%d",& temp);
penting.push_back(temp);
}
vector<pii>v[n+2];
for(int i=0; i<m; i++)
{
int from, to, cost;
scanf("%d %d %d",& from,& to,& cost);
v[from].pb(mp(cost, to));
v[to].pb(mp(cost, from));
}
ll dist[n+2][n+2];
for(int i=1; i<=n; i++)
fill(dist[i]+1, dist[i]+n+1, 2e18);
if(k==2)
{
penting.resize(3, penting[0]);
k=3;
}
for(int i=1; i<=n; i++)
{
priority_queue<pair<ll, int> >pq;
pq.push(mp(0, i));
dist[i][i]=0;
while(!pq.empty())
{
ll cost=-pq.top().fi;
int from=pq.top().se;
pq.pop();
if(dist[i][from]!=cost)
continue;
for(int j=0; j<v[from].size(); j++)
{
int to=v[from][j].se;
ll price=v[from][j].fi+cost;
if(dist[i][to]>price)
{
dist[i][to]=price;
pq.push(mp(-price, to));
}
}
}
}
ll mini=2e18;
if(k==3)
{
for(int i=1; i<=n; i++)
{
ll total=0;
for(int j=0; j<k; j++)
total+=dist[penting[j]][i];
mini=min(mini, total);
}
}
else
{
for(int x=1; x<=n; x++)
{
for(int y=1; y<=n; y++)
{
ll total=dist[x][y];
for(int j=0; j<k; j++)
total+=min(dist[penting[j]][x], dist[penting[j]][y]);
mini=min(mini, total);
}
}
}
printf("%lld\n", mini);
}
/*
6 4 5
1 2 4 5
1 3 1
2 3 2
4 6 1
5 6 2
3 6 3
*/
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... |