結果
問題 | No.317 辺の追加 |
ユーザー | rpy3cpp |
提出日時 | 2016-02-29 22:37:03 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 388 ms / 2,000 ms |
コード長 | 2,015 bytes |
コンパイル時間 | 425 ms |
コンパイル使用メモリ | 81,852 KB |
実行使用メモリ | 82,360 KB |
最終ジャッジ日時 | 2023-10-24 19:15:46 |
合計ジャッジ時間 | 12,726 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 38 ms
53,364 KB |
testcase_01 | AC | 38 ms
53,364 KB |
testcase_02 | AC | 318 ms
81,128 KB |
testcase_03 | AC | 331 ms
80,144 KB |
testcase_04 | AC | 313 ms
81,444 KB |
testcase_05 | AC | 311 ms
79,412 KB |
testcase_06 | AC | 345 ms
80,368 KB |
testcase_07 | AC | 226 ms
77,916 KB |
testcase_08 | AC | 334 ms
81,972 KB |
testcase_09 | AC | 338 ms
82,080 KB |
testcase_10 | AC | 380 ms
82,208 KB |
testcase_11 | AC | 151 ms
81,180 KB |
testcase_12 | AC | 377 ms
82,068 KB |
testcase_13 | AC | 199 ms
81,240 KB |
testcase_14 | AC | 352 ms
82,304 KB |
testcase_15 | AC | 371 ms
82,056 KB |
testcase_16 | AC | 339 ms
81,944 KB |
testcase_17 | AC | 368 ms
82,168 KB |
testcase_18 | AC | 388 ms
82,360 KB |
testcase_19 | AC | 374 ms
82,044 KB |
testcase_20 | AC | 340 ms
82,236 KB |
testcase_21 | AC | 116 ms
78,500 KB |
testcase_22 | AC | 103 ms
77,480 KB |
testcase_23 | AC | 106 ms
77,516 KB |
testcase_24 | AC | 136 ms
80,424 KB |
testcase_25 | AC | 123 ms
79,224 KB |
testcase_26 | AC | 124 ms
79,340 KB |
testcase_27 | AC | 118 ms
78,600 KB |
testcase_28 | AC | 109 ms
77,532 KB |
testcase_29 | AC | 91 ms
76,364 KB |
testcase_30 | AC | 372 ms
81,000 KB |
testcase_31 | AC | 237 ms
80,944 KB |
testcase_32 | AC | 337 ms
80,984 KB |
testcase_33 | AC | 231 ms
80,944 KB |
testcase_34 | AC | 334 ms
80,960 KB |
testcase_35 | AC | 236 ms
80,936 KB |
testcase_36 | AC | 236 ms
80,936 KB |
testcase_37 | AC | 260 ms
80,936 KB |
testcase_38 | AC | 244 ms
80,936 KB |
testcase_39 | AC | 339 ms
80,984 KB |
ソースコード
class DisjointSet(object): def __init__(self, n): self.parent = list(range(n)) self.rank = [0] * n def union(self, x, y): self._link(self.find_set(x), self.find_set(y)) def _link(self, x, y): if x == y: return if self.rank[x] > self.rank[y]: self.parent[y] = x else: self.parent[x] = y if self.rank[x] == self.rank[y]: self.rank[y] += 1 def find_set(self, x): xp = self.parent[x] if xp != x: self.parent[x] = self.find_set(xp) return self.parent[x] def read_data(): N, M = map(int, input().split()) ds = DisjointSet(N) for m in range(M): u, v = map(int, input().split()) u -= 1 v -= 1 if u == v: continue ds.union(u, v) return N, ds def solve2(N, ds): counts = [0] * N for i in range(N): counts[ds.find_set(i)] += 1 freqs = [0] * (N + 1) for c in counts: freqs[c] += 1 vs = [] ms = [] for i, f in enumerate(freqs): if f and i: vs.append(i) ms.append(f) dp = solve_min_coins(vs, ms, N) for w in dp[1:]: print(w - 1) def solve_min_coins(vs, ms, N): dp = [0] * (N + 1) cum = 0 for v, m in zip(vs, ms): cum = update_dp(v, m, dp, cum) return dp def update_dp(v, m, dp, cum): if v == 1: for i in range(m + 1): dp[i] = i return cum + v * m pow2 = 1 while pow2 < m: update_dp_core(v * pow2, pow2, dp, cum) cum += v * pow2 m -= pow2 pow2 <<= 1 update_dp_core(v * m, m, dp, cum) return cum + v * m def update_dp_core(v, w, dp, cum): for i in range(cum, 0, -1): if dp[i]: dpiv = dp[i + v] if dp[i] + w < dpiv or dpiv == 0: dp[i + v] = dp[i] + w if dp[v] > w or dp[v] == 0: dp[v] = w N, ds = read_data() solve2(N, ds)