9441 | 2024. 02. 21 17:50:53 | NagyLeo | Kaktuszgráf | python3 | Elfogadva 50/50 | 21ms | 15736 KiB |
from sys import stdin, stdout, setrecursionlimit
input=stdin.readline
setrecursionlimit(10**5)
def main():
N, M = map(int, input().split())
graph = [[] for i in range(N+1)]
for i in range(M):
A, B = map(int, input().split())
graph[A].append(B)
graph[B].append(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 | 17ms | 11388 KiB | |||
2 | Elfogadva | 0/0 | 19ms | 11592 KiB | |||
3 | Elfogadva | 2/2 | 19ms | 12056 KiB | |||
4 | Elfogadva | 2/2 | 19ms | 12416 KiB | |||
5 | Elfogadva | 2/2 | 19ms | 12604 KiB | |||
6 | Elfogadva | 2/2 | 20ms | 12888 KiB | |||
7 | Elfogadva | 2/2 | 20ms | 13412 KiB | |||
8 | Elfogadva | 2/2 | 20ms | 13316 KiB | |||
9 | Elfogadva | 2/2 | 20ms | 13508 KiB | |||
10 | Elfogadva | 2/2 | 20ms | 13372 KiB | |||
11 | Elfogadva | 2/2 | 20ms | 13312 KiB | |||
12 | Elfogadva | 2/2 | 20ms | 13332 KiB | |||
13 | Elfogadva | 2/2 | 20ms | 13280 KiB | |||
14 | Elfogadva | 2/2 | 20ms | 13192 KiB | |||
15 | Elfogadva | 2/2 | 20ms | 13276 KiB | |||
16 | Elfogadva | 2/2 | 20ms | 13484 KiB | |||
17 | Elfogadva | 2/2 | 20ms | 13656 KiB | |||
18 | Elfogadva | 2/2 | 20ms | 13660 KiB | |||
19 | Elfogadva | 3/3 | 20ms | 13788 KiB | |||
20 | Elfogadva | 3/3 | 20ms | 14696 KiB | |||
21 | Elfogadva | 3/3 | 21ms | 15476 KiB | |||
22 | Elfogadva | 3/3 | 21ms | 15456 KiB | |||
23 | Elfogadva | 3/3 | 20ms | 15700 KiB | |||
24 | Elfogadva | 3/3 | 20ms | 15736 KiB |