Brain Network (easy)(并查集水题)

G - Brain Network (easy)

Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

CodeForces 690C1

Description

One particularly well-known fact about zombies is that they move and think terribly slowly. While we still don't know why their movements are so sluggish, the problem of laggy thinking has been recently resolved. It turns out that the reason is not (as previously suspected) any kind of brain defect – it's the opposite! Independent researchers confirmed that the nervous system of a zombie is highly complicated – it consists of n brains (much like a cow has several stomachs). They are interconnected by brain connectors, which are veins capable of transmitting thoughts between brains. There are two important properties such a brain network should have to function properly:

1. It should be possible to exchange thoughts between any two pairs of brains (perhaps indirectly, through other brains).
2. There should be no redundant brain connectors, that is, removing any brain connector would make property 1 false.

If both properties are satisfied, we say that the nervous system is valid. Unfortunately (?), if the system is not valid, the zombie stops thinking and becomes (even more) dead. Your task is to analyze a given nervous system of a zombie and find out whether it is valid.

Input

The first line of the input contains two space-separated integers n and m (1 ≤ n, m ≤ 1000) denoting the number of brains (which are conveniently numbered from 1 to n) and the number of brain connectors in the nervous system, respectively. In the next m lines, descriptions of brain connectors follow. Every connector is given as a pair of brains a b it connects (1 ≤ a, b ≤ n, a ≠ b).

Output

The output consists of one line, containing either yes or no depending on whether the nervous system is valid.

Sample Input

Input

4 4
1 2
2 3
3 1
4 1

Output

no

Input

6 5
1 2
2 3
3 4
4 5
3 6

Output

yes

//并查集水题，第一行 n , m 是点，和边个数,然后 m 边的描述，问是否都连通了且没有多余的边

#include<stdio.h>
int f[1001];
int find(int x)
{
    if (f[x]!=x)
        f[x]=find(f[x]);
    return f[x];
}
int main()
{
    int n,m;
    while (scanf("%d%d",&n,&m)!=EOF)
    {
        int i,j;
        for (i=1;i<=n;i++)
        f[i]=i;
        
        int a,b,temp;
        scanf("%d%d",&a,&b);
        temp=a;
        f[a]=f[b];
        int ok=1;
        for (i=2;i<=m;i++)
        {
            scanf("%d%d",&a,&b);
            int head_a=find(a);
            int head_b=find(b);
            if (head_a!=head_b)
            f[head_a]=f[head_b];
            else
                ok=0;
        }
        for (i=1;i<=n;i++)
        {
            if (ok==0) break;
            if (find(i)!=find(temp))
            {
            ok=0;
            break;
            }
        }
        if (ok)
        printf("yes
");
        else
        printf("no
");
    }
    return 0;
}