結果
問題 | No.1813 Magical Stones |
ユーザー | aaaaaaaaaa2230 |
提出日時 | 2022-01-20 23:16:44 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 311 ms / 2,000 ms |
コード長 | 3,477 bytes |
コンパイル時間 | 342 ms |
コンパイル使用メモリ | 87,188 KB |
実行使用メモリ | 118,776 KB |
最終ジャッジ日時 | 2023-08-15 23:56:57 |
合計ジャッジ時間 | 10,079 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 70 ms
71,272 KB |
testcase_01 | AC | 71 ms
71,388 KB |
testcase_02 | AC | 71 ms
71,360 KB |
testcase_03 | AC | 116 ms
85,592 KB |
testcase_04 | AC | 70 ms
71,572 KB |
testcase_05 | AC | 73 ms
71,112 KB |
testcase_06 | AC | 113 ms
78,064 KB |
testcase_07 | AC | 72 ms
71,384 KB |
testcase_08 | AC | 86 ms
76,836 KB |
testcase_09 | AC | 91 ms
76,464 KB |
testcase_10 | AC | 82 ms
76,528 KB |
testcase_11 | AC | 151 ms
80,952 KB |
testcase_12 | AC | 70 ms
71,464 KB |
testcase_13 | AC | 70 ms
71,636 KB |
testcase_14 | AC | 107 ms
85,556 KB |
testcase_15 | AC | 306 ms
106,300 KB |
testcase_16 | AC | 301 ms
106,056 KB |
testcase_17 | AC | 274 ms
118,776 KB |
testcase_18 | AC | 301 ms
105,360 KB |
testcase_19 | AC | 292 ms
105,460 KB |
testcase_20 | AC | 307 ms
106,132 KB |
testcase_21 | AC | 305 ms
105,512 KB |
testcase_22 | AC | 296 ms
105,524 KB |
testcase_23 | AC | 311 ms
105,784 KB |
testcase_24 | AC | 108 ms
77,844 KB |
testcase_25 | AC | 140 ms
80,424 KB |
testcase_26 | AC | 122 ms
79,316 KB |
testcase_27 | AC | 245 ms
94,696 KB |
testcase_28 | AC | 277 ms
108,904 KB |
testcase_29 | AC | 276 ms
97,988 KB |
testcase_30 | AC | 263 ms
97,920 KB |
testcase_31 | AC | 273 ms
102,056 KB |
testcase_32 | AC | 73 ms
71,264 KB |
testcase_33 | AC | 70 ms
71,692 KB |
testcase_34 | AC | 127 ms
79,072 KB |
testcase_35 | AC | 130 ms
81,800 KB |
testcase_36 | AC | 114 ms
78,148 KB |
testcase_37 | AC | 158 ms
86,164 KB |
testcase_38 | AC | 137 ms
87,180 KB |
testcase_39 | AC | 233 ms
92,396 KB |
testcase_40 | AC | 120 ms
78,268 KB |
testcase_41 | AC | 103 ms
78,124 KB |
testcase_42 | AC | 126 ms
81,868 KB |
testcase_43 | AC | 143 ms
79,944 KB |
ソースコード
import sys input = sys.stdin.readline class SCC: def __init__(self,n): self.n = n self.edges = [] def csr(self): self.start = [0]*(self.n+1) self.elist = [0]*len(self.edges) for e in self.edges: self.start[e[0]+1] += 1 for i in range(1,self.n+1): self.start[i] += self.start[i-1] counter = self.start[:] for e in self.edges: self.elist[counter[e[0]]] = e[1] counter[e[0]] += 1 def add_edge(self,u,v): self.edges.append((u,v)) def scc_ids(self): self.csr() n = self.n now_ord = group_num = 0 visited = [] low = [0]*n order = [-1]*n ids = [0]*n parent = [-1]*n stack = [] for i in range(n): if order[i] == -1: stack.append(i) stack.append(i) while stack: v = stack.pop() if order[v] == -1: low[v] = order[v] = now_ord now_ord += 1 visited.append(v) for i in range(self.start[v],self.start[v+1]): to = self.elist[i] if order[to] == -1: stack.append(to) stack.append(to) parent[to] = v else: low[v] = min(low[v],order[to]) else: if low[v] == order[v]: while True: u = visited.pop() order[u] = n ids[u] = group_num if u == v: break group_num += 1 if parent[v] != -1: low[parent[v]] = min(low[parent[v]],low[v]) for i,x in enumerate(ids): ids[i] = group_num-1-x return group_num,ids def scc(self): group_num,ids = self.scc_ids() groups = [[] for i in range(group_num)] for i,x in enumerate(ids): groups[x].append(i) return groups class Unionfind: def __init__(self,n): self.uf = [-1]*n def find(self,x): if self.uf[x] < 0: return x else: self.uf[x] = self.find(self.uf[x]) return self.uf[x] def same(self,x,y): return self.find(x) == self.find(y) def union(self,x,y): x = self.find(x) y = self.find(y) if x == y: return False if self.uf[x] > self.uf[y]: x,y = y,x self.uf[x] += self.uf[y] self.uf[y] = x return True def size(self,x): x = self.find(x) return -self.uf[x] n,m = map(int,input().split()) scc = SCC(n) for i in range(m): a,b = [int(x)-1 for x in input().split()] scc.add_edge(a,b) group = scc.scc() groups = [0]*n for i,g in enumerate(group): for j in g: groups[j] = i ans = 0 used = [1]*len(group) used2 = [1]*len(group) for a,b in scc.edges: if groups[a] != groups[b]: used[groups[a]] = 0 used2[groups[b]] = 0 ans = max(sum(used),sum(used2)) if len(used) == 1: ans = 0 print(ans)