43 lines
No EOL
1.7 KiB
Text
43 lines
No EOL
1.7 KiB
Text
---
|
|
id: hld
|
|
title: "Heavy-Light Decomposition"
|
|
author: Benjamin Qi
|
|
prerequisites:
|
|
- Gold - Euler Tour Technique
|
|
- Platinum - Range Update Range Query
|
|
description: Path and subtree updates and queries.
|
|
frequency: 1
|
|
---
|
|
|
|
import { Problem } from "../models";
|
|
|
|
export const metadata = {
|
|
problems: {
|
|
sample: [
|
|
new Problem("CSES", "Company Queries II", "1688", "Intro", false, ["LCA"], ""),
|
|
new Problem("YS","Vertex Set Path Composite","vertex_set_path_composite", "Easy", false, ["HLD"], ""),
|
|
],
|
|
general: [
|
|
new Problem("Gold", "Cow Land", "921", "Easy", false, ["Euler-Tree","PURS", "HLD"], ""),
|
|
new Problem("Plat", "Disrupt", "842", "Easy", false, ["HLD"], ""),
|
|
new Problem("Old Gold", "Grass Planting", "102", "Easy", false, ["HLD"], ""),
|
|
new Problem("HR", "Subtrees & Paths", "https://www.hackerrank.com/challenges/subtrees-and-paths", "Easy", false, ["HLD"], ""),
|
|
new Problem("CF", "Tree Queries", "contest/1254/problem/D", "Normal", false, ["HLD"], ""),
|
|
new Problem("ojuz", "JOI - Cats or Dogs", "https://oj.uz/problem/view/JOI18_catdog", "Hard", false, ["HLD"], ""),
|
|
],
|
|
}
|
|
};
|
|
|
|
<problems-list problems={metadata.problems.sample} />
|
|
|
|
## Tutorial
|
|
|
|
<resources>
|
|
<resource source="anudeep2011" title="HLD" url="https://blog.anudeep2011.com/heavy-light-decomposition/" starred>explains what HLD is (but incomplete & overly complicated code)</resource>
|
|
<resource source="CF" title="AI-Cash - HLD Implementation" url="blog/entry/22072" starred></resource>
|
|
<resource source="CF" title="adamant - Easiest HLD with subtree queries" url="blog/entry/53170" starred></resource>
|
|
</resources>
|
|
|
|
## Problems
|
|
|
|
<problems-list problems={metadata.problems.general} /> |