#947629 (Go) No.901 K-ary εxtrεεmε

提出ソース
結果

問題	No.901 K-ary εxtrεεmε
ユーザー	草苺奶昔
提出日時	2024-02-03 12:06:54
言語	Go (1.22.1)
結果	AC
実行時間	411 ms / 3,000 ms
コード長	19,049 bytes
コンパイル時間	11,593 ms
コンパイル使用メモリ	238,076 KB
実行使用メモリ	42,976 KB
最終ジャッジ日時	2024-09-28 10:48:26
合計ジャッジ時間	23,030 ms
ジャッジサーバーID （参考情報）	judge4 / judge1
このコードへのチャレンジ
（要ログイン）
テストケース

テストケース表示
入力	結果	実行時間実行使用メモリ
testcase_00	AC	286 ms 42,976 KB
testcase_01	AC	2 ms 5,248 KB
testcase_02	AC	6 ms 5,248 KB
testcase_03	AC	7 ms 5,376 KB
testcase_04	AC	6 ms 5,376 KB
testcase_05	AC	7 ms 5,376 KB
testcase_06	AC	7 ms 5,376 KB
testcase_07	AC	392 ms 33,384 KB
testcase_08	AC	381 ms 33,612 KB
testcase_09	AC	376 ms 33,120 KB
testcase_10	AC	387 ms 34,432 KB
testcase_11	AC	382 ms 33,600 KB
testcase_12	AC	365 ms 33,376 KB
testcase_13	AC	363 ms 34,304 KB
testcase_14	AC	369 ms 33,664 KB
testcase_15	AC	361 ms 34,176 KB
testcase_16	AC	368 ms 33,792 KB
testcase_17	AC	402 ms 33,412 KB
testcase_18	AC	407 ms 32,000 KB
testcase_19	AC	404 ms 33,152 KB
testcase_20	AC	411 ms 33,552 KB
testcase_21	AC	408 ms 32,640 KB
testcase_22	AC	371 ms 35,712 KB
testcase_23	AC	365 ms 34,772 KB
testcase_24	AC	365 ms 35,200 KB
testcase_25	AC	363 ms 35,328 KB
testcase_26	AC	363 ms 35,200 KB
testcase_27	AC	401 ms 33,384 KB
testcase_28	AC	402 ms 30,976 KB
testcase_29	AC	404 ms 31,616 KB
権限があれば一括ダウンロードができます
ソースコード

raw source code
package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
)

const INF int = 1e18

func main() {
	// ColouredMountainHut()
	// CF613D()
	Yuki3407()
}

func demo() {
	n := 5
	rawTree := NewTree(n)
	rawTree.AddEdge(0, 1, 1)
	rawTree.AddEdge(0, 2, 2)
	rawTree.AddEdge(1, 3, 3)
	rawTree.AddEdge(1, 4, 4)
	rawTree.Build(0)

	isCritical := make([]bool, n)
	criticals := []int{0, 1, 4}
	for _, v := range criticals {
		isCritical[v] = true
	}
	newIds, newTree := CompressTree(rawTree, criticals, false)
	inCriticals := make([]bool, len(newIds)) // 虚树上的某个节点是否在criticals中
	for i := 0; i < len(newIds); i++ {
		inCriticals[i] = isCritical[newIds[i]]
	}
	fmt.Println(newIds, newTree.Dist(0, 1, false))
	for _, v := range criticals {
		isCritical[v] = false
	}
}

// https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0439
// 给定一棵树,每个点有一个颜色。
// 对每一种颜色相同的点，求出每个点到其他点距离的最小值。保证每种颜色的点至少有两个。
// !虚树上求点对距离.
func ColouredMountainHut() {
	in := bufio.NewReader(os.Stdin)
	out := bufio.NewWriter(os.Stdout)
	defer out.Flush()

	var n int
	fmt.Fscan(in, &n)
	colors := make([]int, n)
	for i := 0; i < n; i++ {
		fmt.Fscan(in, &colors[i])
	}
	tree := NewTree(n)
	for i := 0; i < n-1; i++ {
		var u, v int
		fmt.Fscan(in, &u, &v)
		tree.AddEdge(u-1, v-1, 1)
	}
	tree.Build(0)

	groupByColor := make(map[int][]int)
	for i, c := range colors {
		groupByColor[c] = append(groupByColor[c], i)
	}

	res := make([]int, n)
	for i := 0; i < n; i++ {
		res[i] = INF
	}

	isCritical := make([]bool, n)
	for _, criticals := range groupByColor {
		for _, v := range criticals {
			isCritical[v] = true
		}

		newIds, newTree := CompressTree(tree, criticals, false)
		adjList := newTree.Tree
		starts := make([]int, 0, len(criticals)) // !获取critials 在新树上的编号
		for i := 0; i < len(newIds); i++ {
			if isCritical[newIds[i]] {
				starts = append(starts, i)
			}
		}
		minDistToOther, _ := MinDistToOther(adjList, starts)
		for i := 0; i < len(starts); i++ {
			node := newIds[starts[i]]
			res[node] = min(res[node], minDistToOther[i])
		}

		for _, v := range criticals {
			isCritical[v] = false
		}
	}

	for _, v := range res {
		fmt.Fprintln(out, v)
	}
}

// 给定一棵树，每次询问给定 k个特殊点，找出尽量少的非特殊点使得删去这些点后特殊点两两不连通。∑k≤n.
// 如果无法使得特殊点两两不连通，输出-1.
// https://codeforces.com/problemset/problem/613/D
func CF613D() {
	in := bufio.NewReader(os.Stdin)
	out := bufio.NewWriter(os.Stdout)
	defer out.Flush()

	var n int
	fmt.Fscan(in, &n)
	tree := NewTree(n)
	for i := 0; i < n-1; i++ {
		var u, v int
		fmt.Fscan(in, &u, &v)
		tree.AddEdge(u-1, v-1, 1)
	}
	tree.Build(0)

	// !dp[i] 表示子树中保留i个关键点时的最小删除点数
	// ①:如果一个点被标记了,那么就要把他所有子树里有标记点的儿子都去掉
	// ②:如果一个点没有被标记,但是这个点有两颗以上的子树里有标记点，那么这个点就要去掉,然后这棵子树就没有可标记点了
	// ③:如果一个点子树里只有一个/没有标记点，那么就标记点的贡献挪到这个点上面来
	solve := func(adjList [][][2]int, inCriticals []bool) int {
		var dfs func(cur, pre int) [2]int // (zero, one)
		dfs = func(cur, pre int) [2]int {
			removeCost := 1
			dp := [2]int{INF, INF}
			if inCriticals[cur] {
				removeCost = INF // 无法删除
				dp[1] = 0
			} else {
				dp[0] = 0
			}

			for _, e := range adjList[cur] {
				next := e[0]
				if next == pre {
					continue
				}
				subDp := dfs(next, cur)
				ndp := [2]int{INF, INF}
				for a := 0; a < 2; a++ {
					for b := 0; b < 2; b++ {
						if a == 1 && b == 1 { // !不能>=2个关键点
							continue
						}
						ndp[a+b] = min(ndp[a+b], dp[a]+subDp[b])
					}
				}
				dp = ndp
				removeCost += min(subDp[0], subDp[1])
			}

			dp[0] = min(dp[0], removeCost)
			return dp
		}

		dp := dfs(0, -1)
		res := min(dp[0], dp[1])
		if res >= INF {
			res = -1
		}
		return res
	}

	isCritical := make([]bool, n)
	var q int
	fmt.Fscan(in, &q)
	for i := 0; i < q; i++ {
		var k int
		fmt.Fscan(in, &k)
		criticals := make([]int, k)
		for j := 0; j < k; j++ {
			var v int
			fmt.Fscan(in, &v)
			v--
			criticals[j] = v
			isCritical[v] = true
		}

		nodes := append(criticals[:0:0], criticals...)
		for _, v := range criticals {
			if v != 0 {
				nodes = append(nodes, tree.Parent[v]) // !父节点加进来
			}
		}
		nodes = unique(nodes)

		newIds, newTree := CompressTree(tree, nodes, true)
		m := len(newIds)
		inCriticals := make([]bool, m) // !压缩后的树中的节点是否在points中
		for i := 0; i < m; i++ {
			inCriticals[i] = isCritical[newIds[i]]
		}
		fmt.Println(solve(newTree.Tree, inCriticals))
		for _, v := range criticals {
			isCritical[v] = false
		}
	}
}

// 虚树+换根dp
// https://codeforces.com/problemset/problem/1320/E
func CF1320E() {

}

// P2495 [SDOI2011] 消耗战
// 给定一棵树，每次询问给定 k个特殊点，需要断掉一些边使得从根节点无法到达任何特殊点，求最小需要断掉的边数。∑k≤2n.
// https://www.luogu.com.cn/problem/P2495
func P2495() {

}

// P4103 [HEOI2014] 大工程
// 给定一棵树，每次询问给定 k个特殊点，求它们两两之间距离的距离和，最小距离和最大距离。∑k≤2n.
// https://www.luogu.com.cn/problem/P4103
func P4103() {

}

// No.901 K-ary εxtrεεmε
// https://yukicoder.me/problems/3407
// !给定q个查询,求虚树(最小的包含指定点集的连通子图)组成的的边权之和
// !求虚树边权之和.
//
// 第二种解法是按照dfs序排序，求树链并, https://yukicoder.me/submissions/756376
func Yuki3407() {
	in := bufio.NewReader(os.Stdin)
	out := bufio.NewWriter(os.Stdout)
	defer out.Flush()

	var n int
	fmt.Fscan(in, &n)
	tree := NewTree(n)
	for i := 0; i < n-1; i++ {
		var u, v, w int
		fmt.Fscan(in, &u, &v, &w)
		tree.AddEdge(u, v, w)
	}
	tree.Build(0)

	var q int
	fmt.Fscan(in, &q)
	for i := 0; i < q; i++ {
		var k int
		fmt.Fscan(in, &k)
		criticals := make([]int, k)
		for j := 0; j < k; j++ {
			fmt.Fscan(in, &criticals[j])
		}

		_, newTree := CompressTree(tree, criticals, true)
		adjList := newTree.Tree

		res := 0
		for _, nexts := range adjList {
			for _, e := range nexts {
				res += e[1]
			}
		}
		fmt.Fprintln(out, res)
	}
}

// 返回树压缩后保留的节点编号和新的树.
// !新的树保留了原树的边权.
func CompressTree(rawTree *Tree, nodes []int, directed bool) (remainNodes []int, newTree *Tree) {
	remainNodes = append(nodes[:0:0], nodes...)
	sort.Slice(remainNodes, func(i, j int) bool { return rawTree.LID[remainNodes[i]] < rawTree.LID[remainNodes[j]] })
	n := len(remainNodes)
	for i := 0; i < n; i++ {
		j := i + 1
		if j == n {
			j = 0
		}
		remainNodes = append(remainNodes, rawTree.LCA(remainNodes[i], remainNodes[j]))
	}
	// remainNodes = append(remainNodes, rawTree.IdToNode[0]) // !将根节点加入点集后,建立出来的虚树一定包含根节点，方便 dp
	sort.Slice(remainNodes, func(i, j int) bool { return rawTree.LID[remainNodes[i]] < rawTree.LID[remainNodes[j]] })

	unique := func(a []int) []int {
		visited := make(map[int]struct{})
		newNums := []int{}
		for _, v := range a {
			if _, ok := visited[v]; !ok {
				visited[v] = struct{}{}
				newNums = append(newNums, v)
			}
		}
		return newNums
	}

	remainNodes = unique(remainNodes)
	n = len(remainNodes)
	newTree = NewTree(n)

	stack := []int{0}
	for i := 1; i < n; i++ {
		for {
			p := remainNodes[stack[len(stack)-1]]
			v := remainNodes[i]
			if rawTree.IsInSubtree(v, p) {
				break
			}
			stack = stack[:len(stack)-1]
		}
		p := remainNodes[stack[len(stack)-1]]
		v := remainNodes[i]
		d := rawTree.DepthWeighted[v] - rawTree.DepthWeighted[p]
		newTree.AddDirectedEdge(stack[len(stack)-1], i, d)
		if !directed {
			newTree.AddDirectedEdge(i, stack[len(stack)-1], d)
		}
		stack = append(stack, i)
	}
	newTree.Build(0)
	return
}

type Tree struct {
	Tree                 [][][2]int // (next, weight)
	Depth, DepthWeighted []int
	Parent               []int
	LID, RID             []int // 欧拉序[in,out)
	IdToNode             []int
	top, heavySon        []int
	timer                int
}

func NewTree(n int) *Tree {
	tree := make([][][2]int, n)
	lid := make([]int, n)
	rid := make([]int, n)
	IdToNode := make([]int, n)
	top := make([]int, n)   // 所处轻/重链的顶点（深度最小），轻链的顶点为自身
	depth := make([]int, n) // 深度
	depthWeighted := make([]int, n)
	parent := make([]int, n)   // 父结点
	heavySon := make([]int, n) // 重儿子
	for i := range parent {
		parent[i] = -1
	}

	return &Tree{
		Tree:          tree,
		Depth:         depth,
		DepthWeighted: depthWeighted,
		Parent:        parent,
		LID:           lid,
		RID:           rid,
		IdToNode:      IdToNode,
		top:           top,
		heavySon:      heavySon,
	}
}

// 添加无向边 u-v, 边权为w.
func (tree *Tree) AddEdge(u, v, w int) {
	tree.Tree[u] = append(tree.Tree[u], [2]int{v, w})
	tree.Tree[v] = append(tree.Tree[v], [2]int{u, w})
}

// 添加有向边 u->v, 边权为w.
func (tree *Tree) AddDirectedEdge(u, v, w int) {
	tree.Tree[u] = append(tree.Tree[u], [2]int{v, w})
}

// root:0-based
//
//	当root设为-1时，会从0开始遍历未访问过的连通分量
func (tree *Tree) Build(root int) {
	if root != -1 {
		tree.build(root, -1, 0, 0)
		tree.markTop(root, root)
	} else {
		for i := 0; i < len(tree.Tree); i++ {
			if tree.Parent[i] == -1 {
				tree.build(i, -1, 0, 0)
				tree.markTop(i, i)
			}
		}
	}
}

// 返回 root 的欧拉序区间, 左闭右开, 0-indexed.
func (tree *Tree) Id(root int) (int, int) {
	return tree.LID[root], tree.RID[root]
}

// 返回返回边 u-v 对应的 欧拉序起点编号, 1 <= eid <= n-1., 0-indexed.
func (tree *Tree) Eid(u, v int) int {
	if tree.LID[u] > tree.LID[v] {
		return tree.LID[u]
	}
	return tree.LID[v]
}

func (tree *Tree) LCA(u, v int) int {
	for {
		if tree.LID[u] > tree.LID[v] {
			u, v = v, u
		}
		if tree.top[u] == tree.top[v] {
			return u
		}
		v = tree.Parent[tree.top[v]]
	}
}

func (tree *Tree) RootedLCA(u, v int, root int) int {
	return tree.LCA(u, v) ^ tree.LCA(u, root) ^ tree.LCA(v, root)
}

func (tree *Tree) RootedParent(u int, root int) int {
	return tree.Jump(u, root, 1)
}

func (tree *Tree) Dist(u, v int, weighted bool) int {
	if weighted {
		return tree.DepthWeighted[u] + tree.DepthWeighted[v] - 2*tree.DepthWeighted[tree.LCA(u, v)]
	}
	return tree.Depth[u] + tree.Depth[v] - 2*tree.Depth[tree.LCA(u, v)]
}

// k: 0-based
//
//	如果不存在第k个祖先，返回-1
//	kthAncestor(root,0) == root
func (tree *Tree) KthAncestor(root, k int) int {
	if k > tree.Depth[root] {
		return -1
	}
	for {
		u := tree.top[root]
		if tree.LID[root]-k >= tree.LID[u] {
			return tree.IdToNode[tree.LID[root]-k]
		}
		k -= tree.LID[root] - tree.LID[u] + 1
		root = tree.Parent[u]
	}
}

// 从 from 节点跳向 to 节点,跳过 step 个节点(0-indexed)
//
//	返回跳到的节点,如果不存在这样的节点,返回-1
func (tree *Tree) Jump(from, to, step int) int {
	if step == 1 {
		if from == to {
			return -1
		}
		if tree.IsInSubtree(to, from) {
			return tree.KthAncestor(to, tree.Depth[to]-tree.Depth[from]-1)
		}
		return tree.Parent[from]
	}
	c := tree.LCA(from, to)
	dac := tree.Depth[from] - tree.Depth[c]
	dbc := tree.Depth[to] - tree.Depth[c]
	if step > dac+dbc {
		return -1
	}
	if step <= dac {
		return tree.KthAncestor(from, step)
	}
	return tree.KthAncestor(to, dac+dbc-step)
}

func (tree *Tree) CollectChild(root int) []int {
	res := []int{}
	for _, e := range tree.Tree[root] {
		next := e[0]
		if next != tree.Parent[root] {
			res = append(res, next)
		}
	}
	return res
}

// 返回沿着`路径顺序`的 [起点,终点] 的 欧拉序 `左闭右闭` 数组.
//
//	!eg:[[2 0] [4 4]] 沿着路径顺序但不一定沿着欧拉序.
func (tree *Tree) GetPathDecomposition(u, v int, vertex bool) [][2]int {
	up, down := [][2]int{}, [][2]int{}
	for {
		if tree.top[u] == tree.top[v] {
			break
		}
		if tree.LID[u] < tree.LID[v] {
			down = append(down, [2]int{tree.LID[tree.top[v]], tree.LID[v]})
			v = tree.Parent[tree.top[v]]
		} else {
			up = append(up, [2]int{tree.LID[u], tree.LID[tree.top[u]]})
			u = tree.Parent[tree.top[u]]
		}
	}
	edgeInt := 1
	if vertex {
		edgeInt = 0
	}
	if tree.LID[u] < tree.LID[v] {
		down = append(down, [2]int{tree.LID[u] + edgeInt, tree.LID[v]})
	} else if tree.LID[v]+edgeInt <= tree.LID[u] {
		up = append(up, [2]int{tree.LID[u], tree.LID[v] + edgeInt})
	}
	for i := 0; i < len(down)/2; i++ {
		down[i], down[len(down)-1-i] = down[len(down)-1-i], down[i]
	}
	return append(up, down...)
}

// 遍历路径上的 `[起点,终点)` 欧拉序 `左闭右开` 区间.
func (tree *Tree) EnumeratePathDecomposition(u, v int, vertex bool, f func(start, end int)) {
	for {
		if tree.top[u] == tree.top[v] {
			break
		}
		if tree.LID[u] < tree.LID[v] {
			a, b := tree.LID[tree.top[v]], tree.LID[v]
			if a > b {
				a, b = b, a
			}
			f(a, b+1)
			v = tree.Parent[tree.top[v]]
		} else {
			a, b := tree.LID[u], tree.LID[tree.top[u]]
			if a > b {
				a, b = b, a
			}
			f(a, b+1)
			u = tree.Parent[tree.top[u]]
		}
	}

	edgeInt := 1
	if vertex {
		edgeInt = 0
	}

	if tree.LID[u] < tree.LID[v] {
		a, b := tree.LID[u]+edgeInt, tree.LID[v]
		if a > b {
			a, b = b, a
		}
		f(a, b+1)
	} else if tree.LID[v]+edgeInt <= tree.LID[u] {
		a, b := tree.LID[u], tree.LID[v]+edgeInt
		if a > b {
			a, b = b, a
		}
		f(a, b+1)
	}
}

func (tree *Tree) GetPath(u, v int) []int {
	res := []int{}
	composition := tree.GetPathDecomposition(u, v, true)
	for _, e := range composition {
		a, b := e[0], e[1]
		if a <= b {
			for i := a; i <= b; i++ {
				res = append(res, tree.IdToNode[i])
			}
		} else {
			for i := a; i >= b; i-- {
				res = append(res, tree.IdToNode[i])
			}
		}
	}
	return res
}

// 以root为根时,结点v的子树大小.
func (tree *Tree) SubSize(v, root int) int {
	if root == -1 {
		return tree.RID[v] - tree.LID[v]
	}
	if v == root {
		return len(tree.Tree)
	}
	x := tree.Jump(v, root, 1)
	if tree.IsInSubtree(v, x) {
		return tree.RID[v] - tree.LID[v]
	}
	return len(tree.Tree) - tree.RID[x] + tree.LID[x]
}

// child 是否在 root 的子树中 (child和root不能相等)
func (tree *Tree) IsInSubtree(child, root int) bool {
	return tree.LID[root] <= tree.LID[child] && tree.LID[child] < tree.RID[root]
}

// 寻找以 start 为 top 的重链 ,heavyPath[-1] 即为重链底端节点.
func (tree *Tree) GetHeavyPath(start int) []int {
	heavyPath := []int{start}
	cur := start
	for tree.heavySon[cur] != -1 {
		cur = tree.heavySon[cur]
		heavyPath = append(heavyPath, cur)
	}
	return heavyPath
}

// 结点v的重儿子.如果没有重儿子,返回-1.
func (tree *Tree) GetHeavyChild(v int) int {
	k := tree.LID[v] + 1
	if k == len(tree.Tree) {
		return -1
	}
	w := tree.IdToNode[k]
	if tree.Parent[w] == v {
		return w
	}
	return -1
}

func (tree *Tree) ELID(u int) int {
	return 2*tree.LID[u] - tree.Depth[u]
}

func (tree *Tree) ERID(u int) int {
	return 2*tree.RID[u] - tree.Depth[u] - 1
}

func (tree *Tree) build(cur, pre, dep, dist int) int {
	subSize, heavySize, heavySon := 1, 0, -1
	for _, e := range tree.Tree[cur] {
		next, weight := e[0], e[1]
		if next != pre {
			nextSize := tree.build(next, cur, dep+1, dist+weight)
			subSize += nextSize
			if nextSize > heavySize {
				heavySize, heavySon = nextSize, next
			}
		}
	}
	tree.Depth[cur] = dep
	tree.DepthWeighted[cur] = dist
	tree.heavySon[cur] = heavySon
	tree.Parent[cur] = pre
	return subSize
}

func (tree *Tree) markTop(cur, top int) {
	tree.top[cur] = top
	tree.LID[cur] = tree.timer
	tree.IdToNode[tree.timer] = cur
	tree.timer++
	heavySon := tree.heavySon[cur]
	if heavySon != -1 {
		tree.markTop(heavySon, top)
		for _, e := range tree.Tree[cur] {
			next := e[0]
			if next != heavySon && next != tree.Parent[cur] {
				tree.markTop(next, next)
			}
		}
	}
	tree.RID[cur] = tree.timer
}

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

func max(a, b int) int {
	if a > b {
		return a
	}
	return b
}

func abs(a int) int {
	if a < 0 {
		return -a
	}
	return a
}

func unique(nums []int) []int {
	visited := make(map[int]struct{})
	newNums := []int{}
	for _, v := range nums {
		if _, ok := visited[v]; !ok {
			visited[v] = struct{}{}
			newNums = append(newNums, v)
		}
	}
	return newNums
}

func MinDistToOther(adjList [][][2]int, points []int) (dist []int, nearest []int) {
	n := len(adjList)
	dist = make([]int, n)
	source1, source2 := make([]int, n), make([]int, n)
	for i := 0; i < n; i++ {
		dist[i] = INF
		source1[i], source2[i] = -1, -1
	}

	pq := NewHeap(func(a, b H) bool { return a.dist < b.dist }, nil)
	for _, v := range points {
		pq.Push(H{dist: 0, node: v, source: v})
	}

	for pq.Len() > 0 {
		item := pq.Pop()
		curDist, cur, curSource := item.dist, item.node, item.source
		if curSource == source1[cur] || curSource == source2[cur] {
			continue
		}
		if source1[cur] == -1 {
			source1[cur] = curSource
		} else if source2[cur] == -1 {
			source2[cur] = curSource
		} else {
			continue
		}

		if curSource != cur { // 出发点不为自己时，更新距离
			dist[cur] = min(dist[cur], curDist)
		}
		for _, e := range adjList[cur] {
			next, weight := e[0], e[1]
			nextDist := curDist + weight
			pq.Push(H{nextDist, next, curSource})
		}
	}

	nearest = source2
	for i, v := range points {
		dist[i] = dist[v]
		nearest[i] = nearest[v]
	}
	dist = dist[:len(points)]
	nearest = nearest[:len(points)]
	return
}

type H = struct{ dist, node, source int }

func NewHeap(less func(a, b H) bool, nums []H) *Heap {
	nums = append(nums[:0:0], nums...)
	heap := &Heap{less: less, data: nums}
	heap.heapify()
	return heap
}

type Heap struct {
	data []H
	less func(a, b H) bool
}

func (h *Heap) Push(value H) {
	h.data = append(h.data, value)
	h.pushUp(h.Len() - 1)
}

func (h *Heap) Pop() (value H) {
	if h.Len() == 0 {
		panic("heap is empty")
	}
	value = h.data[0]
	h.data[0] = h.data[h.Len()-1]
	h.data = h.data[:h.Len()-1]
	h.pushDown(0)
	return
}

func (h *Heap) Top() (value H) {
	value = h.data[0]
	return
}

func (h *Heap) Len() int { return len(h.data) }

func (h *Heap) heapify() {
	n := h.Len()
	for i := (n >> 1) - 1; i > -1; i-- {
		h.pushDown(i)
	}
}

func (h *Heap) pushUp(root int) {
	for parent := (root - 1) >> 1; parent >= 0 && h.less(h.data[root], h.data[parent]); parent = (root - 1) >> 1 {
		h.data[root], h.data[parent] = h.data[parent], h.data[root]
		root = parent
	}
}

func (h *Heap) pushDown(root int) {
	n := h.Len()
	for left := (root<<1 + 1); left < n; left = (root<<1 + 1) {
		right := left + 1
		minIndex := root
		if h.less(h.data[left], h.data[minIndex]) {
			minIndex = left
		}
		if right < n && h.less(h.data[right], h.data[minIndex]) {
			minIndex = right
		}
		if minIndex == root {
			return
		}
		h.data[root], h.data[minIndex] = h.data[minIndex], h.data[root]
		root = minIndex
	}
}