Main public logs
Jump to navigation
Jump to search
Combined display of all available logs of programming_contest. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).
- 19:34, 9 March 2024 Kmk21 talk contribs created page GCDs (Created page with "realization: only a small total count of GCDs. moreso, any range that spans coprime numbers will be 1. or more generally, all numbers in that range must be divisible by the GCD, and no higher number. So go through each number, track the earliest seen number which is divisible by each possible GCD (max 100). O(100*100k) Category:ICPC Problems Category:Nac2014 Category:Algorithm Medium Category:Math Category:GCD Category:Dynamic Programming")
- 18:24, 9 March 2024 Kmk21 talk contribs created page Diplomacy (Created page with "collapse all groups of same color nodes. they always change together. then try every group and alternate expanding it purple/orange. this is just distance. find the one with the least distance to the furthest node Category:ICPC Problems Category:Nac2014 Category:Algorithm Medium Category:Graph Category:Brute Force")
- 17:03, 9 March 2024 Kmk21 talk contribs created page Banjo (Created page with "need to search over both entry and exit point. also may be helpful to fix the number of times we "cross" the circle. Category:ICPC Problems Category:Nac2014 Category:Algorithm Medium Category:Implementation Hard Category:Geometry Category:Binary Search")
- 17:01, 9 March 2024 Kmk21 talk contribs created page Category:Nac2014 (Created page with "category:nac category:2014 category:contests")
- 21:15, 2 March 2024 Kmk21 talk contribs created page Category:Graph Transformation (Created page with "Category:Techniques")
- 21:14, 2 March 2024 Kmk21 talk contribs created page Uniform Subtrees (Created page with "the input is a tree, and the output graph is also a tree (with the longest chain and most nodes on the left hand children). Consider this input: (((()()))(()()())) (encourage drawing it out) The "output" Is 0 10 110 1110 1120 120 130 20 210 This maps to a tree of the following form: (((()())()())(())) (again encourage drawing it out) whose preorder traversal defines the output. (number each edge from each node from left to right to see this) If we have two subtrees...")
- 16:26, 1 March 2024 Kmk21 talk contribs created page Winter Roads (Created page with "MST is only 1k nodes, so most operations are cheap. S is just a bfs in O(n), R is similar...bfs from the two endpoints of the repaired road (if not on the tree) and swap out if the repaired edge is higher than the min on that path in O(n). B is harder, but max 2k B operations, so can rebuild the MST each time. Don't rebuild the heap in kruskal, so you don't eat the extra log...just update the heap for each B and R. Only rebuild if B operation is for an edge on the curre...")