题目:题目链接
题意:就是给出你N个人的关系,然后问你这些人最多属于多少个团体
分析:就是裸的并查集,可是我用vector搞了快两个小时了,RE,不知道了,不熟悉STL。下面是我当时写的vector的,求指教:
#include <iostream>
#include <cstdio>
#include <string>
#include <string.h>
#include <map>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <functional>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <bitset>
#include <stack>
#include <ctime>
#include <list>
#define INF 0x7fffffff
#define max3(a,b,c) (max(a,b)>c?max(a,b):c)
#define min3(a,b,c) (min(a,b)<c?min(a,b):c)
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
#define maxn 500001
int vis[maxn];
vector<int>Q[maxn];
void digui(int x)
{
int len = Q[x].size();
for(int i = 0; i < len; ++i)
{
vis[Q[x][i]] = 1;
if(Q[Q[x][i]].size() > 0)
digui(Q[x][i]);
}
return;
}
int main()
{
// freopen("D:\\in.txt", "r", stdin);
// freopen("D:\\out.txt", "w", stdout);
int n, m;
int cnt = 0;
while(scanf("%d%d", &n, &m))
{
if(n == 0 && m == 0)
break;
for(int i = 0; i < maxn; ++i)
Q[i].clear();
cnt++;
int a, b;
for(int i = 0; i < m; ++i)
{
scanf("%d%d", &a, &b);
if(a > b)
swap(a, b);
Q[a].push_back(b);
}
mem(vis, 0);
for(int i = 1; i <= n; ++i)
{
if(!vis[i] && Q[i].size() > 0)
digui(i);
}
int ans = 0;
for(int i = 1; i <= n; ++i)
{
if(!vis[i])
ans++;
}
printf("Case %d: %d\n",cnt, ans);
}
return 0;
}
最后实在改不了了,就用并查集,这就是并查集的模版题了,唉......
#include <iostream>
#include <cstdio>
#include <string>
#include <string.h>
#include <map>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <functional>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <bitset>
#include <stack>
#include <ctime>
#include <list>
#define INF 0x7fffffff
#define max3(a,b,c) (max(a,b)>c?max(a,b):c)
#define min3(a,b,c) (min(a,b)<c?min(a,b):c)
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
#define maxn 50001
int father[maxn];
int find(int x)
{
int r = x;
while(r != father[r])
r = father[r];
return r;
}
void merge(int x,int y)
{
int fx, fy;
fx = find(x);
fy = find(y);
if(fx != fy)
father[fx] = fy;
}
int main()
{
// freopen("D:\\in.txt", "r", stdin);
// freopen("D:\\out.txt", "w", stdout);
int n, m;
int cnt = 0;
while(scanf("%d%d", &n, &m))
{
if(n == 0 && m == 0)
break;
cnt++;
for(int i = 1; i <= n; ++i)
father[i] = i;
int a, b;
for(int i = 0; i < m; ++i)
{
scanf("%d%d", &a, &b);
merge(a, b);
}
int ans = 0;
for(int i = 1; i <= n; ++i)
{
if(father[i] == i)
ans++;
}
printf("Case %d: %d\n", cnt, ans);
}
return 0;
}