POJ2387 Til the Cows Come Home【Dijkstra】

Til the Cows Come Home

---

最短路裸题，如果是邻接表存图，则要小心重边。换作是链式前向星存图就没事了。

#include<algorithm>
#include<iostream>
#include<cstring>
#include<iomanip>
#include<cstdio>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;

inline int read() {
   int s = 0, w = 1;
   char ch = getchar();
   while(ch < '0' || ch > '9'){if(ch == '-') w = -1; ch = getchar();}
   while(ch >= '0' && ch <= '9') s = s * 10 + ch - '0', ch = getchar();
   return s * w;
}

const int N = 2e3 + 10;
int n, m, cnt, head[N];
int dis[N], pre[N], vis[N];
struct edge {	int to, w, next;} e[N << 1]; 
struct node {
	int id, s;
	node(int id, int s): id(id), s(s){}
	bool operator<(const node &a)const { return a.s < s;}
};
void addedge(int u, int v, int w) {	e[cnt].to = v, e[cnt].w = w, e[cnt].next = head[u]; \
									head[u] = cnt++;}
void doubleadd(int u, int v, int w) {	addedge(u, v, w); addedge(v, u, w);}

void init() {
	cnt = 0;
	for(int i = 0; i < N; i++) {	dis[i] = inf, head[i] = pre[i] = -1; vis[i] = 0;}
}

void run() {
	priority_queue<node> Q;
	dis[n] = 0;
	Q.push(node(n, 0));
	while(!Q.empty()) {
		node u = Q.top(); Q.pop();
		if(vis[u.id])	continue;
		vis[u.id] = 1;
		for(int i = head[u.id]; ~i; i = e[i].next) {
			edge v = e[i];
			if(!vis[v.to] && dis[v.to] > dis[u.id] + v.w) {
				dis[v.to] = dis[u.id] + v.w;
				Q.push(node(v.to, dis[v.to]));
				pre[v.to] = u.id;
			}
		}
	}
	printf("%d\n", dis[1]);
}

int main() {
	while(~scanf("%d%d", &m, &n)){
		init();
		while(m--) {
			int u = read(), v = read(), w = read();
			doubleadd(u, v, w);
		}
		run();
	}
	return 0;
}