例1
while(!q.empty())
{
int u=q.front();q.pop();
vis[u]=0;
FOR(j,0,g[u].size())
{
int v=g[u][j].v;
int time=g[u][j].time;
if(dis[v]>dis[u]+time)
{
dis[v]=dis[u]+time;
ans[v]=ans[u]+point[v];
if(!vis[v])
{
vis[v]=1;
q.push(v);
}
}
else if(dis[v]==dis[u]+time)
{
if(ans[v]<ans[u]+point[v])
{
ans[v]=ans[u]+point[v];
if(!vis[v])
{
vis[v]=1;
q.push(v);
}
}
}
}
}
求一张图内a点到b点的最短路并打印出路径 -来源 51Nod1459
代码
#include<cstdio>
#include<cstring>
#include<string>
#include<queue>
#include<algorithm>
#include<map>
#include<stack>
#include<iostream>
#include<vector>
#include<cmath>
#include<cstring>
#include<string>
#include<queue>
#include<algorithm>
#include<map>
#include<stack>
#include<iostream>
#include<vector>
#include<cmath>
#define INF 0x7fffffff
#define eps 1e-8
#define LL long long
#define PI 3.141592654
#define CLR(a,b) memset(a,b,sizeof(a))
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define REP(i,a,b) for(int i=a;i>=b;i--)
#define sf scanf
#define pf printf
#define all(v) (v).begin(),(v).end()
#define acfun std::ios::sync_with_stdio(false)
#define eps 1e-8
#define LL long long
#define PI 3.141592654
#define CLR(a,b) memset(a,b,sizeof(a))
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define REP(i,a,b) for(int i=a;i>=b;i--)
#define sf scanf
#define pf printf
#define all(v) (v).begin(),(v).end()
#define acfun std::ios::sync_with_stdio(false)
#define SIZE (1000 +2)
#define MOD 1000000007
using namespace std;
#define MOD 1000000007
using namespace std;
struct node
{
int v,time;
void init(int vv,int tt)
{
v=vv,time=tt;
}
};
{
int v,time;
void init(int vv,int tt)
{
v=vv,time=tt;
}
};
vector<node>g[SIZE];
int n,m;
int point[SIZE];
int n,m;
int point[SIZE];
void SPFA(int start,int thend)
{
queue<int>q;
bool vis[SIZE];
int dis[SIZE];
int ans[SIZE];
CLR(vis,0);
CLR(ans,0);
{
queue<int>q;
bool vis[SIZE];
int dis[SIZE];
int ans[SIZE];
CLR(vis,0);
CLR(ans,0);
FOR(i,0,n+1)
dis[i]=INF;
q.push(start);
vis[start]=1;
dis[start]=0;
dis[i]=INF;
q.push(start);
vis[start]=1;
dis[start]=0;
while(!q.empty())
{
int u=q.front();q.pop();
vis[u]=0;
FOR(j,0,g[u].size())
{
int v=g[u][j].v;
int time=g[u][j].time;
if(dis[v]>dis[u]+time)
{
dis[v]=dis[u]+time;
ans[v]=ans[u]+point[v];
if(!vis[v])
{
vis[v]=1;
q.push(v);
}
}
else if(dis[v]==dis[u]+time)
{
if(ans[v]<ans[u]+point[v])
{
ans[v]=ans[u]+point[v];
if(!vis[v])
{
vis[v]=1;
q.push(v);
}
}
}
}
}
pf("%d %d\n",dis[thend],ans[thend]+point[start]);
}
}
int main()
{
int start,thend;
while(~sf("%d%d%d%d",&n,&m,&start,&thend))
{
FOR(i,0,n+1)
g[i].clear();
{
int start,thend;
while(~sf("%d%d%d%d",&n,&m,&start,&thend))
{
FOR(i,0,n+1)
g[i].clear();
FOR(i,0,n)
sf("%d",&point[i]);
while(m--)
{
int u,v,t;
sf("%d%d%d",&u,&v,&t);
sf("%d",&point[i]);
while(m--)
{
int u,v,t;
sf("%d%d%d",&u,&v,&t);
node tmp;
tmp.init(v,t);
g[u].push_back(tmp);
tmp.init(u,t);
g[v].push_back(tmp);
}
tmp.init(v,t);
g[u].push_back(tmp);
tmp.init(u,t);
g[v].push_back(tmp);
}
SPFA(start,thend);
}
}
}
}