Roadblocks （次短路）(Dijkstra应用)

到某个顶点的次短路要么是到其他某个顶点u的最短路加上u->v的边，或者是到u的次短路加上u->v

#include<stdio.h>
#include<iostream>
#include<vector>
using namespace std;
#include<algorithm>
#include<string.h>
#include<algorithm>
#include<queue>
#define maxn 5010
const int INF = 1000000000;
int N,R;//顶点数，边数
int dis[maxn],dis2[maxn];
struct edge
{
    int to,cost;
    edge() {}
    edge(int x,int y)
    {
        to=x;cost=y;
    }
};
typedef pair<int ,int>P;
vector<edge>G[maxn];
int dist[maxn];
int dist2[maxn];
void dijkstra(int s) {
    priority_queue<P,vector<P>,greater<P> >que;
    for(int i=0;i<=N;i++) dist[i]=INF;
    for(int i=0;i<=N;i++) dist2[i]=INF;
    dist[s]=0;
    que.push(P(0,s));

    while(!que.empty()) {
        P p=que.top(); que.pop();
        int v=p.second, d=p.first;
        if(dist2[v]<d) contin