(cache)Submission #66743491 - 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 #66743491

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(M):
    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(M):
    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:26:09
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	107 ms
Memory	83012 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	58 ms	76344 KiB
hand_02.txt	AC	58 ms	76464 KiB
hand_03.txt	AC	59 ms	76472 KiB
hand_04.txt	AC	58 ms	76496 KiB
hand_05.txt	AC	59 ms	76540 KiB
hand_06.txt	AC	59 ms	76512 KiB
hand_07.txt	AC	60 ms	76444 KiB
hand_08.txt	AC	58 ms	76192 KiB
random_01.txt	AC	59 ms	76492 KiB
random_02.txt	AC	74 ms	81644 KiB
random_03.txt	AC	63 ms	76480 KiB
random_04.txt	AC	75 ms	81628 KiB
random_05.txt	AC	64 ms	76512 KiB
random_06.txt	AC	71 ms	81428 KiB
random_07.txt	AC	67 ms	76364 KiB
random_08.txt	AC	78 ms	81680 KiB
random_09.txt	AC	68 ms	81232 KiB
random_10.txt	AC	86 ms	81600 KiB
random_11.txt	AC	64 ms	76584 KiB
random_12.txt	AC	79 ms	81684 KiB
random_13.txt	WA	73 ms	81712 KiB
random_14.txt	WA	81 ms	81704 KiB
random_15.txt	WA	71 ms	81664 KiB
random_16.txt	AC	72 ms	81400 KiB
random_17.txt	AC	90 ms	81884 KiB
random_18.txt	AC	91 ms	81532 KiB
random_19.txt	AC	93 ms	81788 KiB
random_20.txt	AC	103 ms	82876 KiB
random_21.txt	WA	107 ms	83012 KiB
random_22.txt	WA	106 ms	82604 KiB
sample_01.txt	AC	63 ms	76292 KiB
sample_02.txt	AC	64 ms	76260 KiB
sample_03.txt	AC	65 ms	80928 KiB