Template/Dijkstra_heap.cpp at master · nike0good/Template · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
#include<bits/stdc++.h>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=Pre[x];p;p=Next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=Next[p])
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (100000007)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int>
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case %d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
						For(j,m-1) cout<<a[i][j]<<' ';\
						cout<<a[i][m]<<endl; \
						}
typedef long long ll;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return (a-b+llabs(a-b)/F*F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
int read()
{
	int x=0,f=1; char ch=getchar();
	while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
	while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
	return x*f;
}
struct Edge{
	int from,to,dist;
};
struct HeapNode {
	int d,u;
	bool operator< (const HeapNode& rhs) const {
		return d > rhs.d;
	}
};
#define MAXN (1000)
struct Dijkstra {
	int n,m;
	vector<Edge> edges;
	vector<int> G[MAXN];
	bool done[MAXN];
	int d[MAXN];
	int p[MAXN]; //×î¶ÌÂ·ÖÐÉÏÒ»Ìõ±ß
	int pnode[MAXN];
	void addedge(int u,int v,int w){
		edges.pb((Edge){u,v,w});
		G[u].pb(m++);
	}
	void addedge2(int u,int v,int w) {
		addedge(u,v,w);addedge(v,u,w);
	}
	void init(int _n){
		n=_n; m = 0;
		Rep(i,n) G[i].clear();
		edges.clear();
	}
	void dijkstra(int s) {
		priority_queue<HeapNode> Q;
		Rep(i,n) d[i]=INF,pnode[i]=-1;
		d[s]=0;
		MEM(done)
		Q.push((HeapNode){0,s});
		while(!Q.empty()) {
			HeapNode x=Q.top(); Q.pop();
			int u=x.u;
			if (done[u]) continue;
			done[u]=1;
			int mm=G[u].size();
			Rep(i,mm) {
				Edge e = edges[G[u][i]];
				if (d[e.to]>d[u]+e.dist) {
					d[e.to]=d[u]+e.dist;
					p[e.to]=G[u][i];
					pnode[e.to]=u;
					Q.push((HeapNode){d[e.to],e.to});
				}
			}
		}
	}
}S1;
int main()
{
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);


	return 0;
}