Submission #1569148
Source Code Expand
def BFS(K,edges,N): roots=[ [] for i in range(N)] for a,b,c in edges: roots[a-1]+=[(b-1,c)] roots[b-1]+=[(a-1,c)] dist=[-1]*N stack=[] stack.append(K) dist[K]=0 while stack: label=stack.pop(-1) for i,c in roots[label]: if dist[i]==-1: dist[i]=dist[label]+c stack+=[i] return dist N=int(input()) edges=[] for i in range(N-1): edges+=[list(map(int,input().split()))] Q,K=map(int,input().split()) xy=[list(map(int,input().split())) for i in range(Q)] distance=BFS(K-1,edges,N) for i in range(Q): print(distance[xy[i][0]-1]+distance[xy[i][1]-1])
Submission Info
Submission Time | |
---|---|
Task | D - Transit Tree Path |
User | wkb89_ |
Language | Python (3.4.3) |
Score | 400 |
Code Size | 626 Byte |
Status | AC |
Exec Time | 1163 ms |
Memory | 86008 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_2.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 17 ms | 3064 KB |
sample_02.txt | AC | 17 ms | 3064 KB |
sample_03.txt | AC | 17 ms | 3064 KB |
subtask_1_1.txt | AC | 18 ms | 3064 KB |
subtask_1_10.txt | AC | 280 ms | 16056 KB |
subtask_1_11.txt | AC | 20 ms | 3188 KB |
subtask_1_12.txt | AC | 39 ms | 4212 KB |
subtask_1_13.txt | AC | 104 ms | 7144 KB |
subtask_1_14.txt | AC | 18 ms | 3064 KB |
subtask_1_15.txt | AC | 44 ms | 5964 KB |
subtask_1_16.txt | AC | 1131 ms | 86008 KB |
subtask_1_17.txt | AC | 1124 ms | 85928 KB |
subtask_1_18.txt | AC | 1123 ms | 85924 KB |
subtask_1_19.txt | AC | 1163 ms | 85992 KB |
subtask_1_2.txt | AC | 25 ms | 3700 KB |
subtask_1_20.txt | AC | 1049 ms | 86004 KB |
subtask_1_21.txt | AC | 1060 ms | 85956 KB |
subtask_1_22.txt | AC | 1019 ms | 85904 KB |
subtask_1_23.txt | AC | 1013 ms | 85976 KB |
subtask_1_24.txt | AC | 983 ms | 80420 KB |
subtask_1_25.txt | AC | 995 ms | 80428 KB |
subtask_1_26.txt | AC | 980 ms | 80432 KB |
subtask_1_27.txt | AC | 986 ms | 80432 KB |
subtask_1_28.txt | AC | 976 ms | 79664 KB |
subtask_1_3.txt | AC | 710 ms | 59752 KB |
subtask_1_4.txt | AC | 18 ms | 3064 KB |
subtask_1_5.txt | AC | 383 ms | 24736 KB |
subtask_1_6.txt | AC | 108 ms | 10588 KB |
subtask_1_7.txt | AC | 304 ms | 20148 KB |
subtask_1_8.txt | AC | 17 ms | 3064 KB |
subtask_1_9.txt | AC | 734 ms | 65396 KB |