結果
問題 | No.1254 補強への架け橋 |
ユーザー | marroncastle |
提出日時 | 2020-10-10 01:36:30 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 1,985 bytes |
コンパイル時間 | 354 ms |
コンパイル使用メモリ | 87,212 KB |
実行使用メモリ | 202,764 KB |
最終ジャッジ日時 | 2023-09-27 20:44:26 |
合計ジャッジ時間 | 40,888 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 97 ms
76,148 KB |
testcase_01 | AC | 99 ms
76,160 KB |
testcase_02 | AC | 100 ms
76,088 KB |
testcase_03 | AC | 101 ms
76,112 KB |
testcase_04 | AC | 99 ms
75,828 KB |
testcase_05 | AC | 105 ms
76,212 KB |
testcase_06 | AC | 100 ms
75,872 KB |
testcase_07 | AC | 98 ms
75,960 KB |
testcase_08 | AC | 100 ms
76,200 KB |
testcase_09 | AC | 98 ms
75,876 KB |
testcase_10 | AC | 97 ms
76,216 KB |
testcase_11 | AC | 98 ms
75,868 KB |
testcase_12 | AC | 99 ms
76,228 KB |
testcase_13 | AC | 99 ms
76,264 KB |
testcase_14 | AC | 98 ms
76,264 KB |
testcase_15 | AC | 100 ms
76,116 KB |
testcase_16 | AC | 95 ms
76,320 KB |
testcase_17 | AC | 96 ms
75,748 KB |
testcase_18 | AC | 99 ms
76,164 KB |
testcase_19 | AC | 97 ms
76,116 KB |
testcase_20 | AC | 99 ms
75,964 KB |
testcase_21 | AC | 98 ms
76,116 KB |
testcase_22 | AC | 100 ms
76,092 KB |
testcase_23 | AC | 99 ms
76,088 KB |
testcase_24 | AC | 95 ms
76,172 KB |
testcase_25 | AC | 96 ms
75,964 KB |
testcase_26 | AC | 97 ms
76,164 KB |
testcase_27 | AC | 96 ms
76,172 KB |
testcase_28 | AC | 96 ms
76,088 KB |
testcase_29 | AC | 95 ms
76,156 KB |
testcase_30 | AC | 102 ms
76,052 KB |
testcase_31 | AC | 103 ms
76,096 KB |
testcase_32 | AC | 99 ms
76,116 KB |
testcase_33 | AC | 112 ms
76,172 KB |
testcase_34 | AC | 99 ms
76,256 KB |
testcase_35 | AC | 101 ms
76,172 KB |
testcase_36 | AC | 97 ms
75,964 KB |
testcase_37 | AC | 98 ms
75,744 KB |
testcase_38 | AC | 95 ms
75,872 KB |
testcase_39 | AC | 95 ms
75,824 KB |
testcase_40 | AC | 97 ms
76,324 KB |
testcase_41 | AC | 97 ms
76,148 KB |
testcase_42 | AC | 97 ms
76,112 KB |
testcase_43 | AC | 120 ms
78,400 KB |
testcase_44 | AC | 99 ms
77,152 KB |
testcase_45 | AC | 131 ms
77,432 KB |
testcase_46 | AC | 142 ms
77,800 KB |
testcase_47 | AC | 137 ms
77,828 KB |
testcase_48 | AC | 143 ms
78,064 KB |
testcase_49 | AC | 131 ms
76,188 KB |
testcase_50 | AC | 150 ms
77,600 KB |
testcase_51 | AC | 149 ms
77,804 KB |
testcase_52 | AC | 148 ms
77,744 KB |
testcase_53 | AC | 150 ms
77,636 KB |
testcase_54 | AC | 147 ms
77,820 KB |
testcase_55 | AC | 119 ms
77,860 KB |
testcase_56 | AC | 97 ms
76,296 KB |
testcase_57 | AC | 111 ms
77,604 KB |
testcase_58 | AC | 114 ms
77,900 KB |
testcase_59 | AC | 98 ms
75,868 KB |
testcase_60 | AC | 103 ms
77,524 KB |
testcase_61 | AC | 116 ms
77,912 KB |
testcase_62 | AC | 101 ms
76,356 KB |
testcase_63 | AC | 185 ms
86,116 KB |
testcase_64 | AC | 144 ms
80,140 KB |
testcase_65 | AC | 171 ms
83,568 KB |
testcase_66 | AC | 164 ms
82,588 KB |
testcase_67 | AC | 130 ms
79,884 KB |
testcase_68 | AC | 166 ms
83,384 KB |
testcase_69 | AC | 169 ms
83,752 KB |
testcase_70 | AC | 141 ms
80,516 KB |
testcase_71 | AC | 138 ms
79,764 KB |
testcase_72 | AC | 165 ms
83,852 KB |
testcase_73 | AC | 130 ms
79,816 KB |
testcase_74 | AC | 160 ms
83,760 KB |
testcase_75 | AC | 156 ms
82,388 KB |
testcase_76 | AC | 121 ms
79,352 KB |
testcase_77 | AC | 149 ms
82,180 KB |
testcase_78 | AC | 172 ms
85,152 KB |
testcase_79 | AC | 174 ms
85,260 KB |
testcase_80 | AC | 163 ms
84,600 KB |
testcase_81 | AC | 174 ms
85,392 KB |
testcase_82 | AC | 170 ms
84,680 KB |
testcase_83 | AC | 571 ms
202,764 KB |
testcase_84 | AC | 542 ms
194,576 KB |
testcase_85 | AC | 312 ms
114,536 KB |
testcase_86 | AC | 430 ms
146,056 KB |
testcase_87 | AC | 538 ms
184,456 KB |
testcase_88 | AC | 185 ms
88,552 KB |
testcase_89 | AC | 674 ms
185,064 KB |
testcase_90 | AC | 358 ms
122,828 KB |
testcase_91 | AC | 312 ms
112,112 KB |
testcase_92 | AC | 242 ms
97,112 KB |
testcase_93 | AC | 367 ms
123,792 KB |
testcase_94 | AC | 414 ms
148,292 KB |
testcase_95 | AC | 408 ms
143,872 KB |
testcase_96 | AC | 517 ms
177,336 KB |
testcase_97 | AC | 284 ms
106,144 KB |
testcase_98 | AC | 577 ms
178,840 KB |
testcase_99 | AC | 359 ms
128,468 KB |
testcase_100 | AC | 563 ms
202,384 KB |
testcase_101 | AC | 217 ms
92,544 KB |
testcase_102 | AC | 184 ms
87,280 KB |
testcase_103 | AC | 217 ms
93,436 KB |
testcase_104 | AC | 221 ms
96,544 KB |
testcase_105 | AC | 413 ms
142,968 KB |
testcase_106 | AC | 278 ms
106,364 KB |
testcase_107 | AC | 573 ms
197,496 KB |
testcase_108 | AC | 525 ms
176,740 KB |
testcase_109 | AC | 362 ms
129,004 KB |
testcase_110 | AC | 395 ms
139,004 KB |
testcase_111 | AC | 402 ms
141,368 KB |
testcase_112 | AC | 241 ms
98,344 KB |
testcase_113 | AC | 392 ms
154,716 KB |
testcase_114 | AC | 248 ms
101,064 KB |
testcase_115 | AC | 189 ms
88,036 KB |
testcase_116 | AC | 314 ms
120,636 KB |
testcase_117 | AC | 246 ms
101,112 KB |
testcase_118 | AC | 463 ms
157,000 KB |
testcase_119 | AC | 351 ms
119,816 KB |
testcase_120 | AC | 497 ms
166,932 KB |
testcase_121 | AC | 213 ms
93,808 KB |
testcase_122 | AC | 306 ms
113,832 KB |
testcase_123 | AC | 96 ms
76,096 KB |
testcase_124 | TLE | - |
testcase_125 | -- | - |
ソースコード
import sys,os,io input = sys.stdin.readline from collections import defaultdict class Graph: def __init__(self, N): self.V = N self.edge = [[] for _ in range(self.V)] self.edges = defaultdict(lambda: 0) self.visited = [0]*N self.parent = [N]*N def add_edge(self, a, b, i): self.edge[a].append(b) self.edges[(a,b)] = i def dfs(self, start): stack = [start] self.parent[start] = -1 self.visited[start] = 1 #記録したい値の配列を定義 while stack: v = stack[-1] for u,i in self.edge[v]: if u==self.parent[v]: continue if self.parent[u]==N: #子へ降ろす self.parent[u]=v stack.append(u) break else: return u else: stack.pop() def bfs1(self, start): stack = [start] self.parent[start] = -1 while stack: v = stack.pop() for u in self.edge[v]: if u==self.parent[v]: continue if self.parent[u]!=N: return u self.parent[u]=v #頂点に対する処理 stack.append(u) return def bfs(self, start): d = deque() d.append([[start],{start:True}]) cyc = [] cnt = 0 while len(d)>0 and cnt<N*2+1: vs, tf = d.popleft() for w in self.edge[vs[-1]]: if len(vs)>1 and w==vs[-2]: continue lis,dic = copy(vs), copy(tf) lis.append(w) dic[w] = True if w==start and len(lis)>len(cyc): cyc = lis elif w not in tf: d.append([lis,dic]) cnt += 1 return cyc from collections import deque from copy import copy N = int(input()) G = Graph(N) for i in range(N): a,b = map(int, input().split()) a,b = min(a-1,b-1), max(a-1,b-1) G.add_edge(a,b,i+1) G.add_edge(b,a,i+1) ans = set() cyc = G.bfs1(0) vs = G.bfs(cyc) for v0,v1 in zip(vs[:-1],vs[1:]): ans.add(G.edges[(v0,v1)]) ans = list(ans) print(len(ans)) print(*ans)