题意:有n个池塘和m个管道;每个池塘的价值是v, 现在由于资金问题要删除池塘;但是删除的池塘必须是最多只连接一个管道,否则会爆炸;
求最后相连的池塘有奇数个的价值总和是多少;
代码:
#include<iostream>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
typedef long long ll;
const int maxn=100010;
int u[maxn],v[maxn];
int w[maxn],ind[maxn];
bool vis[maxn];
int p[maxn],ran[maxn]; //p数组为父亲,ran记录有联通块的里面的东西个数
ll sum[maxn]; //记录联通块的权值。
struct node
{
int to,next;
} edge[maxn*20];
int head[maxn],num;
void add(int u,int v)
{
edge[num].to=v;
edge[num].next=head[u];
head[u]=num++;
}
int find(int x)
{
if(p[x]!=x)
return p[x]=find(p[x]);
return x;
}
void hebing(int a,int b)
{
int x=find(a);
int y=find(b);
if(x==y)
return;
p[y]=x;
ran[x]+=ran[y];
sum[x]+=sum[y];
}
void init(int n)
{
for(int i=1; i<=n; i++)
{
p[i]=i;
ran[i]=1;
sum[i]=w[i];
}
}
void to_sort(int n)
{
int i;
queue<int>q;
for(i=1; i<=n; i++)
{
if(ind[i]<=1)
{
q.push(i);
vis[i]=0;
}
}
while(!q.empty())
{
int cur=q.front();
q.pop();
for(i=head[cur]; i!=-1; i=edge[i].next)
{
int xx=edge[i].to;
if(vis[xx])
{
ind[xx]--;
if(ind[xx]==1)
{
q.push(xx);
vis[xx]=0;
}
}
}
}
}
int main()
{
int t,i;
scanf("%d",&t);
while(t--)
{
int n,m;
num=0;
memset(vis,1,sizeof(vis));
memset(head,-1,sizeof(head));
memset(ind,0,sizeof(ind));
scanf("%d%d",&n,&m);
for(i=1; i<=n; i++)
scanf("%d",&w[i]);
for(i=1; i<=m; i++)
{
scanf("%d%d",&u[i],&v[i]);
add(u[i],v[i]);
add(v[i],u[i]);
ind[u[i]]++;
ind[v[i]]++;
}
to_sort(n);
init(n);
for(i=1; i<=m; i++)
{
if(vis[u[i]] &&vis[v[i]])
hebing(u[i],v[i]);
}
ll ans=0;
for(i=1; i<=n; i++)
{
if(p[i]==i &&vis[i] &&ran[i]%2==1)
ans+=sum[i];
}
cout<<ans<<endl;
}
return 0;
}
dfs
:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <queue>
using namespace std;
const int maxn = 1e5+10;
typedef long long LL;
int t,p,m;
int val[maxn];
int topsort[maxn],vis[maxn];
vector<int>G[10005];
/*
LL bfs(int u)
{
queue<int>q;
LL sum = val[u];
int num = 1;
vis[u] = true;
q.push(u);
while(!q.empty()) {
int to = q.front();
q.pop();
int Size = G[to].size();
for(int i = 0;i < Size; i++) {
if(topsort[G[to][i]] >= 2 && !vis[G[to][i]]) {
vis[G[to][i]] = true;
sum += val[G[to][i]];
num++;
q.push(G[to][i]);
}
}
}
if(num >= 3 && num%2) return sum;
return 0;
}
*/
LL sum;
int num;
void dfs(int u)
{
num++;
sum += val[u];
vis[u] = true;
int Size = G[u].size();
for(int i = 0; i < Size; i++)
{
int to = G[u][i];
if(!vis[to] && topsort[to] >= 2)
{
dfs(to);
}
}
}
int main()
{
// freopen("in.txt","r",stdin);
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&p,&m);
for(int i = 1; i <= p; i++) G[i].clear();
for(int i = 1; i <= p; i++)
{
scanf("%d",&val[i]);
topsort[i] = 0;
vis[i] = 0;
}
for(int i = 1; i <= m; i++)
{
int u,v;
scanf("%d%d",&u,&v);
G[u].push_back(v);
G[v].push_back(u);
topsort[u]++;
topsort[v]++;
}
for(int i = 1; i <= p; i++)
{
int j;
for(j = 1; j <= p; j++)
{
if(topsort[j] == 0 || topsort[j] == 1) break;
}
if(j > p) break;
int Size = G[j].size();
topsort[j] = -1;
for(int k = 0; k < Size; k++)
{
topsort[G[j][k]]--;
}
}
LL ans = 0;
for(int i = 1; i <= p; i++)
{
if(topsort[i] >= 2 && !vis[i])
{
sum = 0;
num = 0;
//ans += bfs(i);
dfs(i);
ans += (num >= 3 && num%2)? sum : 0;
}
}
printf("%lld\n",ans);
}
return 0;
}