Submission #3005049
Source Code Expand
from collections import defaultdict,deque import sys,heapq,bisect,math,itertools,string,queue,datetime sys.setrecursionlimit(10**8) INF = float('inf') mod = 10**9+7 eps = 10**-7 def inpl(): return list(map(int, input().split())) def inpl_s(): return list(input().split()) N = int(input()) Start,Goal = inpl() Start -= 1 Goal -= 1 M = int(input()) lines = defaultdict(set) for i in range(M): a,b = inpl() #a <-> b コスト:c a,b = a-1,b-1 lines[a].add((b,1)) lines[b].add((a,1)) def search (s,w_0): #s->t global weight global q for line in list(lines[s]): t = line[0] w = w_0 + line[1] if weight[t][0] > w: heapq.heappush(q, [w,t]) weight[t][0] = w weight = [[INF,i] for i in range(N)] weight[Start][0] = 0 q = [[0,Start]] heapq.heapify(q) while q: w,n = heapq.heappop(q) search(n,w) weight.sort() cnts = [0]*N cnts[Start] = 1 for w,i in weight: n = cnts[i] for t,nyan in list(lines[i]): if weight[t][0] == weight[i][0]+1: cnts[t] += n print(cnts[Goal])
Submission Info
Submission Time | |
---|---|
Task | C - 正直者の高橋くん |
User | simamumu |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 1046 Byte |
Status | WA |
Exec Time | 41 ms |
Memory | 4580 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample_01.txt, subtask0_sample_02.txt |
All | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample_01.txt | AC | 41 ms | 4580 KB |
subtask0_sample_02.txt | AC | 29 ms | 4200 KB |
subtask1_01.txt | AC | 30 ms | 4196 KB |
subtask1_02.txt | WA | 30 ms | 4204 KB |
subtask1_03.txt | WA | 29 ms | 4204 KB |
subtask1_04.txt | WA | 31 ms | 4200 KB |
subtask1_05.txt | WA | 30 ms | 4196 KB |
subtask1_06.txt | WA | 30 ms | 4196 KB |
subtask1_07.txt | WA | 30 ms | 4196 KB |
subtask1_08.txt | WA | 29 ms | 4204 KB |
subtask1_09.txt | WA | 29 ms | 4196 KB |
subtask1_10.txt | WA | 29 ms | 4196 KB |
subtask1_11.txt | WA | 30 ms | 4204 KB |
subtask1_12.txt | WA | 30 ms | 4200 KB |
subtask1_13.txt | WA | 30 ms | 4196 KB |
subtask1_14.txt | WA | 30 ms | 4200 KB |
subtask1_15.txt | WA | 30 ms | 4196 KB |
subtask1_16.txt | WA | 30 ms | 4196 KB |
subtask1_17.txt | WA | 30 ms | 4204 KB |
subtask1_18.txt | WA | 32 ms | 4196 KB |
subtask1_19.txt | WA | 31 ms | 4324 KB |
subtask1_20.txt | WA | 31 ms | 4204 KB |
subtask1_21.txt | WA | 31 ms | 4204 KB |
subtask1_22.txt | WA | 31 ms | 4200 KB |
subtask1_23.txt | WA | 30 ms | 4196 KB |
subtask1_24.txt | WA | 30 ms | 4196 KB |
subtask1_25.txt | WA | 30 ms | 4196 KB |
subtask1_26.txt | WA | 30 ms | 4196 KB |
subtask1_27.txt | WA | 30 ms | 4200 KB |
subtask1_28.txt | AC | 31 ms | 4204 KB |
subtask1_29.txt | AC | 30 ms | 4196 KB |
subtask1_30.txt | AC | 29 ms | 4204 KB |