303572: CF690C1. Brain Network (easy)

Memory Limit:256 MB Time Limit:2 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Brain Network (easy)

题意翻译

给定一张 $n$ 个点 $m$ 条边的无向图,判断这是不是一棵树。

题目描述

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.

输入输出格式

输入格式


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 $ ).

输出格式


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

输入输出样例

输入样例 #1

4 4
1 2
2 3
3 1
4 1

输出样例 #1

no

输入样例 #2

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

输出样例 #2

yes

Input

题意翻译

给定一张 $n$ 个点 $m$ 条边的无向图,判断这是不是一棵树。

加入题单

上一题 下一题 算法标签: