CSES - HIIT Open 2019 - Results
Test results
testverdicttime
#10.49 sdetails
#20.05 sdetails

Code

def deletethosefucks(j):
if j in graph.keys():
nodestochecknext = graph[j]
del graph[j]
for node in nodestochecknext:
if node in graph.keys():
graph[node].remove(j)
deletethosefucks(node)

cases = int(input())

for i in range(cases):
nodes, edges = list(map(int, input().split()))
graph = {}
for j in range(nodes):
graph[j + 1] = []
for _ in range(edges):
a, b = list(map(int, input().split()))
graph[a].append(b)
graph[b].append(a)
somelinse = []
for j in graph.keys():
if len(graph[j]) == 1:
somelinse.append(j)
for j in somelinse:
deletethosefucks(j)
for j in somelinse:
deletethosefucks(j)
for j in somelinse:
deletethosefucks(j)
for j in somelinse:
deletethosefucks(j)
for j in somelinse:
deletethosefucks(j)
for j in somelinse:
deletethosefucks(j)
for j in somelinse:
deletethosefucks(j)
for j in somelinse:
deletethosefucks(j)
for j in graph.keys():
if len(graph[j]) > 2:
print("YES")
break
else:
print("NO")

#	for arr in graph.values():
#		print(arr)
#		if (len(arr) > 2):
#			a += 1
#	if a > 1:
#		print("YES")
#	else:
#		print("NO")

Verdict:

input
1000
100 78
97 68
75 90
58 80
...

correct output
YES
YES
YES
YES
NO
...

user output
NO
NO
NO
NO
NO
...

Verdict:

input
11
2 1
1 2
6 6
1 2
...

correct output
NO
NO
NO
YES
YES
...

user output
NO
NO
YES
YES
YES
...