Submission #3005330
Source Code Expand
N = int(input()) a, b = map(int, input().split()) a -= 1 b -= 1 M = int(input()) R = [[] for i in range(N)] for i in range(M): x, y = map(int, input().split()) R[x-1] += [y-1] R[y-1] += [x-1] cost = [0 for i in range(N)] undone = {i for i in range(N)} undone -= {a} current = [a] while undone: temp, current = current, [] for i in temp: for j in set(R[i])&undone: cost[j] = cost[i] + 1 current.append(j) undone -= {j} def rootSearch(now, To, goal, cost, memo = {}): if now == goal: return 1 elif cost[now] >= cost[goal]: return 0 try: return memo[now] except KeyError: count = 0 for i in To[now]: if cost[i] > cost[now]: count += rootSearch(i, To, goal, cost, memo) % 1000000007 memo[now] = count return count rootcount = {} print(rootSearch(a, R, b, cost, rootcount))
Submission Info
Submission Time | |
---|---|
Task | C - 正直者の高橋くん |
User | earlgrey_yh |
Language | Python (3.4.3) |
Score | 100 |
Code Size | 976 Byte |
Status | AC |
Exec Time | 18 ms |
Memory | 3188 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 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 | 17 ms | 3064 KB |
subtask0_sample_02.txt | AC | 17 ms | 3064 KB |
subtask1_01.txt | AC | 18 ms | 3188 KB |
subtask1_02.txt | AC | 18 ms | 3188 KB |
subtask1_03.txt | AC | 17 ms | 3064 KB |
subtask1_04.txt | AC | 18 ms | 3064 KB |
subtask1_05.txt | AC | 18 ms | 3064 KB |
subtask1_06.txt | AC | 17 ms | 3064 KB |
subtask1_07.txt | AC | 17 ms | 3064 KB |
subtask1_08.txt | AC | 17 ms | 3064 KB |
subtask1_09.txt | AC | 17 ms | 3064 KB |
subtask1_10.txt | AC | 17 ms | 3064 KB |
subtask1_11.txt | AC | 18 ms | 3064 KB |
subtask1_12.txt | AC | 18 ms | 3064 KB |
subtask1_13.txt | AC | 18 ms | 3064 KB |
subtask1_14.txt | AC | 18 ms | 3064 KB |
subtask1_15.txt | AC | 18 ms | 3064 KB |
subtask1_16.txt | AC | 18 ms | 3064 KB |
subtask1_17.txt | AC | 18 ms | 3064 KB |
subtask1_18.txt | AC | 18 ms | 3064 KB |
subtask1_19.txt | AC | 18 ms | 3064 KB |
subtask1_20.txt | AC | 18 ms | 3064 KB |
subtask1_21.txt | AC | 18 ms | 3064 KB |
subtask1_22.txt | AC | 17 ms | 3064 KB |
subtask1_23.txt | AC | 18 ms | 3064 KB |
subtask1_24.txt | AC | 18 ms | 3064 KB |
subtask1_25.txt | AC | 18 ms | 3064 KB |
subtask1_26.txt | AC | 18 ms | 3064 KB |
subtask1_27.txt | AC | 18 ms | 3064 KB |
subtask1_28.txt | AC | 18 ms | 3064 KB |
subtask1_29.txt | AC | 18 ms | 3064 KB |
subtask1_30.txt | AC | 17 ms | 3064 KB |