返利网站制作,wordpress底部添加菜单,社保个人网站入口,设计素材网站01135. 新年好 - AcWing题库 思路#xff1a; 1.先预处理出1,a,b,c,d,e到其他点的单源最短路#xff0c;也就是进行6次Dijkstra 2.计算以1为起点的这6个数的全排列#xff0c;哪种排列方式所得距离最小#xff0c;也可以使用dfs
1.Dijkstradfs #define int long longusing …1135. 新年好 - AcWing题库 思路 1.先预处理出1,a,b,c,d,e到其他点的单源最短路也就是进行6次Dijkstra 2.计算以1为起点的这6个数的全排列哪种排列方式所得距离最小也可以使用dfs
1.Dijkstradfs #define int long longusing namespace std;typedef pairint,int PII;constexpr int N 2e55;
int dist[6][N];
bool st[50005];
int n,m,h[N],w[N],ne[N],e[N],idx;
int rela[N];
int ans;void add(int a,int b,int c)
{e[idx]b,ne[idx]h[a],w[idx]c,h[a]idx;
}void Dijkstra(int s, int dist[])
{memset(dist, 0x3f, N*4);//int是4字节所以大小就是4*Nmemset(st,0,sizeof st);dist[s]0;priority_queuePII,vectorPII,greaterPII heap;heap.push({0,s});while(heap.size()){auto [c,t] heap.top();heap.pop();if(st[t]) continue;st[t]true;for(int ih[t];~i;ine[i]){int je[i];if(dist[j]cw[i]){dist[j]cw[i];heap.push({dist[j],j});}}}
}int dfs(int u,int num,int dis)
{if (num6){return dis;}int ret0x3f3f3f3f;for (int i1;i5;i){if (!st[i]){st[i] 1;ret min(ret,dfs(i,num1,disdist[u][rela[i]]));st[i] 0;}}return ret;
}void solve()
{cinnm;rela[0]1;for(int i1;i5;i){cinrela[i];}memset(h,-1,sizeof h);while(m--){int a,b,c;cinabc;add(a,b,c),add(b,a,c);}for(int i0;i5;i){Dijkstra(rela[i],dist[i]);}memset(st,false,sizeof st);coutdfs(0,1,0);
}int32_t main()
{int t;//cint;t1;while(t--) solve();
}
2.Dijkstra全排列
#define int long longusing namespace std;typedef pairint,int PII;constexpr int N 2e55;
int dist[6][N];
bool st[50005];
int n,m,h[N],w[N],ne[N],e[N],idx;
int rela[N],order[6];
int ans;void add(int a,int b,int c)
{e[idx]b,ne[idx]h[a],w[idx]c,h[a]idx;
}void Dijkstra(int s, int dist[])
{memset(st,0,sizeof st);dist[s]0;priority_queuePII,vectorPII,greaterPII heap;heap.push({0,s});while(heap.size()){auto [c,t] heap.top();heap.pop();if(st[t]) continue;st[t]true;for(int ih[t];~i;ine[i]){int je[i];if(dist[j]cw[i]){dist[j]cw[i];heap.push({dist[j],j});}}}
}void solve()
{memset(dist,0x3f,sizeof dist);cinnm;order[0]0;rela[0]1;for(int i1;i5;i){order[i]i;cinrela[i];}memset(h,-1,sizeof h);while(m--){int a,b,c;cinabc;add(a,b,c),add(b,a,c);}for(int i0;i5;i){Dijkstra(rela[i],dist[i]);}memset(st,false,sizeof st);ans0x3f3f3f3f;do{if(order[0]!0) break;int sumdist[0][rela[order[1]]];for(int i1;i15;i)sumdist[order[i]][rela[order[i1]]];ansmin(ans,sum);}while(next_permutation(order,order6));coutans;
}int32_t main()
{int t;//cint;t1;while(t--) solve();
}
