[BOJ] 4195 친구 네트워크

Time Lapse :1hour 30min 0sec

4195.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
#include <iostream>
#include <map>
#include <set>

using namespace std;
int tc, n;
int fNum[200002], fSet[200002];
int getG(int num) {
return fSet[num] == num ? num : fSet[num] = getG(fSet[num]);
}

int unionG(int f1, int f2) {
int g1 = getG(f1);
int g2 = getG(f2);
if(g1 != g2) {
fSet[g1] = g2;
fNum[g2] += fNum[g1];
fNum[g1] = 1;
}
return fNum[g2];
}

int main() {
cin.tie(NULL);
ios_base::sync_with_stdio(false);
cin>>tc;
while (tc--) {
cin>>n;
int cnt = 0;
map<string, int> network;
for(int i = 1; i <= n*2; i++) {
fSet[i] = i;
fNum[i] = 1;
}
string s1, s2;
for(int i = 0; i < n; i++) {
cin >> s1 >> s2;
if(network.find(s1) == network.end())
network[s1] = ++cnt;
if(network.find(s2) == network.end())
network[s2] = ++cnt;
cout<<unionG(network[s1],network[s2])<<"\n";
}
}
}
Author: Song Hayoung
Link: https://songhayoung.github.io/2020/09/10/PS/BOJ/4195/
Copyright Notice: All articles in this blog are licensed under CC BY-NC-SA 4.0 unless stating additionally.