Code Names（最大独立集）

题目链接：点击这里

题目大意：
给 $n$ 个单词，这 $n$ 个单词都是由相同种类数量的小写字母构成的，保证任意了两个单词不相同，定义一种关系 $f(i,j)$ 表示 $s_i,s_j$ 可通过交换一个字符串中两个字符的位置使之变成相同的字符串，求一个集合，其任意两个元素不满足关系 $f(i,j)$ ，求该集合大小的的最大值

题目分析：
我们可以枚举 $(i,j)$ 来 $O(le{n}_s)$ 判断其是否满足关系 $f(i,j) ，据此可以 $O(n^{2}le{n}_s)$ 建图，然后因为 $最大独立集=点的总数-最小点覆盖$ ，$最小点集覆盖=最大匹配$ ，故可以用建出的图建出一个二分图，再用网络流求解出二分图的最大匹配

具体细节见代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<set>
#include<map>
#define ll long long
#define inf 0x3f3f3f3f
#define Inf 0x3f3f3f3f3f3f3f3f
#define int ll
using namespace std;
int read()
{
	int res = 0,flag = 1;
	char ch = getchar();
	while(ch<'0' || ch>'9')
	{
		if(ch == '-') flag = -1;
		ch = getchar();
	}
	while(ch>='0' && ch<='9')
	{
		res = (res<<3)+(res<<1)+(ch^48);//res*10+ch-'0';
		ch = getchar();
	}
	return res*flag;
}
const int maxn = 505;
const int maxm = 5005;
const int mod = 998244353;
const double pi = acos(-1);
const double eps = 1e-8;
struct Edge{
	int nxt,to,val;
}edge[maxm<<1];
int n,m,s,t,cnt = 1,len,head[maxn],cur[maxn],dep[maxn],col[maxn];
bool vis[maxn];
char str[maxn][maxn];
vector<int>g[maxn];
void addedge(int from,int to,int val)
{
	edge[++cnt].nxt = head[from];
	edge[cnt].to = to;
	edge[cnt].val = val;
	head[from] = cnt;
}
bool bfs(int s,int t)
{
	memcpy(cur,head,sizeof(head));
	memset(dep,0,sizeof(dep));
	dep[s] = 1;
	queue<int>qu;
	qu.push(s);
	while(!qu.empty())
	{
		int h = qu.front(); qu.pop();
		for(int i = head[h];i;i = edge[i].nxt)
		{
			int to = edge[i].to,val = edge[i].val;
			if(val>0 && !dep[to]) dep[to] = dep[h]+1,qu.push(to);
		}
	}
	return dep[t];
}
int dfs(int now = s,int flow = inf) //s->t 
{
	if(now == t) return flow;
	int rem = flow;
	for(int i = cur[now];i && rem;i = edge[i].nxt)
	{
		cur[now] = i;
		int to = edge[i].to,val = edge[i].val;
		if(val>0 && dep[to]==dep[now]+1)
		{
			int tmp = dfs(to,min(val,rem));
			rem -= tmp;
			edge[i].val -= tmp;
			edge[i^1].val += tmp;
		}
	}
	return flow-rem;
}
int dinic(int s,int t)
{
	int res = 0;
	while(bfs(s,t)) res += dfs();
	return res;
} 
void dfs2(int u)
{
	vis[u] = true;
	for(auto to : g[u])
	{
		if(vis[to]) continue;
		col[to] = col[u]^1;
		dfs2(to);
	}
}
signed main()
{
	n = read(); s = n+1,t = n+2;
	for(int i = 1;i <= n;i++) scanf("%s",str[i]+1);
	len = strlen(str[1]+1);
	for(int i = 1;i <= n;i++)
	{
		for(int j = 1;j <= n;j++)
		{
			int tmp = 0;
			for(int k = 1;k <= len;k++) if(str[i][k] != str[j][k]) tmp++;
			if(tmp == 2) g[i].push_back(j),g[j].push_back(i);
		}
	}
	for(int i = 1;i <= n;i++) if(!vis[i]) dfs2(i);
	for(int i = 1;i <= n;i++)
	{
		if(col[i]) addedge(i,t,1),addedge(t,i,0);
		else {
			addedge(s,i,1);addedge(i,s,0);
			for(auto to : g[i]) addedge(i,to,1),addedge(to,i,0);
		}
	}
	printf("%lld\n",n-dinic(s,t));
	return 0;
}