Submission #58981280


Source Code Expand

Copy
N, M = map(int, input().split())
G = [[] for _ in range(N)]
for _ in range(M):
a, b = map(lambda x: int(x) - 1, input().split())
G[a].append(b)
dist = [float('inf')] * N
ans = float('inf')
#dist[0] = 1
from heapq import *
que = []
heappush(que,(0,0))
while que:
di,v = heappop(que)
for vv in G[v]:
if vv == 0:
ans = min(ans, di + 1)
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
N, M = map(int, input().split())
G = [[] for _ in range(N)]

for _ in range(M):
    a, b = map(lambda x: int(x) - 1, input().split())
    G[a].append(b)

dist = [float('inf')] * N 
ans = float('inf')
#dist[0] = 1

from heapq import *

que = []
heappush(que,(0,0))

while que:
  di,v = heappop(que)
  for vv in G[v]:
    if vv == 0:
      ans = min(ans, di + 1)
    if dist[vv] > di + 1:
      dist[vv] = di + 1
      heappush(que,(di+1,vv))

print(-1 if ans == float('inf') else ans)

Submission Info

Submission Time
Task D - Cycle
User QWERTOP18
Language Python (PyPy 3.10-v7.3.12)
Score 400
Code Size 510 Byte
Status AC
Exec Time 379 ms
Memory 108576 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 39
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt
All 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 01_random_00.txt, 01_random_01.txt, 01_random_02.txt, 01_random_03.txt, 01_random_04.txt, 01_random_05.txt, 01_random_06.txt, 01_random_07.txt, 01_random_08.txt, 01_random_09.txt, 01_random_10.txt, 01_random_11.txt, 01_random_12.txt, 01_random_13.txt, 01_random_14.txt, 01_random_15.txt, 01_random_16.txt, 01_random_17.txt, 01_random_18.txt, 01_random_19.txt, 01_random_20.txt, 01_random_21.txt, 01_random_22.txt, 01_random_23.txt, 01_random_24.txt, 01_random_25.txt, 01_random_26.txt, 01_random_27.txt, 01_random_28.txt, 01_random_29.txt, 01_random_30.txt, 01_random_31.txt, 02_cycle_00.txt, 02_cycle_01.txt, 03_path_00.txt, 03_path_01.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 57 ms 76332 KB
00_sample_01.txt AC 59 ms 76520 KB
00_sample_02.txt AC 59 ms 76628 KB
01_random_00.txt AC 186 ms 101912 KB
01_random_01.txt AC 161 ms 90068 KB
01_random_02.txt AC 253 ms 101604 KB
01_random_03.txt AC 156 ms 88112 KB
01_random_04.txt AC 379 ms 105652 KB
01_random_05.txt AC 206 ms 90016 KB
01_random_06.txt AC 161 ms 100676 KB
01_random_07.txt AC 238 ms 94884 KB
01_random_08.txt AC 298 ms 104504 KB
01_random_09.txt AC 197 ms 89552 KB
01_random_10.txt AC 278 ms 102284 KB
01_random_11.txt AC 183 ms 89416 KB
01_random_12.txt AC 186 ms 102224 KB
01_random_13.txt AC 155 ms 89552 KB
01_random_14.txt AC 237 ms 101876 KB
01_random_15.txt AC 179 ms 89612 KB
01_random_16.txt AC 314 ms 104588 KB
01_random_17.txt AC 137 ms 87372 KB
01_random_18.txt AC 179 ms 100428 KB
01_random_19.txt AC 147 ms 87764 KB
01_random_20.txt AC 378 ms 105740 KB
01_random_21.txt AC 332 ms 97552 KB
01_random_22.txt AC 316 ms 102584 KB
01_random_23.txt AC 133 ms 86820 KB
01_random_24.txt AC 187 ms 100864 KB
01_random_25.txt AC 282 ms 94968 KB
01_random_26.txt AC 315 ms 103256 KB
01_random_27.txt AC 195 ms 89548 KB
01_random_28.txt AC 307 ms 104108 KB
01_random_29.txt AC 231 ms 90784 KB
01_random_30.txt AC 149 ms 100956 KB
01_random_31.txt AC 172 ms 87632 KB
02_cycle_00.txt AC 204 ms 108576 KB
02_cycle_01.txt AC 249 ms 108440 KB
03_path_00.txt AC 157 ms 108284 KB
03_path_01.txt AC 202 ms 108532 KB


2025-04-15 (Tue)
21:06:51 +00:00