9440 | 2024. 02. 21 17:46:39 | NagyLeo | Kaktuszgráf | pypy3 | Elfogadva 50/50 | 82ms | 95260 KiB |
from sys import stdin, stdout
input=stdin.readline
def main():
N, M = map(int, input().split())
graph = {}
for i in range(M):
A, B = map(int, input().split())
try:
graph[A].add(B)
except:
graph[A] = {B}
try:
graph[B].add(A)
except:
graph[B] = {A}
#print(graph)
lenCircle=0
seen = {1:0}
def depth_search(node, lenCircle):
for v in graph[node]:
if v not in seen:
seen[v] = seen[node]+1
lenCircle=depth_search(v, lenCircle)
else:
lenCircle = max(seen[node]-seen[v]+1, lenCircle)
return lenCircle
print(depth_search(1,lenCircle))
main()
Részfeladat | Összpont | Teszt | Verdikt | Idő | Memória | ||
---|---|---|---|---|---|---|---|
base | 50/50 | ||||||
1 | Elfogadva | 0/0 | 43ms | 76688 KiB | |||
2 | Elfogadva | 0/0 | 61ms | 86208 KiB | |||
3 | Elfogadva | 2/2 | 57ms | 85400 KiB | |||
4 | Elfogadva | 2/2 | 61ms | 86640 KiB | |||
5 | Elfogadva | 2/2 | 67ms | 86456 KiB | |||
6 | Elfogadva | 2/2 | 71ms | 91112 KiB | |||
7 | Elfogadva | 2/2 | 57ms | 89240 KiB | |||
8 | Elfogadva | 2/2 | 59ms | 89100 KiB | |||
9 | Elfogadva | 2/2 | 70ms | 89792 KiB | |||
10 | Elfogadva | 2/2 | 74ms | 90412 KiB | |||
11 | Elfogadva | 2/2 | 75ms | 90332 KiB | |||
12 | Elfogadva | 2/2 | 70ms | 90416 KiB | |||
13 | Elfogadva | 2/2 | 78ms | 95260 KiB | |||
14 | Elfogadva | 2/2 | 70ms | 90660 KiB | |||
15 | Elfogadva | 2/2 | 82ms | 93596 KiB | |||
16 | Elfogadva | 2/2 | 72ms | 91144 KiB | |||
17 | Elfogadva | 2/2 | 71ms | 90428 KiB | |||
18 | Elfogadva | 2/2 | 67ms | 91172 KiB | |||
19 | Elfogadva | 3/3 | 78ms | 91712 KiB | |||
20 | Elfogadva | 3/3 | 59ms | 91528 KiB | |||
21 | Elfogadva | 3/3 | 63ms | 90548 KiB | |||
22 | Elfogadva | 3/3 | 57ms | 90212 KiB | |||
23 | Elfogadva | 3/3 | 54ms | 90768 KiB | |||
24 | Elfogadva | 3/3 | 54ms | 90660 KiB |