题意:不说。
solution:
直接用dij跑一变最短路,然后我们会得到一些可以走的边,把它们加进一个新图中即可,然后跑一遍dp就好了(因为ta是个dag)
CODE
#include<cstdio>
#include<algorithm>
#include<queue>
#include<vector>
#include<cstring>
#define fo(i,a,b)for (int (i)=(a);(i)<=(b);(i)++)
using namespace std;
const int N=1000+55;
const int M=1e+6+55;
#include<cstdio>
#include<queue>
using namespace std;
struct node
{
int x,y;
bool operator < (const node & a) const
{
return x>a.x;
}
}k;
priority_queue <node> q;
int head[N],to[M*2],ne[M*2],w[M*2],tot=1,dis[N];
int f[N];
bool vis[N];
void R(int &x)
{
int f=1;x=0;char s=getchar();
while(s<'0'||s>'9'){if(s=='-')f=-1;s=getchar();}
while(s>='0'&&s<='9'){x=x*10+s-'0';s=getchar();}
x*=f;
}
void add(int x,int y,int z)
{
to[++tot]=y;
ne[tot]=head[x];
w[tot]=z;
head[x]=tot;
}
void dij(int s)
{
for (int i=0;i<N;i++)dis[i]=2147483647;
dis[s]=0;
q.push((node){0,s});
int x,v;
while (q.size()){
x=q.top().y;q.pop();
if (vis[x]) continue;
vis[x]=1;
for(int i=head[x];i;i=ne[i]){
v=to[i];
if (dis[v]>dis[x]+w[i]){
dis[v]=dis[x]+w[i];
q.push((node){dis[v],v});
}
}
}
}
int dfs(int x)
{
if (x==2) return 1;
int ans=0,v;
if (f[x]>0) return f[x];
for (int i=head[x];i;i=ne[i]){
v=to[i];
if(dis[x]>dis[v]) ans+=dfs(v);
}
return f[x]=ans;
}
int main(){
int n,m,x,y,z,s;
while (scanf("%d",&n)&&n){
memset(head,0,sizeof(head));
tot=1;
scanf("%d",&m);
fo(i,1,m){
R(x);R(y);R(z);
add(x,y,z);add(y,x,z);
}
while (q.size()) q.pop();
dij(2);
memset(f,0,sizeof(f));
memset(vis,0,sizeof(vis));
dfs(1);
printf("%d\n",f[1]);
}
}
: