pku 1511 Invitation Cards (SPFA 和 dijkstra+优先级队列优化)

简单的最短路题目，只需建两次图，分别调用单源最短路算法即可。

 

但是由于数据量较大，所以需要用邻接表存储，以及对普通算法进行些优化。

 

注意最后的求和需要用long long型变量存储

 

分别用SPFA  和  加了优先级队列的dijkstra写了一遍，效率差不多，用的STL的priority_queue，如果手写堆的话应该可以更快。

 

SPFA版本：

1511

Accepted

33016K

1750MS

G++

2397B

#include <stdlib.h> #include <cstdio> #include <iostream> #include <algorithm> #include <queue> #include <cstring> using namespace std; struct node { int u; int v; int c; } num[1000010]; const int inf = 0x7fffffff; int e[1000010]; int head[1000010]; int nxt[1000010]; int pnt[1000010]; int dis[1000010]; bool pan[1000010]; long long sum; void buildMap(int x) { int i; for (i = 0; i <= x; ++i) { pnt[i] = num[i].v; e[i] = num[i].c; nxt[i] = head[num[i].u]; head[num[i].u] = i; } return; } void buildrMap(int x) { int i; for (i = 0; i <= x; ++i) { pnt[i] = num[i].u; e[i] = num[i].c; nxt[i] = head[num[i].v]; head[num[i].v] = i; } return; } void spfa(int s, int n) { int i; for (i = 1; i <= n; ++i) { dis[i] = inf; pan[i] = false; } queue<int> cq; cq.push(s); pan[s] = true; dis[s] = 0; int front; int k; int tmp; while (!cq.empty()) { front = cq.front(); cq.pop(); pan[front] = false; k = head[front]; while (k != -1) { int tmp = dis[pnt[k]]; if (dis[front] + e[k] < dis[pnt[k]]) dis[pnt[k]] = dis[front] + e[k]; if (tmp != dis[pnt[k]] && !pan[pnt[k]]) { cq.push(pnt[k]); pan[pnt[k]] = true; } k = nxt[k]; } } } int main() { int T; scanf("%d", &T); int ca(1); while (ca <= T) { int p, q; scanf("%d%d", &p, &q); int len; len = 0; int i; for (i = 0; i < q; ++i) scanf("%d%d%d", &num[i].u, &num[i].v, &num[i].c); for (i = 0; i <= p; ++i) head[i] = -1; buildMap(q); sum = 0; spfa(1, p); for (i = 1; i <= p; ++i) sum += dis[i]; // printf("%lld/n", sum); for (i = 0; i <= p; ++i) head[i] = -1; buildrMap(q); spfa(1, p); for (i = 1; i <= p; ++i) sum += dis[i]; printf("%lld/n", sum); ++ca; } return 0; }

 

 

dijkstra版本：

1511

Accepted

32900K

1938MS

G++

2391B

/* * File: main.cpp * Author: coder * * Created on August 26, 2010, 3:47 PM */ #include <stdlib.h> #include <cstdio> #include <queue> using namespace std; struct node { int u; int v; int c; } num[1000010]; const int inf = 0x7fffffff; int e[1000010]; int head[1000010]; int pnt[1000010]; int nxt[1000010]; int dis[1000010]; bool vis[1000010]; long long sum; struct qnode { int dis; int v; bool operator<(const qnode & x)const { return x.dis<dis; } }; void buildMap(int n) { int i; for (i = 0; i < n; ++i) { e[i] = num[i].c; pnt[i] = num[i].v; nxt[i] = head[num[i].u]; head[num[i].u] = i; } return; } void buildrMap(int n) { int i; for (i = 0; i < n; ++i) { e[i] = num[i].c; pnt[i] = num[i].u; nxt[i] = head[num[i].v]; head[num[i].v] = i; } return; } void dij(int s, int n) { int i; for (i = 0; i <= n; ++i) { dis[i] = inf; vis[i] = false; } qnode tmp; tmp.v = s; tmp.dis = 0; dis[s] = 0; priority_queue<qnode> cq; cq.push(tmp); qnode top; int k; int res = n; while (!cq.empty()) { top = cq.top(); cq.pop(); if (vis[top.v]) continue; vis[top.v] = true; k = head[top.v]; while (k != -1) { if (dis[pnt[k]] > top.dis + e[k]) { dis[pnt[k]] = top.dis + e[k]; tmp.dis = dis[pnt[k]]; tmp.v = pnt[k]; cq.push(tmp); } k = nxt[k]; } } } int main(int argc, char** argv) { int T; scanf("%d", &T); while (T--) { int p, q; scanf("%d%d", &p, &q); int i; for (i = 0; i < q; ++i) scanf("%d%d%d", &num[i].u, &num[i].v, &num[i].c); for (i = 0; i <= p; ++i) head[i] = -1; buildMap(q); sum = 0; dij(1, p); for (i = 1; i <= p; ++i) sum += dis[i]; for (i = 0; i <= p; ++i) head[i] = -1; buildrMap(q); dij(1, p); for (i = 1; i <= p; ++i) sum += dis[i]; printf("%lld/n", sum); } return (EXIT_SUCCESS); }