Submission #8801780

Source Code Expand

N, M = map(int, input().split())
AB = [0 for _ in range(N)]
for i in range(M):
	a, b = map(int, input().split())
	AB[a-1] += 1
	AB[b-1] += 1
for i in range(N):
	if AB[i]%2 or AB[i]%2:
		print("NO")
		exit()
print("YES")

Submission Info

Submission Time
Task B - Unplanned Queries
User Spolenski
Language Python (3.4.3)
Score 500
Code Size 229 Byte
Status AC
Exec Time 335 ms
Memory 3984 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 2
AC × 20
Set Name Test Cases
Sample sample1.txt, sample2.txt
All sample1.txt, sample2.txt, in1.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in2.txt, in3.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt
Case Name Status Exec Time Memory
in1.txt AC 303 ms 3888 KB
in10.txt AC 332 ms 3864 KB
in11.txt AC 308 ms 3060 KB
in12.txt AC 335 ms 3864 KB
in13.txt AC 320 ms 3984 KB
in14.txt AC 306 ms 3864 KB
in15.txt AC 17 ms 2940 KB
in16.txt AC 17 ms 2940 KB
in2.txt AC 304 ms 3888 KB
in3.txt AC 313 ms 3888 KB
in4.txt AC 317 ms 3888 KB
in5.txt AC 310 ms 3864 KB
in6.txt AC 323 ms 3964 KB
in7.txt AC 335 ms 3864 KB
in8.txt AC 327 ms 3888 KB
in9.txt AC 328 ms 3864 KB
sample1.txt AC 17 ms 3060 KB
sample2.txt AC 17 ms 2940 KB