HZOJ 那一天她离我而去

 1 #include<iostream>
 2 #include<cstring>
 3 #include<cstdio>
 4 #include<queue>
 5 #define LL long long
 6 #define MAXN 10010
 7 #define min(a,b) ((a)<(b)?(a):(b))
 8 #define ma(x) memset(x,0,sizeof(x))
 9 #define MP(a,b) make_pair(a,b)
10 using namespace std;
11 struct edge
12 {
13     int u,v,w,nxt;
14     #define u(x) ed[x].u
15     #define v(x) ed[x].v
16     #define w(x) ed[x].w
17     #define n(x) ed[x].nxt
18 }ed[MAXN*8];
19 int first[MAXN],num_e;
20 #define f(x) first[x]
21 int T,n,m;
22 const int t=10001;
23 int dis[MAXN];
24 bool v[MAXN];
25 void dist(int st)
26 {
27     memset(dis,0x7f,sizeof(dis));ma(v);
28     dis[st]=0;
29     priority_queue<pair<int,int> >q;
30     q.push(MP(0,st));
31     while(!q.empty())
32     {
33         int k=q.top().second;q.pop();
34         if(v[k])continue;v[k]=1;
35         for(int i=f(k);i;i=n(i))
36         if(dis[v(i)]>dis[k]+w(i))
37             dis[v(i)]=dis[k]+w(i),
38             q.push(MP(-dis[v(i)],v(i)));
39     }
40 }
41 int tem[MAXN];
42 inline void add(int u,int v,int w);
43 signed main()
44 {
45     cin>>T;
46     while(T--)
47     {
48         memset(tem,0x7f,sizeof(tem));
49         ma(first);num_e=0;
50         cin>>n>>m;
51         int u,v,d;
52         for(int i=1;i<=m;i++)
53         {
54             cin>>u>>v>>d;
55             if(u!=1)add(v,u,d);
56             if(v!=1)add(u,v,d);
57             if(u==1)tem[v]=d;
58             if(v==1)tem[u]=d;
59         }
60         LL ans=0x7fffff;
61         for(int i=f(1);i;i=n(i))
62         {
63             dist(v(i));
64             for(int j=f(1);j;j=n(j))
65             if(v(i)!=v(j))
66                 ans=min(ans,dis[v(j)]+tem[v(j)]+tem[v(i)]);
67         }
68         printf("%lld\n",ans==0x7fffff?-1:ans);
69     }
70 }
71 inline void add(int u,int v,int w)
72 {
73     ++num_e;
74     u(num_e)=u;
75     v(num_e)=v;
76     w(num_e)=w;
77     n(num_e)=f(u);
78     f(u)=num_e;
79 }