题意:
删除入度为一或零的所有池塘,最后求所有联通快内点的数量是奇数的value和。
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e4 +100;
int vis[maxn],degree[maxn];//是否访问,以及该点的入度
int val[maxn];//每个池塘的value
int n,m,cnt;
ll sum;
vector<int> G[maxn];//图
void TopSort()//将可删除的池塘标记为1
{
queue<int> q;
for(int i = 1; i <= n; i++)
{
if(degree[i] <= 1)
{
vis[i] = 1;
q.push(i);
}
}
while(!q.empty())
{
int u = q.front();
q.pop();
for(int i = 0; i < G[u].size(); i++)
{
int v = G[u][i];
if(!vis[v])
{
degree[v]--;
if(degree[v] <= 1)
{
vis[v] = 1;
q.push(v);
}
}
}
}
}
void dfs(int s)//dfs寻找联通快
{
vis[s] = 1;
for(int i = 0; i < G[s].size(); i++)
{
int e = G[s][i];
if(vis[e] == 0)
{
sum += val[e];
cnt++;
dfs(e);
}
}
}
void init_(int n)
{
memset(vis,0,sizeof vis);
memset(degree,0,sizeof degree);
for(int i = 0; i <= n; i++)
{
G[i].clear();
}
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
scanf("%d %d",&n,&m);
init_(n);
for(int i = 1; i <= n; i++)
scanf("%d",&val[i]);
int st,ed;
for(int i = 1; i <= m; i++)
{
scanf("%d%d",&st,&ed);
G[st].push_back(ed);
G[ed].push_back(st);
degree[st]++;
degree[ed]++;
}
TopSort();
ll ans = 0;
for(int i = 1; i <= n; i++)
{
if(vis[i] == 0)
{
sum = val[i];
cnt = 1;
dfs(i);
if(cnt & 1)
ans += sum;
}
}
printf("%I64d\n",ans);
}
return 0;
}