简单并查集,建立并查集后每次询问是否根节点相同,若连接过程有相同就输出No,最后检验下是否所有的根节点都一样(检测是否都连在一起了),都连在一起就输出Yes,反之输出No。
#include<iostream>
#include<cstdio>
#include<cstring>
#include<ctime>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<set>
#include<bitset>
#include<map>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#define INF 0x3f3f3f3f
#define inf 2*0x3f3f3f3f
#define llinf 1000000000000000000
#define pi acos(-1.0)
#define mod 1000000007
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define lrt rt<<1
#define rrt rt<<1|1
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define per(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define mem(a,b) memset(a,b,sizeof(a))
#define lb(x) (x&-x)
#define gi(x) scanf("%d",&x)
#define gi2(x,y) scanf("%d%d",&x,&y)
#define gll(x) scanf("%lld",&x)
#define gll2(x,y) scanf("%lld%lld",&x,&y)
#define gc(x) scanf("%c",&x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int>P;
/***********************************************/
int par[100005],ranks[100005],x,y;
void init(int n)
{
rep(i,0,n)par[i]=i,ranks[i]=0;
}
int finds(int x)
{
if(par[x]==x)return x;
return par[x]=finds(par[x]);
}
void unite(int x,int y)
{
x=finds(x);y=finds(y);
if(ranks[x]>ranks[y])par[y]=x;
else par[x]=y;
if(ranks[x]==ranks[y])ranks[y]++;
}
bool same(int x,int y)
{
return finds(x)==finds(y);
}
int main()
{
while(gi2(x,y))
{
if(x==-1&&y==-1)break;
if(x==0&&y==0){printf("Yes\n");continue;}
init(100005);
set<int>ss;
x--,y--;
ss.insert(x);ss.insert(y);
unite(x,y);
int flag=0;
while(gi2(x,y))
{
if(x==0&&y==0)break;
if(flag)continue;
x--,y--;
ss.insert(x);ss.insert(y);
if(same(x,y))flag=1;
else unite(x,y);
}
if(flag) printf("No\n");
else
{
int ve=finds(*ss.begin());
set<int>::iterator i=ss.begin();i++;
for(;i!=ss.end();i++)
{
if(finds(*i)!=ve){flag=1;break;}
}
if(flag)printf("No\n");
else printf("Yes\n");
}
}
return 0;
}