제출 #1239839

#제출 시각아이디문제언어결과실행 시간메모리
1239839woeCircle Passing (EGOI24_circlepassing)Pypy 3
0 / 100
134 ms48784 KiB
from collections import deque def solve(N, M, Q, friends, queries): G = [[] for _ in range(2*N)] for i in range(2*N): G[i].append((i + 1) % (2*N)) G[i].append((i - 1) % (2*N)) for k in friends: G[k].append(k + N) G[k + N].append(k) def bfs(x, y): dist = [-1] * (2*N) q = deque([x]) dist[x] = 0 while q: v = q.popleft() if v == y: return dist[v] for u in G[v]: if dist[u] == -1: dist[u] = dist[v] + 1 q.append(u) return -1 return [bfs(x, y) for x, y in queries]

컴파일 시 표준 출력 (stdout) 메시지

Compiling 'Main.py'...

=======
  adding: __main__.pyc (deflated 41%)

=======
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...