PT07Y - Is it a tree

You are given an unweighted, undirected graph. Write a program to check if it's a tree topology.


The first line of the input file contains two integers N and M --- number of nodes and number of edges in the graph (0 < N <= 10000, 0 <= M <= 20000). Next M lines contain M edges of that graph --- Each line contains a pair (u, v) means there is an edge between node u and node v (1 <= u,v <= N).


Print YES if the given graph is a tree, otherwise print NO.


3 2
1 2
2 3


hide comments
anand pandey: 2014-08-16 01:59:11

Last edit: 2014-08-16 14:30:58
anand pandey: 2014-08-16 01:58:44

[code removed by cyclops; see notes below, "1. Don't post any source code here."]

Last edit: 2014-08-16 04:21:23
Naruto uzumaki: 2014-08-15 18:39:13

@jarvis this is a tree,

Miroslav Kovar: 2014-08-12 20:40:11

Please, what are some tricky test cases? I am getting WA, although the algorithm works fine for everything I come up with...

.:: Jarv1s ::.: 2014-08-10 00:50:28

4 3
1 2
2 3
2 4

is giving YES for AC solution, is it correct? Admin please rejudge all solutions...

mohsin mohammad: 2014-08-06 16:37:56

My first graph problem AC in first attempt
really exciting........

Vignesh: 2014-07-30 05:04:12

I second dragonemporer. I aced with failing to build a proper graph.

Hammad Akhtar: 2014-07-25 12:55:37

easy one.
No need of dfs.
Mem - 1.6M TIME - 0.00S

Navneet M Kumar: 2014-07-20 09:05:12

Can someone provide some test cases ?
I am getting a wa

Naruto uzumaki: 2014-07-18 12:22:32

first graph problem ever :)

Added by:Thanh-Vy Hua
Time limit:0.5s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ERL JS-RHINO
Resource:Co-author Amber