bzoj2753 [SCOI2012]滑雪与时间胶囊

 1 #include <bits/stdc++.h>
 2 #define il inline
 3 #define RG register
 4 #define ll long long
 5 #define N (2000010)
 6 
 7 using namespace std;
 8 
 9 struct edge{ int nt,to; }g[N];
10 struct E{ int u,v,w; }e[N];
11 
12 int head[N],fa[N],h[N],q[N],vis[N],n,m,num,ans;
13 ll val[N];
14 
15 il int gi(){
16   RG int x=0,q=1; RG char ch=getchar();
17   while ((ch<‘0‘ || ch>‘9‘) && ch!=‘-‘) ch=getchar();
18   if (ch==‘-‘) q=-1,ch=getchar();
19   while (ch>=‘0‘ && ch<=‘9‘) x=x*10+ch-48,ch=getchar();
20   return q*x;
21 }
22 
23 il void insert(RG int from,RG int to,RG int w){
24   g[++num]=(edge){head[from],to},head[from]=num;
25   e[num]=(E){from,to,w}; return;
26 }
27 
28 il void bfs(){
29   RG int hd=0,t=1; q[t]=1,vis[1]=1;
30   while (hd<t){
31     RG int x=q[++hd],v; ++ans;
32     for (RG int i=head[x];i;i=g[i].nt){
33       v=g[i].to; if (vis[v]) continue;
34       q[++t]=v,vis[v]=1;
35     }
36   }
37   return;
38 }
39 
40 il int cmp(const E &a,const E &b){
41   if (h[a.v]==h[b.v]) return a.w<b.w;
42   return h[a.v]>h[b.v];
43 }
44 
45 il int find(RG int x){
46   return fa[x]==x ? x : fa[x]=find(fa[x]);
47 }
48 
49 int main(){
50 #ifndef ONLINE_JUDGE
51   freopen("ski.in","r",stdin);
52   freopen("ski.out","w",stdout);
53 #endif
54   n=gi(),m=gi();
55   for (RG int i=1;i<=n;++i) h[i]=gi(),fa[i]=i;
56   for (RG int i=1,u,v,w;i<=m;++i){
57     u=gi(),v=gi(),w=gi();
58     if (h[u]>=h[v]) insert(u,v,w);
59     if (h[v]>=h[u]) insert(v,u,w);
60   }
61   bfs(),sort(e+1,e+num+1,cmp);
62   for (RG int i=1,x,y;i<=num;++i){
63     if (!vis[e[i].u] || !vis[e[i].v]) continue;
64     x=find(e[i].u),y=find(e[i].v);
65     if (x!=y) fa[x]=y,val[y]+=val[x]+e[i].w;
66   }
67   cout<<ans<<‘ ‘<<val[find(1)]; return 0;
68 }