Brief Description:
给你一个n个点的有向图,节点编号为1到n,现在从节点1派出n-1个人到其他n-1个点,再从这n-1个点回到节点1,现在要求这n-1个人走的总路径长度最短,求这个路径长度。
Analysis:
从节点1到其他n-1个点可以用单源最短路。
从n-1个点回到节点1怎么办?
很简单,把原来的有向图的有向边反过来,然后求源点为1的单源最短路就行了!
这题不难,主要是(dijkstra+heap,spfa)的模板。
dijkstra+heap:
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <vector>
#include <queue>
#define INF 1010000000
using namespace std;
const int maxn = 1001000;
struct node{
int id,w;
node(){}
node(int _id,int _w){
id = _id; w = _w;
}
bool operator<(const node &p)const{
return w > p.w; // basic coding
}
};
vector<node>V[maxn];
int n,m;
int x[maxn],y[maxn],z[maxn],dis[maxn];
bool vis[maxn];
priority_queue<node>pq; //试着放入dij中
int dij(){
int i,j;
int Size = (int)V[1].size();
while(!pq.empty()) pq.pop(); // basic coding
memset(dis,0x3f,sizeof(dis));
memset(vis,0,sizeof(vis));
vis[1] = 1;
for(i=0; i<Size; i++){
pq.push(node(V[1][i].id,V[1][i].w));
dis[V[1][i].id] = V[1][i].w;
}
node T;
int ret = 0;
while(!pq.empty()){ // basic doding..
T = pq.top(); pq.pop();
if(!vis[T.id]){ // important!!
ret += dis[T.id];
vis[T.id] = 1;
Size = (int)V[T.id].size();
for(i=0; i<Size; i++){
int id = V[T.id][i].id;
int w = V[T.id][i].w;
if(!vis[id] && dis[T.id]+w<dis[id]){
dis[id] = dis[T.id] + w;
pq.push(node(id,dis[id]));
}
}
}
}
return ret;
}
int main()
{
int cas;
scanf("%d",&cas);
while(cas--){
int i;
scanf("%d%d",&n,&m);
for(i=0; i<m; i++) scanf("%d%d%d",x+i,y+i,z+i);
for(i=1; i<=n; i++) V[i].clear();
for(i=0; i<m; i++) V[x[i]].push_back(node(y[i],z[i]));
int ans1 = dij();
for(i=1; i<=n; i++) V[i].clear();
for(i=0; i<m; i++) V[y[i]].push_back(node(x[i],z[i]));
int ans2 = dij();
printf("%d\n",ans1+ans2);
}
return 0;
}
spfa:
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <vector>
#include <queue>
#define INF 1010000000
using namespace std;
const int maxn = 1001000;
struct node{
int id,w;
node(){}
node(int _id,int _w){
id = _id; w = _w;
}
bool operator<(const node &p)const{
return w > p.w; // basic coding
}
};
vector<node>V[maxn];
int n,m;
int x[maxn],y[maxn],z[maxn],dis[maxn];
bool vis[maxn];
int spfa(){
int i;
int T;
queue<int>Q;
memset(vis,0,sizeof(vis));
memset(dis,0x3f,sizeof(dis));
dis[1] = 0;
vis[1] = 1;
Q.push(1);
while(!Q.empty()){
T = Q.front(); Q.pop();
vis[T] = 0;
int Size = (int)V[T].size();
for(i=0; i<Size; i++){
int id = V[T][i].id;
int w = V[T][i].w;
if(dis[T]+w < dis[id]){
dis[id] = dis[T] + w;
if(!vis[id]){
Q.push(id); vis[id] = 1;
}
}
}
}
int ret = 0;
for(i=1; i<=n; i++) ret += dis[i];
return ret;
}
int main()
{
int cas;
scanf("%d",&cas);
while(cas--){
int i;
scanf("%d%d",&n,&m);
for(i=0; i<m; i++) scanf("%d%d%d",x+i,y+i,z+i);
for(i=1; i<=n; i++) V[i].clear();
for(i=0; i<m; i++) V[x[i]].push_back(node(y[i],z[i]));
int ans1 = spfa();
for(i=1; i<=n; i++) V[i].clear();
for(i=0; i<m; i++) V[y[i]].push_back(node(x[i],z[i]));
int ans2 = spfa();
printf("%d\n",ans1+ans2);
}
return 0;
}