Pseudoforest
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1026 Accepted Submission(s): 395
Problem Description
In graph theory, a pseudoforest is an undirected graph in which every connected component has at most one cycle. The maximal pseudoforests of G are the pseudoforest subgraphs of G that are not contained within any larger pseudoforest of G. A pesudoforest is larger than another if and only if the total value of the edges is greater than another one’s.
Input
The input consists of multiple test cases. The first line of each test case contains two integers, n(0 < n <= 10000), m(0 <= m <= 100000), which are the number of the vertexes and the number of the edges. The next m lines, each line consists of three integers, u, v, c, which means there is an edge with value c (0 < c <= 10000) between u and v. You can assume that there are no loop and no multiple edges.
The last test case is followed by a line containing two zeros, which means the end of the input.
The last test case is followed by a line containing two zeros, which means the end of the input.
Output
Output the sum of the value of the edges of the maximum pesudoforest.
Sample Input
3 3 0 1 1 1 2 1 2 0 1 4 5 0 1 1 1 2 1 2 3 1 3 0 1 0 2 2 0 0
Sample Output
3 5
题意是让找出最大的森林 也就是符合它所要求的最大的边和 它要求每个连通块最多有一个圈就是一个环
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<queue>
#include<algorithm>
#include<map>
#include<iomanip>
#define INF 99999999
using namespace std;
const int MAX=10000+10;
int father[MAX],rank[MAX],sum;
bool mark[MAX];
typedef struct{
int x,y,l;
}edge;
edge e[MAX*10];
bool cmp(edge a,edge b){
return a.l>b.l;
}
void makeset(int num){
for(int i=0;i<=num;++i){
father[i]=i;
rank[i]=1;
mark[i]=false;
}
sum=0;
}
int findset(int v){
if(v != father[v]){
father[v]=findset(father[v]);
}
return father[v];
}
void Union(int x,int y,int l){
int a=findset(x);
int b=findset(y);
if(a == b){
if(!mark[a])sum+=l,mark[a]=true;
}
else{
if(!mark[a] || !mark[b]){
if(rank[a]>rank[b]){
father[b]=a;
rank[a]+=rank[b];
mark[a]=(mark[a] || mark[b]);
}
else{
father[a]=b;
rank[b]+=rank[a];
mark[b]=(mark[a] || mark[b]);
}
sum+=l;
}
}
}
int main(){
int n,m;
while(scanf("%d%d",&n,&m),n+m){
makeset(n);
for(int i=0;i<m;++i){
scanf("%d%d%d",&e[i].x,&e[i].y,&e[i].l);
}
sort(e,e+m,cmp);
for(int i=0;i<m;++i){
Union(e[i].x,e[i].y,e[i].l);
}
printf("%d\n",sum);
}
return 0;
}