# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
544949 | MilosMilutinovic | Cities (BOI16_cities) | C++14 | 2619 ms | 42812 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 fi first
#define se second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<typename T> bool chkmin(T&x,T y){return x<y?x=y,1:0;}
template<typename T> bool chkmax(T&x,T y){return x>y?x=y,1:0;}
const ll inf=(ll)1e18;
int n,k,m,id[100005];
ll dist[100005][1<<5];
vector<pii> g[100005];
priority_queue<pair<ll,int>> que;
void dijkstra(int mask){
for(int i=1;i<=n;i++)if(dist[i][mask]!=inf)que.push(mp(-dist[i][mask],i));
while(!que.empty()){
ll d=-que.top().first;
int u=que.top().second;
que.pop();
if(dist[u][mask]<d)continue;
for(auto e:g[u]){
int v=e.first,w=e.second;
if(dist[v][mask]>dist[u][mask]+w){
dist[v][mask]=dist[u][mask]+w;
que.push(mp(-dist[v][mask],v));
}
}
}
}
int main(){
scanf("%d%d%d",&n,&k,&m);
for(int i=1;i<=n;i++)id[i]=-1;
for(int i=1;i<=n;i++)for(int j=0;j<(1<<k);j++)dist[i][j]=inf;
for(int i=1;i<=k;i++){
int x;scanf("%d",&x);
id[x]=i-1; dist[x][1<<(i-1)]=0;
}
for(int i=1;i<=m;i++){
int u,v,w;scanf("%d%d%d",&u,&v,&w);
g[u].pb(mp(v,w)); g[v].pb(mp(u,w));
}
for(int mask=1;mask<(1<<k);mask++){
if(__builtin_popcount(mask)>1){
for(int s=((mask-1)&mask);s>0;s=((s-1)&mask)){
for(int i=1;i<=n;i++)dist[i][mask]=min(dist[i][mask],dist[i][s]+dist[i][mask^s]);
}
}
dijkstra(mask);
}
ll ans=inf;
for(int i=1;i<=n;i++)ans=min(ans,dist[i][(1<<k)-1]);
printf("%lld",ans);
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |