HNU 12847 Dwarf Tower（最短路+队列优化）

 1 #include<cstdio>
 2 #include<cstring>
 3 #include<iostream>
 4 #include<algorithm>
 5 #include<vector>
 6 #include<cmath>
 7 #include<deque>
 8 using namespace std;
 9 const int maxn = 10000+5;
10 struct node
11 {
12     int a,b;
13 };
14 int w[maxn],visit[maxn];
15 vector<node> vt[maxn];
16 vector<node>::iterator iter;
17 deque<int> de;
18 int main()
19 {
20     int n,m;
21     while(scanf("%d%d",&n,&m)!=EOF)
22     {
23         de.clear();
24         for(int i = 1;i <= n;++i)
25         vt[i].clear();
26         memset(visit,0,sizeof(visit));
27         for(int i = 1;i <= n;++i)
28         {
29             scanf("%d",&w[i]);
30             de.push_back(i);
31             visit[i] = 1;
32         }
33         int a,b,c;
34         while(m--)
35         {
36             scanf("%d%d%d",&a,&b,&c);
37             node temp = {c,a};
38             vt[b].push_back(temp);
39             temp.a = b;
40             temp.b = a;
41             vt[c].push_back(temp);
42         }
43         while(!de.empty())
44         {
45             int ss = *de.begin();
46             de.pop_front();
47             visit[ss] = 0;
48             iter = vt[ss].begin();
49             for(;iter != vt[ss].end();++iter)
50             if(w[ss] + w[iter->a] < w[iter->b])
51             {
52                 w[iter->b] = w[ss] + w[iter->a];
53                 if(visit[iter->b] == 0)
54                 {
55                     visit[iter->b] = 1;
56                     de.push_back(iter->b);
57                 }
58             }
59         }
60         printf("%d\n",w[1]);
61     }
62     return 0;
63 }