結果
問題 | No.1194 Replace |
ユーザー | tktk_snsn |
提出日時 | 2021-02-08 22:59:45 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,108 ms / 2,000 ms |
コード長 | 2,831 bytes |
コンパイル時間 | 216 ms |
コンパイル使用メモリ | 82,304 KB |
実行使用メモリ | 270,232 KB |
最終ジャッジ日時 | 2024-07-06 03:34:22 |
合計ジャッジ時間 | 20,304 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 801 ms
213,652 KB |
testcase_01 | AC | 818 ms
218,420 KB |
testcase_02 | AC | 669 ms
189,852 KB |
testcase_03 | AC | 580 ms
169,196 KB |
testcase_04 | AC | 855 ms
218,204 KB |
testcase_05 | AC | 788 ms
204,952 KB |
testcase_06 | AC | 660 ms
197,304 KB |
testcase_07 | AC | 1,108 ms
270,232 KB |
testcase_08 | AC | 1,103 ms
269,432 KB |
testcase_09 | AC | 1,088 ms
268,640 KB |
testcase_10 | AC | 1,059 ms
269,160 KB |
testcase_11 | AC | 1,085 ms
269,456 KB |
testcase_12 | AC | 1,064 ms
268,788 KB |
testcase_13 | AC | 760 ms
196,872 KB |
testcase_14 | AC | 578 ms
162,424 KB |
testcase_15 | AC | 587 ms
153,804 KB |
testcase_16 | AC | 702 ms
165,816 KB |
testcase_17 | AC | 571 ms
146,736 KB |
testcase_18 | AC | 496 ms
144,768 KB |
testcase_19 | AC | 735 ms
193,484 KB |
testcase_20 | AC | 37 ms
52,608 KB |
testcase_21 | AC | 35 ms
52,608 KB |
testcase_22 | AC | 35 ms
53,096 KB |
testcase_23 | AC | 325 ms
112,692 KB |
testcase_24 | AC | 170 ms
91,264 KB |
testcase_25 | AC | 106 ms
79,892 KB |
testcase_26 | AC | 340 ms
115,840 KB |
testcase_27 | AC | 104 ms
82,816 KB |
testcase_28 | AC | 205 ms
94,592 KB |
testcase_29 | AC | 100 ms
78,888 KB |
ソースコード
import sys input = sys.stdin.buffer.readline sys.setrecursionlimit(10 ** 7) class SCC_graph(object): def __init__(self, n): """n:ノード数""" self.n = n self.edges = [] def add_edge(self, frm, to): """frm -> toへ有効辺を張る""" self.edges.append((frm, to)) def __csr(self): self.start = [0] * (self.n + 1) self.elist = [0] * len(self.edges) for frm, to in self.edges: self.start[frm + 1] += 1 for i in range(1, self.n + 1): self.start[i] += self.start[i - 1] cnt = self.start[:] for frm, to in self.edges: self.elist[cnt[frm]] = to cnt[frm] += 1 def __dfs(self, v): self.low[v] = self.now_ord self.order[v] = self.now_ord self.now_ord += 1 self.visited.append(v) for i in range(self.start[v], self.start[v + 1]): to = self.elist[i] if self.order[to] == -1: self.__dfs(to) self.low[v] = min(self.low[v], self.low[to]) else: self.low[v] = min(self.low[v], self.order[to]) if self.low[v] == self.order[v]: while self.visited: u = self.visited.pop() self.order[u] = self.n self.ids[u] = self.group_num if u == v: break self.group_num += 1 def _make_scc_ids(self): self.__csr() self.now_ord = 0 self.group_num = 0 self.visited = [] self.low = [0] * self.n self.ids = [0] * self.n self.order = [-1] * self.n for i in range(self.n): if self.order[i] == -1: self.__dfs(i) for i in range(self.n): self.ids[i] = self.group_num - 1 - self.ids[i] def scc(self): self._make_scc_ids() groups = [[] for _ in range(self.group_num)] for i in range(self.n): groups[self.ids[i]].append(i) return groups, self.ids N, M = map(int, input().split()) BC = tuple(tuple(map(int, input().split())) for _ in range(M)) val = set() for b, c in BC: val.add(b) val.add(c) val = sorted(val) vtoi = {v: i for i, v in enumerate(val)} sz = len(val) G = SCC_graph(sz) for b, c in BC: s = vtoi[b] t = vtoi[c] G.add_edge(s, t) group, gtoi = G.scc() edge = [set() for _ in range(len(group))] for b, c in BC: s = gtoi[vtoi[b]] t = gtoi[vtoi[c]] edge[t].add(s) vmax = [0] * len(group) for s in reversed(range(len(group))): g = group[s] vmax[s] = max(vmax[s], max(g)) for t in edge[s]: vmax[t] = max(vmax[t], vmax[s]) ans = N * (N + 1) // 2 for v, g in zip(vmax, group): for i in g: ans -= val[i] ans += val[v] print(ans)