题意
传送门 POJ 2513
题解
求一条由棍子为边组成的欧拉通路或欧拉回路。无向图的欧拉通路判断条件为:图连通且仅存在 2 2 2 个度为奇数的节点;欧拉回路判断条件为:图连通且节点度都为偶数。
T r i e Trie Trie 树将代表颜色的字符串映射为索引值,用并查集判断图的连通性即可。
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
using namespace std;
#define maxc 12
#define maxn 250005
int x, n, trie[maxn * 10][26], color[maxn * 10], id[maxn * 10];
int deg[maxn * 2 + 1], par[maxn * 2 + 1], rnk[maxn * 2 + 1];
void init(int n)
{
for (int i = 1; i <= n; i++)
{
par[i] = i, rnk[i] = 0;
}
}
int find(int x)
{
return par[x] == x ? x : (par[x] = find(par[x]));
}
void unite(int x, int y)
{
x = find(x), y = find(y);
if (x == y) return;
if (rnk[x] > rnk[y]) par[y] = x;
else
{
par[x] = y;
if (rnk[x] == rnk[y]) ++rnk[y];
}
}
int insert(char *s)
{
int len = strlen(s), p = 0;
for (int i = 0; i < len; i++)
{
int c = s[i] - 'a';
if (!trie[p][c])
{
trie[p][c] = ++n;
}
p = trie[p][c];
}
color[p] = 1;
return id[p] ? id[p] : (id[p] = ++x);
}
int main()
{
char s1[maxc], s2[maxc];
n = x = 0;
init(maxn * 2);
while (~scanf(" %s %s", s1, s2))
{
int x1 = insert(s1), x2 = insert(s2);
++deg[x1], ++deg[x2];
unite(x1, x2);
}
// 度为奇数的节点数, 图中连通分量数
int sum = 0, sum2 = 0;
for (int i = 1; i <= x; i++)
{
if (deg[i] & 1) ++sum;
if (par[i] == i) ++sum2;
}
puts((sum > 2 || sum2 > 1) ? "Impossible" : "Possible");
return 0;
}