結果
問題 | No.2642 Don't cut line! |
ユーザー |
![]() |
提出日時 | 2024-02-22 12:04:14 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 942 ms / 4,000 ms |
コード長 | 4,051 bytes |
コンパイル時間 | 210 ms |
コンパイル使用メモリ | 82,552 KB |
実行使用メモリ | 144,800 KB |
最終ジャッジ日時 | 2024-09-29 04:26:28 |
合計ジャッジ時間 | 24,410 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 33 |
ソースコード
import sysinput = sys.stdin.readlineclass UnionFind(object):def __init__(self, n=1):self.par = [i for i in range(n)]self.rank = [0 for _ in range(n)]self.size = [1 for _ in range(n)]def find(self, x):if self.par[x] == x:return xelse:self.par[x] = self.find(self.par[x])return self.par[x]def union(self, x, y):x = self.find(x)y = self.find(y)if x != y:if self.rank[x] < self.rank[y]:x, y = y, xif self.rank[x] == self.rank[y]:self.rank[x] += 1self.par[y] = xself.size[x] += self.size[y]def is_same(self, x, y):return self.find(x) == self.find(y)def get_size(self, x):x = self.find(x)return self.size[x]class LowestCommonAncestor:def __init__(self, n):self._n = nself._logn = 0v = 1while v <= self._n:v *= 2self._logn += 1self._depth = [0] * self._nself._distance = [0] * self._nself._ancestor = [[-1] * self._n for _ in range(self._logn)]self.dp = [[-1] * self._n for _ in range(self._logn)]self._G = [[] for i in range(self._n)]def add_edge(self, u, v, w=1):self._G[u].append((v, w))self._G[v].append((u, w))def build(self, root=0):stack = [root]while stack:cur = stack.pop()for nex, w in self._G[cur]:if self._ancestor[0][nex] != cur and self._ancestor[0][cur] != nex:self._ancestor[0][nex] = curself._depth[nex] = self._depth[cur] + 1self._distance[nex] = self._distance[cur] + wstack.append(nex)self.dp[0][nex] = wfor k in range(1, self._logn):for i in range(self._n):if self._ancestor[k - 1][i] == -1:self._ancestor[k][i] = -1self.dp[k][i] = self.dp[k-1][i]else:self._ancestor[k][i] = self._ancestor[k - 1][self._ancestor[k - 1][i]]self.dp[k][i] = max(self.dp[k-1][i], self.dp[k-1][self._ancestor[k - 1][i]])def lca(self, u, v):if self._depth[u] > self._depth[v]:u, v = v, ufor k in range(self._logn - 1, -1, -1):if ((self._depth[v] - self._depth[u]) >> k) & 1:v = self._ancestor[k][v]if u == v:return ufor k in range(self._logn - 1, -1, -1):if self._ancestor[k][u] != self._ancestor[k][v]:u = self._ancestor[k][u]v = self._ancestor[k][v]return self._ancestor[0][u]def distance(self, u, v):return self._distance[u] + self._distance[v] - 2 * self._distance[self.lca(u, v)]def query(self, a, b):lca = self.lca(a, b)return max(self.max_edge(a, self._depth[a] - self._depth[lca]), self.max_edge(b, self._depth[b] - self._depth[lca]))def max_edge(self, a, d):now = -10 ** 18for i in range(self._logn):if (d >> i) & 1:now = max(now, self.dp[i][a])a = self._ancestor[i][a]return nowN, M, cost = map(int, input().split())U = UnionFind(N)used = [0] * MEdge = []for i in range(M):A, B, C, p = map(int, input().split())A, B = A - 1, B - 1Edge.append((C, A, B, p, i))Edge.sort()base = 0T = LowestCommonAncestor(N)for c, a, b, p, i in Edge:if U.is_same(a, b):continueused[i] = 1U.union(a, b)T.add_edge(a, b, c)base += cif base > cost:print(-1)exit()ans = -1T.build(0)for c, a, b, p, i in Edge:if used[i]:ans = max(ans, p)continueif base + c - T.query(a, b) <= cost:ans = max(ans, p)print(ans)