G - Bear and Friendship Condition

最新推荐文章于 2020-12-13 18:12:57 发布

LqingX

最新推荐文章于 2020-12-13 18:12:57 发布

阅读量170

点赞数

分类专栏： Virtual Judge ——小白成长比赛思维

本文链接：https://blog.csdn.net/weixin_43892738/article/details/88370919

版权

Virtual Judge ——小白成长比赛同时被 2 个专栏收录

24 篇文章 1 订阅

订阅专栏

思维

6 篇文章 0 订阅

订阅专栏

Bear Limak examines a social network. Its main functionality is that two members can become friends (then they can talk with each other and share funny pictures).

There are n members, numbered 1 through n. m pairs of members are friends. Of course, a member can’t be a friend with themselves.

Let A-B denote that members A and B are friends. Limak thinks that a network is reasonable if and only if the following condition is satisfied: For every three distinct members (X, Y, Z), if X-Y and Y-Z then also X-Z.

For example: if Alan and Bob are friends, and Bob and Ciri are friends, then Alan and Ciri should be friends as well.

Can you help Limak and check if the network is reasonable? Print “YES” or “NO” accordingly, without the quotes.

Input

The first line of the input contain two integers n and m (3 ≤ n ≤ 150 000, ) — the number of members and the number of pairs of members that are friends.

The i-th of the next m lines contains two distinct integers ai and bi (1 ≤ ai, bi ≤ n, ai ≠ bi). Members ai and bi are friends with each other. No pair of members will appear more than once in the input.

Output

If the given network is reasonable, print “YES” in a single line (without the quotes). Otherwise, print “NO” in a single line (without the quotes).

Examples

Input
4 3
1 3
3 4
1 4
Output
YES
Input
4 4
3 1
2 3
3 4
1 2
Output
NO
Input
10 4
4 3
5 10
8 9
1 2
Output
YES
Input
3 2
1 2
2 3
Output
NO

#include<bits/stdc++.h>
using namespace std;
#define LL long long
int pre[151000];
LL t[1510000];
int findd(int a)
{
     return pre[a] == a ? a : (pre[a] = findd(pre[a]));
}
void mergee(int u,int v)
{
    int t1;
    int t2;
    t1=findd(u);
    t2=findd(v);
    if(t1!=t2)
    {
        pre[t1]=t2;
    }
}
int main()
{
    int n,m;


    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)
    {
        pre[i]=i;
    }
    for(int i=1;i<=m;i++)
    {
        int x,y;
        scanf("%d%d",&x,&y);
        mergee(x,y);
    }
    for(int i=1;i<=n;i++)
    {
        t[findd(i)]++;
    }
    LL sum=0;
    for(int i=1;i<=n;i++)
    {
        if(t[i]!=0&&t[i]!=1){
            sum+=(t[i]*(t[i]-1)/2);    //在 图论中  点对应的变数
        }

    }
    if(sum!=m){
        printf("NO\n");
    }
    else{
        printf("YES\n");
    }
    return 0;
}