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
| #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
#define pair_int std::pair<int, int>
using namespace std;
template <class T>
class Queue : public std::queue<T> {
public:
T pop() {
T tmp = std::queue<T>::front();
std::queue<T>::pop();
return tmp;
}
};
#define SPFA_MAX 10010
struct node {
int v, w;
node(int v0, int w0) : v(v0), w(w0) {}
};
bool vis[SPFA_MAX];
int dis[SPFA_MAX];
vector<node> vc[SPFA_MAX];
inline void insert(int a, int b, int w) { vc[a].push_back(node(b, w)); }
inline void insert_multi(int a, int b, int w) {
vc[a].push_back(node(b, w));
vc[b].push_back(node(a, w));
}
inline int spfa(int s, int t) {
Queue<int> q;
memset(dis, 127, sizeof(dis));
q.push(s), dis[s] = 0, vis[s] = true;
while (!q.empty()) {
int now = q.pop();
vis[now] = false;
for (int i = 0; i < vc[now].size(); ++i) {
node x = vc[now][i];
if (dis[x.v] > dis[now] + x.w) {
dis[x.v] = dis[now] + x.w;
if (!vis[x.v]) vis[x.v] = true, q.push(x.v);
}
}
}
return dis[t];
}
|
