AcWing 4304. 字符串归类

// Problem: 字符串归类
// Contest: AcWing
// URL: https://www.acwing.com/problem/content/4307/
// Memory Limit: 256 MB
// Time Limit: 1000 ms
// 2022-02-19 19:34:03
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
using namespace std;

#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define pii pair<int, int>
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fir first
#define pb push_back
#define sec second
#define sortall(x) sort((x).begin(),(x).end())
inline int read () {
	int x = 0, f = 0;
	char ch = getchar();
	while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
	while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
	return f?-x:x;
}
template<typename T> void print(T x) {
	if (x < 0) putchar('-'), x = -x;
	if (x >= 10) print(x/10);
	putchar(x % 10 + '0');
}
const int N = 2e5 + 10;
int n;
int fa[N];
int id[N];
int find (int tar) {
	if (fa[tar] != tar) return fa[tar]  = find(fa[tar]);
	return fa[tar];
}
void merge (int a, int b) {
	int ra = fa[a], rb = fa[b];
	if (ra == rb) return ;
	fa[ra] = rb;
}
void solve() {
	cin >> n;
	for (int i = 1; i <= n ;i ++) fa[i] = i;
	int ans=  n;
	for (int i = 1; i <= n; i ++) {
		string s;
		cin >> s;
		for (auto t : s) {
			if (id[t - 'a']) {
			    //找的是祖先所以可以处理第二种情况
				if (find(i) != find(id[t -'a'])) {
					ans--;
					fa[find(i)] = fa[find(id[t - 'a'])];
				}
			}
			else id[t - 'a'] = i;
		}
	}
	cout << ans << endl;
}
int main () {
    int t;
    t = 1;
    while (t --) solve();
    return 0;
}

一开始思考的合并对象错了。想着把字母合并到字符串的编号。 实际上字母只需要标记在第几个字符串。 然后借此来判断是否已经属于某个字符串 印象最深的