官方题解如下:
We consider a train route (1, v) as an undirected deletable edge(1, v).
Let dist(u) be the shortest path between1 and u. We add all of the edges(u, v) weighted w where dist(u) + w = dist(v) into a new directed graph.
A deletable edge (1, v) can be deleted only if it isn't in the new graph or the in-degree ofv in the new graph is more than 1, because the connectivity of the new graph won't be changed after deleting these edges.
这道题起初是没有一点思路的,今天看题解才发现自己题意都没有审清楚,我以为火车边是任意的,其实起点是固定的,就是出发点。
虽然似乎影响不大,其实思想很简单,先做最短路时进行松弛更新得到最终结果,在对每条边去考虑,就类似于当初的松弛过程,只是现在结果已经出来,就只需要验证所考虑的这条边是不是松弛所可能需要的,如果是可能需要的,就记录下来。直到最后,对于更新最短路所可能需要的那些火车路中,如果终点的入度不唯一(也就是说有其他选择),那么这条火车边就是可以去除的。由于火车边的起点是出发点,所以可以看做单向边(不可能退回出发点更优吧),所以这时只要考虑终点如果有其他更优选择,就可以去除,这就是这个地方的影响吧。第一次wa了,因为我以为int的最大整数大概3*10^10左右,其实只有2*10^9多一点,所以理所当然要用long long 计算和路径相关的。代码如下:(第一次写spfa,零零碎碎写了许久,写的很挫)
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <queue>
#include <deque>
using namespace std;
#define inf 10000000000000LL
const int maxn = 100010;
struct Edge
{
int from,to,next;
long long val;
int flag;
}ee[maxn*8];
int inq[maxn],cnt,head[maxn];
long long dist[maxn];
void addedge(int from,int to,int val,int flag)
{
ee[cnt].from = from;
ee[cnt].to = to;
ee[cnt].val = val;
ee[cnt].next = head[from];
ee[cnt].flag = flag;
head[from] = cnt++;
}
int n,m,k;
int ee_code[maxn*8],ee_num,in_deg[maxn];
void SPFA()
{
for(int i = 1;i<=n;i++)
dist[i] = inf;
deque<int> q;
memset(inq,0,sizeof(inq));
q.push_back(1);
inq[1] = 1;
dist[1] = 0;
while(!q.empty())
{
int cur = q.front();
q.pop_front();
inq[cur] = 0;
for(int i = head[cur]; i != -1; i = ee[i].next)
{
int to = ee[i].to;
if(dist[cur]+ee[i].val<dist[to])
{
dist[to] = dist[cur]+ee[i].val;
if(!inq[to])
{
if(!q.empty()&&dist[to]<dist[q.front()])
q.push_front(to);
else
q.push_back(to);
inq[to] = 1;
}
}
}
}
}
int main()
{
scanf("%d%d%d",&n,&m,&k);
cnt = 0;
int u,v,t;
memset(head,-1,sizeof(head));
for(int i = 0;i<m;i++)
{
scanf("%d%d%d",&u,&v,&t);
addedge(u,v,t,0);
addedge(v,u,t,0);
}
for(int i = 0;i<k;i++)
{
scanf("%d%d",&v,&t);
addedge(1,v,t,1);
}
SPFA();
//system("PAUSE");
ee_num = 0;
for(int i = 0;i<cnt;i++)
{
if( dist[ee[i].from]+ee[i].val == dist[ee[i].to])
{
ee_code[ee_num++] = i;
}
}
int ans = 0,temp = 0;
memset(in_deg,0,sizeof(in_deg));
for(int i = 0;i<ee_num;i++)
{
in_deg[ee[ee_code[i] ].to]++;
if(ee[ee_code[i] ].flag){
ans++;
if(in_deg[ee[ee_code[i] ].to]>1)
temp++;
}
}
ans = (k-ans);
ans+=temp;
cout<<ans<<endl;
return 0;
}