remove depth array from HLD #261
Merged
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
simonlindholm
merged commit b7582d9
into
kth-competitive-programming:main
1 check passed
Elijah-Huang
added a commit
to nanoblob-jpeg/catlicku
that referenced
this pull request
Aug 19, 2024
Co-authored-by: Luke Videckis <[email protected]> Co-authored-by: Luke Videckis <[email protected]>
Elijah-Huang
added a commit
to nanoblob-jpeg/catlicku
that referenced
this pull request
Aug 19, 2024
Elijah-Huang
added a commit
to nanoblob-jpeg/catlicku
that referenced
this pull request
Aug 19, 2024
Remove depth array from HLD (kth-competitive-programming#261)
Evirir
added a commit
to matthewshang/uw-kactl
that referenced
this pull request
Sep 1, 2024
Remove depth array from HLD (kth-competitive-programming#261)
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
now, HLD is less code && uses less memory
this change uses the observation that if
uandvare on the same vertical path, then comparing depths is the same as comparing preorder valuesI did run this test locally, and it passed https://github.com/kth-competitive-programming/kactl/blob/main/stress-tests/graph/HLD.cpp