Highway Project---zoj3946（最短路SPFA）

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<queue>
#include<vector>
using namespace std;
#define N 100050
typedef long long LL;
const LL INF = (1ll<<60)-1;
struct node
{
int v;
LL cost, time;
node(int v0=0, LL c=0, LL t=0) : v(v0),cost(c), time(t){}
};

vector<vector<node> >G;
int n, vis
;
LL Cost
, Time
;

void SPFA()
{
for(int i=0; i<n; i++)
{
Cost[i] = Time[i] = INF;
vis[i] = 0;
}
Cost[0] = Time[0] = 0;

queue<int>Q;
Q.push(0);

while(Q.size())
{
int p = Q.front(); Q.pop();

vis[p] = 0;

int len = G[p].size();
for(int i=0; i<len; i++)
{
node q = G[p][i];
if(Time[q.v] > Time[p]+q.time || (Time[q.v]==Time[p]+q.time&&Cost[q.v]>q.cost))
{
Time[q.v] = Time[p]+q.time;
Cost[q.v] = q.cost;
if(!vis[q.v])
{
vis[q.v] = 1;
Q.push(q.v);
}
}
}
}
LL TimeSum = 0, CostSum = 0;
for(int i=1; i<n; i++)
{
TimeSum += Time[i];
CostSum += Cost[i];
}
printf("%lld %lld\n", TimeSum, CostSum);
}

int main()
{
int T, m;
//cout<<INF;
scanf("%d", &T);
while(T--)
{
scanf("%d %d", &n, &m);
G.clear();
G.resize(n+2);

for(int i=0; i<m; i++)
{
int u, v;
LL cost, time;
scanf("%d %d %lld %lld", &u, &v, &time, &cost);
G[u].push_back(node(v, cost, time));
G[v].push_back(node(u, cost, time));
}

SPFA();
}
return 0;
}