The link-cut tree data structure represents a rooted forest (a collection of rooted trees) and can perform the following operations in O(logn) amortized ...

В основе Link-Cut Tree лежат Splay деревья. Про них можно прочитать здесь. Про саму структуру Link-Cut Tree лучше всего читать тут и тут. Вообще, на самом деле ...

When you using "Cut(1, 2)"，you will reroot node 1.That means node 2 becomes node 3's parent.And then you cut the edge between node 2 and his parent,so 2 becomes ...

When deleting a simple path, you just need to let u's and v's weights be XORed by the weight of the simple path again, also the total XOR sum of S will be XORed ...

Programmer Rostislav got seriously interested in the Link/Cut Tree data structure, which is based on Splay trees. Specifically, he is now studying the expose ...

The link-cut trees solves problems in paths, you want know about the amount vertices in a subtree, for this you can use Euler Tour Tree that solves problems in ...

The link-cut tree is a data structure that can maintain dynamic forest (that is, we can add/remove edges as long as the graph remains a forest) and handle ...

A link cut tree is a data structure that uses splay trees to represent a forest of rooted trees and can perform the following operations. Link Cut Tree · With Link Cut Tree · With Euler Tour Tree

I am learning link cut tree. Can anyone please provide me some questions to solve related to link cut tree in increasing order of difficulty?

Output Print all powers of number k, that lie within range from l to r in the increasing order. If there are no such numbers, print "-1" (without the quotes).