# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
74916 | Vardanyan | Cities (BOI16_cities) | C++14 | 6089 ms | 48664 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.
//#pragma GCC optimize "-O3"
#include <bits/stdc++.h>
using namespace std;
const int N = 1000*100+5;
vector<pair<int,int> > g[N];
long long dp[N][(1<<5)+5];
bool c[N];
int a[6];
int IS[N];
int n,k;
long long ans = 10000000000000005;
void dfs(int v,int bitmask,long long val){
c[v] = 1;
// cout<<bitmask<<endl;
if(val>=ans) return;
if(bitmask == (1<<k)-1){
ans = min(ans,val);
return;
}
if(dp[v][bitmask]<=val && dp[v][bitmask] != -1) return;
dp[v][bitmask] = val;
for(int i = 0;i<g[v].size();i++){
int to = g[v][i].first;
int x = g[v][i].second;
if(c[to]) x = 0;
// c[to] = 1;
int btt = bitmask;
if(IS[to] && !c[to]){
btt+=(1<<(IS[to]-1));
}
dfs(to,btt,val+x);
// c[to] = 0;
}
// c[v] = 0;
}
int main(){
int m;
scanf("%d%d%d",&n,&k,&m);
for(int i = 1;i<=k;i++){
scanf("%d",&a[i]);
IS[a[i]] = i;
}
for(int i = 1;i<=m;i++){
int x,y,z;
scanf("%d%d%d",&x,&y,&z);
g[x].push_back({y,z});
g[y].push_back({x,z});
}
memset(dp,-1,sizeof(dp));
for(int i = 1;i<=k;i++){
memset(c,0,sizeof(c));
dfs(a[i],1<<(IS[a[i]]-1),0);
}
cout<<ans<<endl;
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... |