严格次短路：

参考Roadblocks POJ - 3255：
洛谷P2865 [USACO06NOV]路障Roadblocks：
一、直接Dijkstra：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<map>
#include<queue>
#include<set>
#define ll long long
#define llu unsigned ll
using namespace std;
const int mod=1000000007;
const int maxn=200100;
const int maxx=5200;
const int inf=0x3f3f3f3f;
int head[maxx],edge[maxn],ver[maxn],nt[maxn];
int d1[maxx],d2[maxn];
int tot=1,n,m;


void add(int x,int y,int z)
{
   
    ver[++tot]=y,edge[tot]=z;
    nt[tot]=head[x],head[x]=tot;
}

int Dij(void)
{
   
    memset(d1,0x3f,sizeof(d1));
    memset(d2,0x3f,sizeof(d2));
    d1[1]=0;
    priority_queue<pair<int,int> >q;
    q.push(make_pair(0,1));

    while(q.size())
    {
   
        int x=q.top().second;
        int nowd=-q.top().first;
        //cout<<"x:  "<<x<<"   now:  "<<nowd<<endl;
        q.pop();
        if(d2[x]<nowd) continue;
        for(int i=head[x];i;i=nt[i])
        {
   
            int y=ver[i],z=edge[i];
            int pm=nowd+z;
            if(d1[y]>pm)
            {
   
                swap(d1[y],pm);
                q.push(make_pair(-d1[y],y));
            }
            if(d1[y