-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path1263D Secret Passwords.cpp
67 lines (59 loc) · 1.17 KB
/
1263D Secret Passwords.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
/*
Author : MishkatIT
Created : Friday 24-05-2024 21:49:53
*/
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "algo/debug.h"
#else
#define debug(...) 42
#endif
using ll = long long;
using ld = long double;
const ll mod = 1e9 + 7;
const ll N = 2e5 + 10;
const ll inf = 1e9;
const ll linf = 1e18;
vector<set<int>> adj;
vector<bool> vis;
void dfs(int i) {
vis[i] = true;
for (auto& j : adj[i]) {
if (!vis[j]) {
dfs(j);
}
}
return;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<vector<int>> f(26);
for (int i = 1; i <= n; i++) {
string str;
cin >> str;
for (auto& x : str) {
f[x - 'a'].push_back(i);
}
}
adj.resize(n + 5);
vis.resize(n + 5);
for (int i = 0; i < 26; i++) {
for (int j = 1; j < f[i].size(); j++) {
adj[f[i][j]].insert(f[i][0]);
adj[f[i][0]].insert(f[i][j]);
}
}
int con = 0;
for (int i = 1; i <= n; i++) {
if (!vis[i]) {
con++;
dfs(i);
}
}
cout << con << '\n';
return 0;
}