PAT甲级 A1107

PAT甲级 A1107

题目详情

1107 Social Clusters (30分)
When register on a social network, you are always asked to specify your hobbies in order to find some potential friends with the same hobbies. A social cluster is a set of people who have some of their hobbies in common. You are supposed to find all the clusters.

Input Specification:
Each input file contains one test case. For each test case, the first line contains a positive integer N (≤1000), the total number of people in a social network. Hence the people are numbered from 1 to N. Then N lines follow, each gives the hobby list of a person in the format:

K
​i
​​ : h
​i
​​ [1] h
​i
​​ [2] … h
​i
​​ [K
​i
​​ ]

where K
​i
​​ (>0) is the number of hobbies, and h
​i
​​ [j] is the index of the j-th hobby, which is an integer in [1, 1000].

Output Specification:
For each case, print in one line the total number of clusters in the network. Then in the second line, print the numbers of people in the clusters in non-increasing order. The numbers must be separated by exactly one space, and there must be no extra space at the end of the line.

Sample Input:
8
3: 2 7 10
1: 4
2: 5 3
1: 4
1: 3
1: 4
4: 6 8 1 5
1: 4
Sample Output:
3
4 3 1

解题思路

并查集并查集。一开始我对题目的理解是根据爱好划分圈子，但实际上是只要有相同的爱好就能属于同一个圈子，先将每个注册用户的爱好自己形成一个圈子，而后将其不同用户之间形成圈子。
两个测试点死活过不去
找不到原因

#include<algorithm>
#include<iostream>
#include<vector>
#include<cmath>
#include<iomanip>
#include<map>
#include<queue>
#include<string>
using namespace std;
int N;
int ques[11000];
int people[11000];
void inite() {
	for (int i = 1; i <= 1100; i++) {
		ques[i] = i;
		people[i] = 0;
	}
}
int root(int a) {
	while (a != ques[a]) {
		a = ques[a];
	}
	return a;
}
void Union(int a, int b) {
	if (root(a) == root(b)) {
		return;
	}
	else {
		int rb = root(b);
		int ra = root(a);
		ques[rb] = ra;
		people[ra] += people[rb];
		people[rb] = 0;
	}
}
int main() {
	cin >> N;
	inite();
	for (int i = 0; i < N; i++) {
		int k; char ept;
		scanf_s("%d%c", &k, &ept);
		int hb1; scanf_s("%d",&hb1);
		for (int j = 1; j < k; j++) {
			int hob; scanf_s("%d", &hob);
			Union(hb1, hob);
		}
		people[root(hb1)]++;
	}
	vector<int> answer;
	for (int i = 1; i <= N; i++) {
		if (i == root(i)&&people[i]>0) {
			answer.push_back(people[i]);
		}
	}
	cout << answer.size() << '\n';
	sort(answer.begin(), answer.end());
	for (int i = answer.size()-1; i >=0; i--) {
		if (i != answer.size()-1) {
			cout <<" "<<answer[i];
		}
		else {
			cout << answer[i];
		}
	}
	cout << '\n';
}