Submission #1030589
Source Code Expand
inputs=lambda:map(int,raw_input().split()) n, m = inputs() es = [inputs() for i in xrange(m)] es.sort(key=lambda x:x[2]) parent = range(n+1) def root(x): if x == parent[x]: return x parent[x] = root(parent[x]) return parent[x] def unite(x, y): px = root(x) py = root(y) if px < py: parent[py] = px else: parent[px] = py su = 0 g = [[] for i in xrange(n+1)] for c, a, b in es: if root(a) != root(b): unite(a, b) su += c g[a].append((b, c)) g[b].append((a, c)) import sys sys.setrecursionlimit(100000) dic = {} def dfs(s, v, prev, cost): dic[s,v] = cost for e, c in g[v]: if prev != e: dfs(s, e, v, max(cost, c)) for i in xrange(n): dfs(i+1, i+1, -1, 0) for i in xrange(input()): s, t = inputs() print su-dic[s,t]
Submission Info
Submission Time | |
---|---|
Task | A - Graph |
User | yaketake08 |
Language | PyPy2 (5.6.0) |
Score | 0 |
Code Size | 880 Byte |
Status | RE |
Exec Time | 920 ms |
Memory | 80156 KB |
Judge Result
Set Name | Sample | subtask1 | subtask2 | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 200 | 0 / 300 | 0 / 200 | ||||||||
Status |
|
|
|
|
Set Name | Test Cases |
---|---|
Sample | sample_1.txt, sample_2.txt |
subtask1 | sample_2.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_2.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 |
subtask2 | sample_1.txt, sample_2.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_2.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, subtask_2_1.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt |
All | sample_1.txt, sample_2.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_2.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, subtask_2_1.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt, subtask_3_1.txt, subtask_3_2.txt, subtask_3_3.txt, subtask_3_4.txt, subtask_3_5.txt, subtask_3_6.txt, subtask_3_7.txt, subtask_3_8.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_1.txt | RE | 39 ms | 8944 KB |
sample_2.txt | RE | 38 ms | 8944 KB |
subtask_1_1.txt | RE | 99 ms | 12656 KB |
subtask_1_10.txt | RE | 476 ms | 49948 KB |
subtask_1_11.txt | RE | 38 ms | 8944 KB |
subtask_1_2.txt | RE | 157 ms | 24732 KB |
subtask_1_3.txt | RE | 874 ms | 80028 KB |
subtask_1_4.txt | RE | 79 ms | 12144 KB |
subtask_1_5.txt | RE | 83 ms | 13936 KB |
subtask_1_6.txt | RE | 270 ms | 33820 KB |
subtask_1_7.txt | RE | 888 ms | 80156 KB |
subtask_1_8.txt | RE | 82 ms | 12144 KB |
subtask_1_9.txt | RE | 105 ms | 20636 KB |
subtask_2_1.txt | RE | 901 ms | 80028 KB |
subtask_2_2.txt | RE | 876 ms | 80028 KB |
subtask_2_3.txt | RE | 875 ms | 80028 KB |
subtask_2_4.txt | RE | 877 ms | 80028 KB |
subtask_2_5.txt | RE | 79 ms | 12144 KB |
subtask_2_6.txt | RE | 122 ms | 21660 KB |
subtask_2_7.txt | RE | 272 ms | 33820 KB |
subtask_2_8.txt | RE | 887 ms | 80028 KB |
subtask_3_1.txt | RE | 920 ms | 80028 KB |
subtask_3_2.txt | RE | 898 ms | 80028 KB |
subtask_3_3.txt | RE | 80 ms | 12144 KB |
subtask_3_4.txt | RE | 105 ms | 20636 KB |
subtask_3_5.txt | RE | 464 ms | 49052 KB |
subtask_3_6.txt | RE | 685 ms | 62748 KB |
subtask_3_7.txt | RE | 896 ms | 80028 KB |
subtask_3_8.txt | RE | 897 ms | 80028 KB |