codeforces 771a 完全图+并查集判连通块中的点数和边数

题目：

A. Bear and Friendship Condition

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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

Note

The drawings below show the situation in the first sample (on the left) and in the second sample (on the right). Each edge represents two members that are friends. The answer is "NO" in the second sample because members (2, 3) are friends and members (3, 4) are friends, while members (2, 4) are not.

给定一个图，问这张图是否满足若a连向b，a连向c则b也连向c

分析：

一开始就感觉和度数有联系，但并没有找出规律.....正解是用完全图的一个性质：边数=顶点数*（顶点数-1）/2

满足题目给定条件就意味着每个连通块是一个完全图啦

主要是不熟练

代码：

注意可能爆Int

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn = 150050;

int n,m,f[maxn];
ll vn[maxn],en[maxn];

int Find(int x){
	return x==f[x]?x:f[x]=Find(f[x]);
}

void init(){
    for(int i=1;i<=n;++i){
    	f[i]=i;
    	vn[i]=1;//该连通块的初始点数 
    	en[i]=0;//该连通块的初始边数 
    }
}

int main(){//77 ms	9700 KB
    int x,y;
    scanf("%d%d",&n,&m);
	init();
	for(int i=0;i<m;++i){
		scanf("%d%d",&x,&y);
		if(Find(x)!=Find(y)){//边的两顶点不在一个连通块中 
			vn[f[y]]+=vn[f[x]];
			en[f[y]]+=en[f[x]]+1;
			f[f[x]]=f[y];
		}
		else en[f[y]]++;
	}
    bool f=1;
    for(int i=1;i<=n;++i){
    	if(Find(i)==i){//对于一个连通块 
    		if(en[i]!=vn[i]*(vn[i]-1)/2){
    			f=0; break;
    		} 
    	}
    }
    if(f) printf("YES");
    else printf("NO");
    return 0;
}

Orz dalao:http://blog.csdn.net/hsj970319/article/details/63684555

自己又手敲了一发