[AHOI2002]哈利·波特与魔法石

这道题比较简单，就是一个最短路（SSSP）。数据水，用Floyd即可AC。这里用了Dijkstra。

 #include <iostream>
 #include <cstdio>
 #include <cstring>
 #include <algorithm>
 #include <queue>

 using namespace std;

 #define re register
 #define rep(i, a, b) for (re int i = a; i <= b; ++i)
 #define repd(i, a, b) for (re int i = a; i >= b; --i)
 #define maxx(a, b) a = max(a, b);
 #define minn(a, b) a = min(a, b);
 #define LL long long
 #define inf (1 << 30)

 inline int read() {
     int w = , f = ; char c = getchar();
     while (!isdigit(c)) f = c == '-' ? - : f, c = getchar();
     while (isdigit(c)) w = (w << ) + (w << ) + (c ^ ''), c = getchar();
     return w * f;
 }

 const int maxn =  + , maxm = 1e4 + ;

 struct Edge {
     int u, v, w, pre;
 };

 struct Node {
     int u, d;
     bool operator < (const Node &rhs) const {
         return d > rhs.d;
     }
 };

 int way[] = {, , , , , , , };

 priority_queue<Node> Q;

 struct Graph {
 #define iter(i, u) for (re int i = G[u]; i; i = edges[i].pre)
     Edge edges[maxm << ];
     int n, m;
     int G[maxn];
     int dis[maxn], vis[maxn];
     void init(int n) {
         this->n = n;
         m = ;
         memset(G, , sizeof(G));
     }
     void AddEdge(int u, int v, int w) {
         edges[++m] = (Edge){u, v, way[w], G[u]};
         G[u] = m;
         edges[++m] = (Edge){v, u, way[w], G[v]};
         G[v] = m;
     }
     void dijkstra(int s) {
         memset(vis, , sizeof(vis));
         memset(dis, 0x3f, sizeof(dis));
         dis[s] = ;
         Q.push((Node){s, });
         while (!Q.empty()) {
             int u = Q.top().u; Q.pop();
             if (vis[u]) continue;
             vis[u] = ;
             iter(i, u) {
                 Edge &e = edges[i];
                 if (dis[u] + e.w < dis[e.v]) {
                     dis[e.v] = dis[u] + e.w;
                     Q.push((Node){e.v, dis[e.v]});
                 }
             }
         }
     }
 } G;

 int s, t, m;

 int main() {
     freopen("ques.in", "r", stdin);
     freopen("ques.out", "w", stdout);

     rep(i, , )
         if (read()) way[i] >>= ;

     s = read(), t = read();

     G.init();

     m = read();

     rep(i, , m) {
         int u = read(), v = read(), w = read();
         G.AddEdge(u, v, w);
     }

     G.dijkstra(s);

     printf("%d", G.dis[t]);

     return ;
 }

#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <queue>
using namespace std;
#define re register#define rep(i, a, b) for (re int i = a; i <= b; ++i)#define repd(i, a, b) for (re int i = a; i >= b; --i)#define maxx(a, b) a = max(a, b);#define minn(a, b) a = min(a, b);#define LL long long#define inf (1 << 30)
inline int read() {int w = 0, f = 1; char c = getchar();while (!isdigit(c)) f = c == '-' ? -1 : f, c = getchar();while (isdigit(c)) w = (w << 3) + (w << 1) + (c ^ '0'), c = getchar();return w * f;}
const int maxn = 100 + 5, maxm = 1e4 + 5;
struct Edge {int u, v, w, pre;};
struct Node {int u, d;bool operator < (const Node &rhs) const {return d > rhs.d;}};
int way[8] = {0, 2, 6, 4, 8, 6, 10, 14};

priority_queue<Node> Q;
struct Graph {#define iter(i, u) for (re int i = G[u]; i; i = edges[i].pre)Edge edges[maxm << 1];int n, m;int G[maxn];int dis[maxn], vis[maxn];void init(int n) {this->n = n;m = 0;memset(G, 0, sizeof(G));}void AddEdge(int u, int v, int w) {edges[++m] = (Edge){u, v, way[w], G[u]};G[u] = m;edges[++m] = (Edge){v, u, way[w], G[v]};G[v] = m;}void dijkstra(int s) {memset(vis, 0, sizeof(vis));memset(dis, 0x3f, sizeof(dis));dis[s] = 0;Q.push((Node){s, 0});while (!Q.empty()) {int u = Q.top().u; Q.pop();if (vis[u]) continue;vis[u] = 1;iter(i, u) {Edge &e = edges[i];if (dis[u] + e.w < dis[e.v]) {dis[e.v] = dis[u] + e.w;Q.push((Node){e.v, dis[e.v]});}}}}} G;
int s, t, m;
int main() {freopen("ques.in", "r", stdin);freopen("ques.out", "w", stdout);
rep(i, 1, 7) if (read()) way[i] >>= 1;
s = read(), t = read();
G.init(100);
m = read();
rep(i, 1, m) {int u = read(), v = read(), w = read();G.AddEdge(u, v, w);}
G.dijkstra(s);
printf("%d", G.dis[t]);
return 0;}