题意就是现在有一片池塘,池塘之间符合无向图的关系,每个池塘都有一个权值。现在要删去那些入度小于二的点,然后计算在剩下的池塘中,连接的池塘数为奇数的池塘总和。嗯,当初读题半天没读懂,把样例的数据画一下就很清晰了。
思路就是:先用拓扑排序筛选那些入度小于2的池塘,然后dfs搜索看看每一个连接的池塘数是不是为奇数,如果是那么加上他们的总和,依次类推。小心超内存,第一次是只要入度小于2就push,超了,后来改为==1,就ac,。。。。。。
代码:
#include<cstdio>
#include<queue>
#include<cstring>
#include<cstdlib>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
const int maxm = 1e4 + 10;
struct Edge
{
int from, to, next;
}edge[maxn];
int in[maxm];
int vis[maxm];
int head[maxm];
int val[maxm];
int n, m;
int cnt = 0;
void ini()
{
memset(in, 0, sizeof(in));
memset(vis, 0, sizeof(vis));
memset(head, -1, sizeof(head));
cnt = 0;
}
void addedge(ll u, ll v)
{
Edge E = { u,v,head[u] };
edge[cnt] = E;
head[u] = cnt++;
}
void toopu()
{
queue<int> que;
for (int i = 1; i <= n; i++)
{
if (in[i]==1)
que.push(i);
}
while (!que.empty())
{
int t = que.front();
que.pop();
for (int i = head[t]; i != -1; i = edge[i].next)
{
int q = edge[i].to;
if (--in[q]==1)
{
que.push(q);
}
}
}
}
ll sum = 0;
void dfs(int x)
{
for (int i = head[x]; i != -1; i = edge[i].next)
{
int t = edge[i].to;
if (in[t] > 1 && vis[t] == 0)
{
cnt++;
vis[t] = 1;
sum += val[t];
dfs(t);
}
}
}
void solve()
{
ll ans = 0;
cnt = 0;
for (int i = 1; i <= n; i++)
{
if (in[i] > 1&&vis[i]==0)
{
vis[i] = 1;
sum += val[i];
cnt++;
dfs(i);
if (cnt & 1)
{
ans += sum;
}
}
cnt = 0;
sum = 0;
}
printf("%lld\n", ans);
}
int main()
{
int t;
scanf("%d", &t);
while (t--)
{
scanf("%d %d", &n, &m);
ini();
for (int i = 1; i <= n; i++)
{
scanf("%d", &val[i]);
}
for (int i = 0; i < m; i++)
{
int a, b;
scanf("%d %d", &a, &b);
addedge(a, b);
addedge(b, a);
in[a]++;
in[b]++;
}
toopu();
solve();
}
// system("pause");
return 0;
}