并查集水题,建立n并查集,然后把认识的人都连起来,最后算一下父亲的数量即可(输入里的空一行是什么鬼。。。)
#include<iostream>
#include<cstdio>
#include<cstring>
#include<ctime>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<set>
#include<bitset>
#include<map>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#define INF 0x3f3f3f3f
#define inf 2*0x3f3f3f3f
#define llinf 1000000000000000000
#define pi acos(-1.0)
#define mod 1000000007
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define lrt rt<<1
#define rrt rt<<1|1
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define per(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define mem(a,b) memset(a,b,sizeof(a))
#define lb(x) (x&-x)
#define gi(x) scanf("%d",&x)
#define gi2(x,y) scanf("%d%d",&x,&y)
#define gll(x) scanf("%lld",&x)
#define gll2(x,y) scanf("%lld%lld",&x,&y)
#define gc(x) scanf("%c",&x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int>P;
/***********************************************/
int par[30005],ranks[30005],t,n,m,x,y;
void init(int n)
{
rep(i,0,n)par[i]=i,ranks[i]=0;
}
int finds(int x)
{
if(par[x]==x)return x;
return par[x]=finds(par[x]);
}
void unite(int x,int y)
{
x=finds(x);y=finds(y);
if(x==y)return ;
if(ranks[x]<ranks[y])par[x]=y;
else par[y]=x;
if(ranks[x]==ranks[y])ranks[x]++;
}
bool same(int x,int y)
{
return finds(x)==finds(y);
}
int main()
{
gi(t);
rep(cas,0,t)
{
map<int,int>mm;
gi2(n,m);
init(n);
rep(i,0,m)
{
gi2(x,y);unite(x-1,y-1);
}
int cnt=0;
rep(i,0,n)
{
if(!mm[finds(i)])cnt++,mm[finds(i)]++;
}
printf("%d\n",cnt);
}
return 0;
}