41 lines
No EOL
1.3 KiB
Text
41 lines
No EOL
1.3 KiB
Text
---
|
|
id: tree-euler
|
|
title: "Euler Tour on Tree"
|
|
author: ?
|
|
prerequisites:
|
|
- Silver - Depth First Search
|
|
- Gold - Static Range Queries
|
|
- Gold - Point Update Range Sum
|
|
description: Subtree updates and queries and another way to compute lowest common ancestors.
|
|
---
|
|
|
|
import { Problem } from "../models";
|
|
|
|
export const metadata = {
|
|
problems: {
|
|
sample: [
|
|
new Problem("CSES", "Subtree Queries", "1137", "Easy", false, ["Euler-Tree"], ""),
|
|
new Problem("CSES", "Company Queries II", "1688", "Easy", false, ["LCA"], ""),
|
|
],
|
|
problems: [
|
|
new Problem("CSES", "Path Queries", "1138", "Easy", false, ["Euler-Tree","PURS"], ""),
|
|
new Problem("Gold", "Cow Land", "921", "Normal", false, ["Euler-Tree","PURS"], ""),
|
|
new Problem("Gold", "Milk Visits", "970", "Normal", false, ["Euler-Tree"], ""),
|
|
new Problem("Plat", "Promotion Counting", "696", "Normal", false, ["Euler-Tree","PURS"], ""),
|
|
new Problem("Plat", "Snow-Cow", "973", "Hard", false, ["Euler-Tree","PURS"], ""),
|
|
]
|
|
}
|
|
};
|
|
|
|
## Sample Problems
|
|
|
|
<problems-list problems={metadata.problems.sample} />
|
|
|
|
## Tutorial
|
|
|
|
- CPH 18.2
|
|
- [cp-algorithms - LCA with Sparse Table](https://cp-algorithms.com/graph/lca.html)
|
|
|
|
## Problems
|
|
|
|
<problems-list problems={metadata.problems.problems} /> |