ElJudge - Online MIPT programming contest

El Judge

Online MIPT programming contest

Forum || Register || Login || Problem set || Users rating || Online status || FAQ || acm.mipt.ru

<PREV Problem:

Solved by 15 users: Mirzakhmet, fboy123, Zhukov_Dmitry, wInuX, WsemirZ, zloy_mipt, mazahaka, defrager, yiuyuho, murphy, Dest, LiuChenheng, dragonic, avi2011class, rayaryabinina.

The smallest solutions
User	Date	Attempt		Time	CM
rayaryabinina	`21 dec 2015`	C	1	00.02	857
Dest	`21 mar 2010`	C++	1	00.05	2170
wInuX	`04 aug 2008`	Java	5	36.04	2268
wInuX	`04 aug 2008`	Java	6	29.61	2308
wInuX	`04 aug 2008`	Java	7	29.61	2425
fboy123	`08 jan 2007`	C++	20	00.03	2551
fboy123	`08 jan 2007`	C++	21	00.02	2561
LiuChenheng	`17 sep 2011`	C++	5	00.05	2724
LiuChenheng	`17 sep 2011`	C++	4	00.05	2733
LiuChenheng	`17 sep 2011`	C++	2	00.05	2788
yiuyuho	`10 apr 2009`	C++	17	00.09	3016
yiuyuho	`10 apr 2009`	C++	18	00.09	3016
avi2011class	`18 nov 2015`	C++	2	00.87	3715
WsemirZ	`31 aug 2008`	Kylix	39	02.10	4361
WsemirZ	`05 sep 2008`	Kylix	40	02.03	4393
Zhukov_Dmitry	`07 sep 2008`	C++	42	00.33	4444
Zhukov_Dmitry	`02 mar 2007`	C++	33	00.31	4605
Zhukov_Dmitry	`02 mar 2007`	C++	34	00.31	4605
Zhukov_Dmitry	`02 mar 2007`	C++	35	00.30	4653
Zhukov_Dmitry	`02 mar 2007`	C++	37	00.29	4685
dragonic	`25 mar 2015`	C++	37	07.62	4998

Languages
C++	11
C	2
Java	1
Kylix	1

 < 
 < 
 < 
 < 
 < 
 < 
 < 
 < 
 < 
 <

Graph Planarity

Time limit = 30 second(s)

Graph with V < 3000 vertices and E < 10000 edges. i-th edge connects vertices s_i and e_i (0 ≤ s_i, e_i < V).

Input. Graph description:

V E
s₁ e₁
s₂ e₂
s₃ e₂
...
s_E e_E

Where V is number of vertise, E is number of edges, (s₁, e_E) — i-th edge description.

Output. 'YES' if the graph is planar, and 'NO' otherwise.

Input#1

2 1
0 1

Output#1

YES

Input#2

Output#2

NO

Author:
Classic problem, tests and description by Egor Cvetkov
19 Apr 2006