思路
:还是蛮简单的,建边跑一遍最短路求和,再反向建边跑一遍求和,相加即可。
注意点
:
- Hdu题目的限制内存很小,会刚刚卡到MLE。
题目中顶点数<=1e6,很大很大。反向建边时,不要开两个vector<edge>G1[Max_v],G2[Max_v];
,会多次MLE,因为vector的内存增长机制,每次内存不够时,会新分配原先2倍的空间。详见<vector空间的动态增长> - Hdu测试数据较水,Hdu一发AC,可能Poj多次WA。
题目要求Prices are positive integers the sum of which is smaller than 1000000000.
,所有的价格和<=1e9,我们知道Int型最大大约为2e9多一点,不会爆Int,但是但是,我们是跑两遍求所有dist[x]的和,所有的dist[x]<1e9,但是加起来的和sum可能会爆Int啊!所以sum必为long long型。
以下两种算法均在Poj跑的~
SPFA算法
:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
#define ll long long
const int inf=0x3f3f3f3f;
const int Max_v=1e6+1;
struct edge{
int to,cost;
edge(int t,int c):to(t),cost(c){};
};
int t,n,m;
int dist[Max_v];
int vis[Max_v];
int x[Max_v],y[Max_v],d[Max_v]; //存坐标
vector<edge>G[Max_v];
ll SPFA(int s){
memset(dist,0x3f,sizeof(dist));
memset(vis,0,sizeof(vis));
queue<int>que;
que.push(s);
dist[s]=0;vis[s]=1;
while(!que.empty()){
int u=que.front();que.pop();
vis[u]=0;
for(int i=0;i<G[u].size();i++){
int v=G[u][i].to;
int d=dist[u]+G[u][i].cost;
if(dist[v]>d){
dist[v]=d;
if(!vis[v]){vis[v]=1;que.push(v);}
}
}
}
ll sum=0;
for(int i=1;i<=n;i++)sum+=dist[i];
return sum;
}
int main()
{
scanf("%d",&t);
while(t--){
scanf("%d%d",&n,&m);
for(int i=0;i<=n;i++)G[i].clear();
for(int i=0;i<m;i++){
scanf("%d%d%d",&x[i],&y[i],&d[i]);
G[x[i]].push_back(edge(y[i],d[i]));
}
ll sum=SPFA(1);
for(int i=0;i<=n;i++)G[i].clear();
for(int i=0;i<m;i++)G[y[i]].push_back(edge(x[i],d[i]));
sum+=SPFA(1);
printf("%I64d\n",sum);
}
return 0;
}
Dijkstra算法
:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
#define ll long long
typedef pair<int,int> P;
const int inf=0x3f3f3f3f;
const int Max_v=1e6+1;
struct edge{
int to,cost;
edge(int t,int c):to(t),cost(c){};
};
int t,n,m;
int dist[Max_v];
int x[Max_v],y[Max_v],d[Max_v]; //存坐标
vector<edge>G[Max_v];
ll Dijkstra(int s){
memset(dist,0x3f,sizeof(dist));
dist[s]=0;
priority_queue<P,vector<P>,greater<P> >que; //按照first从小到大顺序取出
que.push(P(0,s));
while(!que.empty()){
P p=que.top();que.pop();
int v=p.second;
if(p.first>dist[v])continue;
for(int i=0;i<G[v].size();i++){
edge e=G[v][i];
if(dist[e.to]>dist[v]+e.cost){
dist[e.to]=dist[v]+e.cost;
que.push(P(dist[e.to],e.to));
}
}
}
ll sum=0;
for(int i=1;i<=n;i++)sum+=dist[i];
return sum;
}
int main()
{
scanf("%d",&t);
while(t--){
scanf("%d%d",&n,&m);
for(int i=0;i<=n;i++)G[i].clear();
for(int i=0;i<m;i++){
scanf("%d%d%d",&x[i],&y[i],&d[i]);
G[x[i]].push_back(edge(y[i],d[i]));
}
ll sum=Dijkstra(1);
for(int i=0;i<=n;i++)G[i].clear();
for(int i=0;i<m;i++)G[y[i]].push_back(edge(x[i],d[i]));
sum+=Dijkstra(1);
printf("%I64d\n",sum);
}
return 0;
}