結果

問題 No.1194 Replace
ユーザー tktk_snsntktk_snsn
提出日時 2021-02-08 22:59:45
言語 PyPy3
(7.3.15)
結果
TLE  
実行時間 -
コード長 2,831 bytes
コンパイル時間 543 ms
コンパイル使用メモリ 86,916 KB
実行使用メモリ 720,272 KB
最終ジャッジ日時 2023-09-20 07:39:58
合計ジャッジ時間 30,678 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,251 ms
321,852 KB
testcase_01 AC 1,469 ms
391,368 KB
testcase_02 AC 926 ms
207,124 KB
testcase_03 AC 748 ms
173,732 KB
testcase_04 AC 1,390 ms
373,436 KB
testcase_05 AC 1,166 ms
268,952 KB
testcase_06 AC 898 ms
234,604 KB
testcase_07 AC 1,345 ms
270,872 KB
testcase_08 AC 1,330 ms
270,068 KB
testcase_09 AC 1,335 ms
269,588 KB
testcase_10 AC 1,326 ms
269,848 KB
testcase_11 AC 1,337 ms
270,232 KB
testcase_12 AC 1,312 ms
269,264 KB
testcase_13 TLE -
testcase_14 AC 947 ms
163,692 KB
testcase_15 AC 839 ms
200,132 KB
testcase_16 AC 955 ms
170,120 KB
testcase_17 AC 815 ms
189,644 KB
testcase_18 AC 635 ms
146,160 KB
testcase_19 MLE -
testcase_20 AC 82 ms
71,172 KB
testcase_21 AC 77 ms
71,192 KB
testcase_22 AC 77 ms
70,968 KB
testcase_23 AC 434 ms
114,824 KB
testcase_24 AC 231 ms
92,088 KB
testcase_25 AC 150 ms
82,676 KB
testcase_26 AC 439 ms
116,952 KB
testcase_27 AC 153 ms
84,496 KB
testcase_28 AC 273 ms
96,804 KB
testcase_29 AC 144 ms
80,088 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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)
0