Time Limit: 1000MS | Memory Limit: 20000K | |
Total Submissions: 34902 | Accepted: 16954 |
Description
In the Not-Spreading-Your-Sickness University (NSYSU), there are many student groups. Students in the same group intercommunicate with each other frequently, and a student may join several groups. To prevent the possible transmissions of SARS, the NSYSU collects the member lists of all student groups, and makes the following rule in their standard operation procedure (SOP).
Once a member in a group is a suspect, all members in the group are suspects.
However, they find that it is not easy to identify all the suspects when a student is recognized as a suspect. Your job is to write a program which finds all the suspects.
Input
A case with n = 0 and m = 0 indicates the end of the input, and need not be processed.
Output
Sample Input
100 4 2 1 2 5 10 13 11 12 14 2 0 1 2 99 2 200 2 1 5 5 1 2 3 4 5 1 0 0 0
Sample Output
4 1 1
要看懂题意,因为理解错了题意,写了好久也没写出来,看了别人的代码才知道理解错了,英语伤不起啊。
总体来说这道题也挺简单,只是多了一个计数数组而已。
#include <iostream>
#include <algorithm>
using namespace std;
const int MAXN=30000+5;
int par[MAXN];
int ran[MAXN];//计数数组
int find(int x){
return par[x]==x ? x : par[x]=find(par[x]);
}
void unite(int x,int y){
x = find(x);
y = find(y);
if(x==y)
return ;
par[y] = x;
ran[x] += ran[y];
}
int main(){
int n;
int numPars,numFriends;
bool flag = false;
while(cin >> numPars >> n){
if(numPars == 0){
break;
}
for(int i=0; i<numPars; i++){
par[i] = i;
ran[i] = 1;
}
int a,b,c;
while(n--){
cin >> a >> b;
for(int i=1; i<a; i++){
cin >> c;
unite(b,c);
}
}
cout << ran[find(0)] << endl;//不能直接输出ran[0];
}
return 0;
}