Time Limit: 1500/1000 MS (Java/Others)
Memory Limit: 131072/131072 K (Java/Others)
Problem Description
Betty owns a lot of ponds, some of them are connected with other ponds by pipes, and there will not be more than one pipe between two ponds. Each pond has a value v.
Now Betty wants to remove some ponds because she does not have enough money. But each time when she removes a pond, she can only remove the ponds which are connected with less than two ponds, or the pond will explode.
Note that Betty should keep removing ponds until no more ponds can be removed. After that, please help her calculate the sum of the value for each connected component consisting of a odd number of ponds
Input
The first line of input will contain a number T(1≤T≤30) which is the number of test cases.
For each test case, the first line contains two number separated by a blank. One is the number p(1≤p≤104) which represents the number of ponds she owns, and the other is the number m(1≤m≤105) which represents the number of pipes.
The next line contains p numbers v1,...,vp, where vi(1≤vi≤108) indicating the value of pond i.
Each of the last m lines contain two numbers a and b, which indicates that pond a and pond b are connected by a pipe.
Output
For each test case, output the sum of the value of all connected components consisting of odd number of ponds after removing all the ponds connected with less than two pipes.
Sample Input
1
7 7
1 2 3 4 5 6 7
1 4
1 5
4 5
2 3
2 6
3 6
2 7
Sample Output
21
Source
2015 ACM/ICPC Asia Regional Changchun Online
一个图，无向边，每一个节点有一个权值
若某一个节点的相连的边长数<=1,则这个节点可以去掉
主人公会继续去掉节点直到所有节点都不可以去掉为止
现在剩下的节点是一个个的连通分量，
主人公想知道所有所在连通分量的节点数为奇数的节点的权值总和
简单题
记录每一个节点的入度
1.第1次dfs，去掉可以去的节点
2.第2次dfs，找出哪些连通分量的节点数为奇数，并把这些节点的总权值加入到ret
1 #include<cstdio>
2 #include<cstring>
3 #include<algorithm>
4
5 using namespace std;
6
7 #define ll long long
8 #define push_back pb
9
10 const int maxp=1e4+5;
11 const int maxm=1e5+5;
12
13 struct Edge
14 {
15 int to,next;
16 };
17 Edge edge[maxm<<1];
18
19 int head[maxp];
20 int tot;
21 bool vis[maxp];
22 int in[maxp];
23 ll v[maxp];
24
25 void addedge(int u,int v)
26 {
27 edge[tot].to=v;
28 edge[tot].next=head[u];
29 head[u]=tot++;
30 }
31
32 ll solve(int ,int );
33 void dfs(int );
34 void dfs1(int ,int &,ll &);
35
36 int main()
37 {
38 int test;
39 scanf("%d",&test);
40 while(test--){
41 tot=0;
42 memset(head,-1,sizeof head);
43 memset(in,0,sizeof in);
44
45 int p,m;
46 scanf("%d %d",&p,&m);
47 for(int i=1;i<=p;i++)
48 scanf("%I64d",&v[i]);
49 int u,v;
50 for(int i=0;i<m;i++){
51 scanf("%d %d",&u,&v);
52 addedge(u,v);
53 addedge(v,u);
54 in[u]++;
55 in[v]++;
56 }
57
58 printf("%I64d\n",solve(p,m));
59 }
60 return 0;
61 }
62
63 ll solve(int p,int m)
64 {
65 memset(vis,false,sizeof vis);
66
67 for(int i=1;i<=p;i++){
68 if(!vis[i]&&in[i]<2){
69 in[i]--;
70 dfs(i);
71 }
72 }
73
74 ll ret=0;
75 memset(vis,false,sizeof vis);
76 int num;
77 ll sum;
78 for(int i=1;i<=p;i++){
79 if(!vis[i]&&in[i]>1){
80 num=0;
81 sum=0;
82 dfs1(i,num,sum);
83 if(num%2)
84 ret+=sum;
85 }
86 }
87 return ret;
88 }
89
90 void dfs(int u)
91 {
92 vis[u]=true;
93 for(int i=head[u];~i;i=edge[i].next){
94 int v=edge[i].to;
95 if(vis[v])
96 continue;
97 in[v]--;
98 if(in[v]<2){
99 in[v]--;
100 dfs(v);
101 }
102 }
103 }
104
105 void dfs1(int u,int &num,ll &sum)
106 {
107 vis[u]=true;
108 num++;
109 sum+=v[u];
110 for(int i=head[u];~i;i=edge[i].next){
111 int v=edge[i].to;
112 if(vis[v]||in[v]<2)
113 continue;
114 dfs1(v,num,sum);
115 }
116 }