結果

問題 No.19 ステージの選択
ユーザー tktk_snsntktk_snsn
提出日時 2021-03-28 19:18:46
言語 Python3
(3.12.2 + numpy 1.26.4 + scipy 1.12.0)
結果
AC  
実行時間 34 ms / 5,000 ms
コード長 2,867 bytes
コンパイル時間 954 ms
コンパイル使用メモリ 12,544 KB
実行使用メモリ 10,880 KB
最終ジャッジ日時 2024-11-29 09:21:27
合計ジャッジ時間 3,229 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 32 ms
10,880 KB
testcase_01 AC 32 ms
10,624 KB
testcase_02 AC 33 ms
10,752 KB
testcase_03 AC 32 ms
10,496 KB
testcase_04 AC 34 ms
10,752 KB
testcase_05 AC 32 ms
10,752 KB
testcase_06 AC 32 ms
10,624 KB
testcase_07 AC 32 ms
10,624 KB
testcase_08 AC 33 ms
10,752 KB
testcase_09 AC 33 ms
10,752 KB
testcase_10 AC 30 ms
10,624 KB
testcase_11 AC 31 ms
10,496 KB
testcase_12 AC 31 ms
10,880 KB
testcase_13 AC 31 ms
10,624 KB
testcase_14 AC 30 ms
10,880 KB
testcase_15 AC 31 ms
10,752 KB
testcase_16 AC 30 ms
10,752 KB
testcase_17 AC 31 ms
10,880 KB
testcase_18 AC 30 ms
10,752 KB
testcase_19 AC 30 ms
10,624 KB
testcase_20 AC 30 ms
10,624 KB
testcase_21 AC 30 ms
10,624 KB
testcase_22 AC 30 ms
10,624 KB
testcase_23 AC 30 ms
10,624 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, make_adj=False):
        """
        強連結成分のリストをトポロジカル順に返す
        """
        self._make_scc_ids()
        groups = [[] for _ in range(self.group_num)]
        for i in range(self.n):
            groups[self.ids[i]].append(i)
        if not make_adj:
            return groups
        adj = [set() for _ in range(self.group_num)]
        for a, b in self.edges:
            a = self.ids[a]
            b = self.ids[b]
            if a == b:
                continue
            adj[a].add(b)
        return groups, adj


N = int(input())
dif = [0] * N
G = SCC_graph(N)
for i in range(N):
    dif[i], s = map(int, input().split())
    if i != s - 1:
        G.add_edge(s - 1, i)

group, adj = G.scc(True)
label = G.ids
half = [0]*len(group)
ans = 0

for g in group:
    d = [dif[i] for i in g]
    ans += sum(d)

    i = label[g[0]]
    if not half[i]:
        ans += min(d)
    for to in adj[i]:
        half[to] = 1

print("{:.1f}".format(ans*0.5))
0