(cache)Submission #66743125 - AtCoder Beginner Contest 410

Contest Duration: 2025-06-14(Sat) 21:00 - 2025-06-14(Sat) 22:40 (local time) (100 minutes) Back to Home

Submission #66743125

Source Code Expand

Copy

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
N,M = map(int,input().split())
graph = {i: [] for i in range(N)}
for i in range(M):
    u,v,w = map(int,input().split())
    graph[v-1].append((u-1, w))
dp = [2**11-1] * N
dp[0] = 0
for _ in range(N):
    for i in range(1,N):
        t = graph[i]
        for j in range(len(t)):
            u, w = t[j]
            dp[i] = min(dp[i], dp[u] ^ w)
if dp[N-1] == 2**11-1:
    print(-1)
else:
    print(dp[N-1])
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

N,M = map(int,input().split())
graph = {i: [] for i in range(N)}
for i in range(M):
    u,v,w = map(int,input().split())
    graph[v-1].append((u-1, w))
dp = [2**11-1] * N
dp[0] = 0
for _ in range(N):
    for i in range(1,N):
        t = graph[i]
        for j in range(len(t)):
            u, w = t[j]
            dp[i] = min(dp[i], dp[u] ^ w)
if dp[N-1] == 2**11-1:
    print(-1)
else:
    print(dp[N-1])

Submission Info

Submission Time	2025-06-14 21:25:37
Task	D - XOR Shortest Walk
User	kangping
Language	Python (PyPy 3.10-v7.3.12)
Score	0
Code Size	422 Byte
Status	WA
Exec Time	103 ms
Memory	83260 KiB

Judge Result

Set Name

Sample

All

Score / Max Score

0 / 0

0 / 400

Status

× 3

AC	× 28
WA	× 5

Set Name	Test Cases
Sample	sample_01.txt, sample_02.txt, sample_03.txt
All	hand_01.txt, hand_02.txt, hand_03.txt, hand_04.txt, hand_05.txt, hand_06.txt, hand_07.txt, hand_08.txt, random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, random_06.txt, random_07.txt, random_08.txt, random_09.txt, random_10.txt, random_11.txt, random_12.txt, random_13.txt, random_14.txt, random_15.txt, random_16.txt, random_17.txt, random_18.txt, random_19.txt, random_20.txt, random_21.txt, random_22.txt, sample_01.txt, sample_02.txt, sample_03.txt

Case Name	Status	Exec Time	Memory
hand_01.txt	AC	61 ms	76548 KiB
hand_02.txt	AC	60 ms	76460 KiB
hand_03.txt	AC	62 ms	76228 KiB
hand_04.txt	AC	61 ms	76216 KiB
hand_05.txt	AC	60 ms	76412 KiB
hand_06.txt	AC	59 ms	76316 KiB
hand_07.txt	AC	59 ms	76300 KiB
hand_08.txt	AC	61 ms	76592 KiB
random_01.txt	AC	61 ms	76332 KiB
random_02.txt	AC	76 ms	81704 KiB
random_03.txt	AC	61 ms	76428 KiB
random_04.txt	AC	75 ms	81528 KiB
random_05.txt	AC	62 ms	76292 KiB
random_06.txt	AC	70 ms	81644 KiB
random_07.txt	AC	61 ms	76592 KiB
random_08.txt	AC	74 ms	81928 KiB
random_09.txt	AC	64 ms	81472 KiB
random_10.txt	AC	81 ms	81640 KiB
random_11.txt	AC	60 ms	76456 KiB
random_12.txt	AC	74 ms	81440 KiB
random_13.txt	WA	65 ms	81668 KiB
random_14.txt	WA	72 ms	81740 KiB
random_15.txt	WA	63 ms	81104 KiB
random_16.txt	AC	71 ms	81536 KiB
random_17.txt	AC	86 ms	81812 KiB
random_18.txt	AC	84 ms	81644 KiB
random_19.txt	AC	90 ms	81724 KiB
random_20.txt	AC	97 ms	83064 KiB
random_21.txt	WA	103 ms	83260 KiB
random_22.txt	WA	100 ms	82784 KiB
sample_01.txt	AC	60 ms	76504 KiB
sample_02.txt	AC	60 ms	76548 KiB
sample_03.txt	AC	73 ms	81852 KiB