Codeforces-Solutions/1263D_SecretPasswords.cpp at main · ishaanjav/Codeforces-Solutions · GitHub

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
/*
 * Created by ishaanjav
 * github.com/ishaanjav
 * Codeforces Solutions: https://github.com/ishaanjav/Codeforces-Solutions
 */

#include <iostream>
using namespace std;

#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define pil pair<int, ll>
#define pib pair<int, bool>
#define SET(a, c) memset(a, c, sizeof a)
#define MOD 1000000007
#define enld endl
#define endl "\n"
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()

#include <string>
#include <vector>
typedef vector<int> vi;
typedef vector<ll> vl;
//#include <algorithm>
//#include <set>
//#include <map>
#include <unordered_map>
#include <unordered_set>
//#include <cmath>
//#include <cstring>
//#include <sstream>
//#include <stack>
//#include <queue>
vi parents, sizes;
int findParent(int num) {
    if (parents[num] != parents[parents[num]]) parents[num] = findParent(parents[num]);
    return parents[num];
}
void unionNodes(int a, int b) {
    int A, B;
    if (a == b || ((A = findParent(a)) == (B = findParent(b)))) {
        // cout << "skipping " << a << " " << b << endl;
        return;
    }
    if (sizes[B] > sizes[A]) swap(B, A);
    sizes[A] += sizes[B];
    parents[B] = A;
    // cout << "B: " << B << " parent is " << A << endl;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n;
    cin >> n;
    int counter = 0;
    sizes.resize(n);
    parents.resize(n);
    vi ar[26];

    for (int i = 0; i < n; i++) {
        string s;
        cin >> s;
        parents[i] = i;
        sizes[i] = 1;
        for (char c : s) {
            ar[c - 'a'].pb(counter);
        }
        counter++;
    }
    for (int i = 0; i < 26; i++) {
        if (ar[i].size() <= 1) continue;
        int first = ar[i].front();
        for (int j = 1; j < ar[i].size(); j++) {
            // cout << "unioning " << first << " and " << ar[i][j] << endl;
            unionNodes(first, ar[i][j]);
        }
    }
    unordered_set<int> ans;
    for (int i = 0; i < n; i++) {
        // cout << findParent(i) << endl;
        ans.insert(findParent(i));
    }
    cout << ans.size();
}