reach other cities from the capital, i.e. the sum of minimal time needed to travel from the capital to city...比赛最后一分钟发现数组没有long long int....还有在更新s数组的要加等号,#include
#include
#include
#include
#include...cot=0;
for(int i=1;i<=m;i++)
{
scanf("%d%d%lld%lld",&x,&y,&xx,&yy);...add(x,y,xx,yy);
add(y,x,xx,yy);
}
ans1=0;ans2=0;
Dijkstra();