题目:
输入
2
4
x1 = x7
x9 != x7
x13 = x9
x1 = x13
2
x1 = x2
x2 = x1
输出
No
Yes
考察知识点:并查集
思路:
由于给出的n条约束条件是不分先后顺序的,所以可以将 = 和 != 的条件分开处理,假设 = 的约束条件全部成立,先将 = 的用并查集确定谁和谁在同一个集合,然后用 != 的约束条件验证符不符合,若其中有其中一条不符合,则输出”No“。
代码:
'算法' 并查集 ( times:2517ms )
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
typedef pair<int, int> PII;
const int N = 1e6 + 10;
PII eq[N], ueq[N];
int p[N];
int find(int x)
{
if (p[x] != x)
p[x] = find(p[x]);
return p[x];
}
void solve()
{
int n, m1 = 0, m2 = 0, cnt = 0;
scanf("%lld",&n);
unordered_map<string, int> pos;
bool flag = 1;
string _, a, b;
for (int i = 1; i <= n; i++)
{
cin >> a >> _ >> b;
if (!pos.count(a))
pos[a] = (++cnt);
if (!pos.count(b))
pos[b] = (++cnt);
if (_ == "=")
eq[++m1] = {pos[a], pos[b]};
else
ueq[++m2] = {pos[a], pos[b]};
}
for (int i = 1; i <= cnt; i++)
p[i] = i;
for (int i = 1; i <= m1; i++)
{
int pa = find(eq[i].ff), pb = find(eq[i].ss);
if (pa != pb)
p[pa] = pb;
}
for (int i = 1; i <= m2; i++)
{
int pa = find(ueq[i].ff), pb = find(ueq[i].ss);
if (pa == pb)
{
puts("No");
return;
}
}
puts("Yes");
}
signed main()
{
int T;
scanf("%lld",&T);
while (T--)
solve();
return 0;
}