//新生训练
Input
6 8 5 3 5 2 6 4
5 6 0 08 1 7 3 6 2 8 9 7 5
7 4 7 8 7 6 0 03 8 6 8 6 4
5 3 5 6 5 2 0 0-1 -1
Output
Yes
Yes
No
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
const int N = 1e5 + 10;
int p[N], sz[N];
int n, m;
int find(int x)
{
if (p[x] != x)
p[x] = find(p[x]);
return p[x];
}
int main()
{
int a, b;
int flag = 0;
int k = 0;
for (int i = 1; i <= N; i++)
p[i] = i;
vector<int> s;
while (cin >> a >> b)
{
if (a == -1 && b == -1)
return 0;
if (a == 0 && b == 0)
{
if (!k)
puts("Yes");
else if (flag)
puts("No");
else if (k && !flag)
{
int sum = 0;
sort(s.begin(), s.end());
s.erase(unique(s.begin(), s.end()), s.end());
for (int i = 0; i < s.size(); i++)
{
if (find(s[i]) == s[i])
sum++;
}
if (sum > 1)
puts("No");
else
puts("Yes");
}
k = 0;
flag = 0;
for (int i = 1; i <= N; i++)
p[i] = i;
s.clear();
continue;
}
s.push_back(a);
s.push_back(b);
int x = find(a), y = find(b);
if (x != y)
{
p[x] = y;
}
else
flag = 1;
k++;
}
return 0;
}
~~~//仅当笔者个人备忘录使用。