-
Notifications
You must be signed in to change notification settings - Fork 0
/
11503.cpp
113 lines (106 loc) · 1.85 KB
/
11503.cpp
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
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<math.h>
#include<vector>
#include<set>
#include<stack>
#include<map>
#include<queue>
#include<sstream>
#define lli long long int
#define ulli unsigned long long int
#define ii pair<int, int>
#define vi vector<int>
#define vii vector<ii>
#define rep(i, n) for(int i=0;i<n;i++)
#define iterate(x) for(auto itr=x.begin(); itr!=x.end();itr++)
using namespace std;
class UnionFind
{
private: vi parent, rank, childNo; int numOfSets; set<int> s;
public:
UnionFind(int N) {
rank.assign(N, 0);
childNo.assign(N, 1);
rep(i, N)
{
parent.push_back(i);
s.insert(i);
}
numOfSets = N;
}
int findSet(int i)
{
return parent[i] == i ? i : parent[i] = findSet(parent[i]);
}
bool isSameSet(int i, int j)
{
return findSet(i) == findSet(j);
}
void unionSet(int i, int j)
{
if (!isSameSet(i, j))
{
int x = findSet(i), y = findSet(j);
if (rank[x] > rank[y])
{
parent[y] = x;
childNo[x] += childNo[y];
cout << childNo[x] << endl;
}
else
{
parent[x] = y;
childNo[y] += childNo[x];
cout << childNo[y] << endl;
if (rank[x] == rank[y])
rank[y]++;
}
numOfSets--;
auto x_itr = s.find(x),
y_itr = s.find(y);
if (x_itr != s.end())
s.erase(x_itr);
if (y_itr != s.end())
s.erase(y_itr);
}
else
{
cout << childNo[findSet(i)] << endl;
}
}
int getNumberOfSets()
{
return numOfSets;
}
int getNumOfAcorns()
{
return s.size();
}
};
int main()
{
int tc;
cin >> tc;
while (tc--)
{
int m;
cin >> m;
map<string, int> dic;
UnionFind uf(100001);
rep(i, m)
{
string a, b;
cin >> a >> b;
if (dic.find(a) == dic.end())
dic.insert(make_pair(a, dic.size()));
if (dic.find(b) == dic.end())
dic.insert(make_pair(b, dic.size()));
uf.unionSet(dic[a], dic[b]);
}
}
return 0;
}
//AC