POJ 3159 差分约束+迪杰斯特拉+优先队列图的数据结构用数组表示

最新推荐文章于 2024-07-10 15:30:00 发布

明太鱼

最新推荐文章于 2024-07-10 15:30:00 发布

阅读量350

点赞数

分类专栏：最短路径

本文链接：https://blog.csdn.net/u010270082/article/details/38442337

版权

最短路径专栏收录该内容

5 篇文章 0 订阅

订阅专栏

#include<cstdio>
#include<cstring>
#include<iostream>
#include<iomanip>
#include<queue>
#include<cmath>
#include<stack>
#include<map>
#include<vector>
#include<set>
#include<algorithm>
using namespace std;
typedef long long LL;
const int int_max = 0x07777777;
const int int_min = 0x80000000;
const int maxn = 31000;
const int maxm = 160000;
struct HeapNode{
    int u,d;
    HeapNode(int _u, int _d):u(_u),d(_d){}
    bool operator < (const HeapNode& a) const {
        return d > a.d;
    }
};
struct Edge {
    int e,v;
}es[160000];
int neg;
int node[maxn];
int nexte[maxm];
int n,m; 
bool done[maxn];
int d[maxn],p[maxn];
void addedge (int s, int e, int v){
    es[neg].e = e;
    es[neg].v = v;
    nexte[neg] = node[s];
    node[s] = neg++;
}
void dij (int s){
    for(int i = 0; i <= n; i++) d[i] = int_max;
    memset(done, 0, sizeof(done));

    d[s] = 0;
    priority_queue<HeapNode> q;
    q.push(HeapNode(s,0));
    while(!q.empty()){
        HeapNode x = q.top();
        q.pop();
        int u = x.u;
        if(done[u]) continue;
        done[u] = true;
        int p = node[u];
        while (p!=-1) {
            if(d[es[p].e] > d[u]+es[p].v){
                d[es[p].e] = d[u]+es[p].v;
                q.push(HeapNode(es[p].e,d[es[p].e]));
            }
            p = nexte[p];
        }
    }
}