UVA 10859 Placing Lampposts

#include    <iostream>
#include    <cstdio>
#include    <cstdlib>
#include    <algorithm>
#include    <vector>
#include    <cstring>
#include    <queue>
#include    <complex>
#include    <stack>
#define LL long long int
#define dob double
#define FILE "10859"
using namespace std;

const int N = 2010;
struct Node{int to,next;}E
;
int n,m,head
,tot,cnt,f
[2],vis
,root
;

inline int gi(){
int x=0,res=1;char ch=getchar();
while(ch>'9'||ch<'0'){if(ch=='-')res*=-1;ch=getchar();}
while(ch<='9'&&ch>='0')x=x*10+ch-48,ch=getchar();
return x*res;
}

inline void link(int u,int v){
E[++tot]=(Node){v,head[u]};
head[u]=tot;
}

inline void dfs(int x){
f[x][0]=0;f[x][1]=N;vis[x]=1;
for(int e=head[x];e;e=E[e].next){
int y=E[e].to;if(vis[y])continue;dfs(y);
f[x][0]+=f[y][1]+1;
if(f[y][1]>f[y][0])
f[x][1]+=f[y][0]+1;
else f[x][1]+=f[y][1];
}
}

inline void solve(int ans=0){
n=gi();m=gi();tot=0;
memset(head,0,sizeof(head));
memset(vis,0,sizeof(vis));
for(int i=1;i<=m;++i){
int u=gi()+1,v=gi()+1;
link(u,v);link(v,u);
}
for(int i=1;i<=n;++i)
if(!vis[i])dfs(i),ans+=min(f[i][0],f[i][1]);
printf("%d %d %d\n",ans/N,m-ans%N,ans%N);
}

int main(){
int Case=gi();while(Case--)solve();
fclose(stdin);fclose(stdout);
return 0;
}