1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
| #include <bits/stdc++.h>
using namespace std;
#define INF 1<<30
#define MAX 10005
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int parent[5005];
void Initialization(int n)
{
for(int i = 0; i <= n; i++)
parent[i] = i;
}
int find_parent(int x)
{
if(parent[x] == x)
{
return x;
}
return parent[x] = find_parent(parent[x]);
}
void make_union(int x, int y)
{
parent[find_parent(x)] = find_parent(y);
//parent[find_parent(y)] = find_parent(x);
}
bool isUnion(int x, int y)
{
return find_parent(x) == find_parent(y);
}
int main()
{
//FASTIO
/*
//double start_time = clock();
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#endif
//*/
int c,r;
while(1){
cin >> c >> r;
if(c == 0 && r == 0)break;
map<string, int> mp;
for(int i = 1; i <= c; i++){
string s;
cin >> s;
mp[s] = i;
}
Initialization(c);
for(int i = 1; i <= r; i++){
string str1, str2;
cin >> str1 >> str2;
int x = mp[str1];
int y = mp[str2];
make_union(y,x);
}
int mx = 0;
map<int,int>ans;
for(int i = 1; i <= c; i++){
int k = find_parent(i);
//cerr << i << "---->"<<k<< endl;
ans[k]++;
mx = max(mx,ans[k]);
}
cout << mx << endl;
}
//double end_time = clock();
//printf( "Time = %lf ms\n", ( (end_time - start_time) / CLOCKS_PER_SEC)*1000);
return 0;
}
|
No comments:
Post a Comment