Algorithms

Small Towns on a Tree Path

Difficulty

Asked at Graviton Research Capital

Theory: Algorithms Under a Complexity Bound

Read the problem, hints and solution here. The editor needs a bigger screen: open this page on a laptop to write and run your code.

Available in Python and C++. You are solving it in Python. Switch to C++

(x) xxxxx, xxxxxxxx x xx (x), xxx xxxxxx xx (x - x) xxxxx xxxx x xxxx, xx xxxxx xx xxxxxxx xxx xxxxx xxxxxxx xxx xxx xxxxx. xxxx (x) xxx x xxxxxxxxxx (x_x). xxxx xxxxx xxxxx xxx xxxxx (x) xxx (x) xxx x xxx (x): xxx xxxx xxxxx xx xxx xxxxx xxxx (x) xx (x), xxxx xxxx xxxxxxxx, xxxx x xxxxxxxxxx xx xx xxxx (x)? xxx xxx xxxxx xxx xx xxx xxxx, xx xxxxx xxxx xxx xxxxx xx xxxx xxx xxxx. xxxxxxxxx xxxxx_xx_xxxxx(xxxxxxxxxx, xxxxx, xxxxxxx) xxxxxxxxx xxx xxxxx xxx xxxxx, xx xxxxx xxxxx. xxxxxxxxxx[x] xx xxx xxxxxxxxxx xx xxxx (x + x), xxxxx xxxxx xxx (x - x) xxxxx xx [x, x], xxx xxxxxxx xxxxx xxx xxxxxxx xx [x, x, x] . xxxxxxxx xxxxxxxxxx = [x, x, x, x, x] xxxxx = [[x, x], [x, x], [x, x], [x, x]] xxxxxxx = [[x, x, x], [x, x, x], [x, x, x], [x, x, x], [x, x, x]] xxxxx_xx_xxxxx(xxxxxxxxxx, xxxxx, xxxxxxx) # [x, x, x, x, x] xxx xxxxx xxx [x, x, x] xx x, x, x, xxxx xxxxxxxxxxx x, x xxx x, xxx xx xxxx x, xx xxx xxxxxx xx x. xxx xxxxx xxx [x, x, x] xx x, x, xxx xxxx xxxx x (xxxxxxxxxx x) xx xxxxxx xxx xxx. xxxxxxxxxxx (x xx x, x xx x xxxxx xx^x), xxx xxx xxxxx xxxx x xxxx. (x xx x_x, x xx xx^x). xxxxxxx xxxxx xxxxx xx (x(x)) xxx xxxxx, (x(xx)) xx xxx, xxx xxx xxxxxxx xxxxxx xxxx xx x xxxx xxxxx xx x xxxxxx xxxx xxxx. xxxx xxxx xxx xxxxxx xx xxxx. xxx xxxx xx xxxx xxxx xxxxxx xx xxxxx x xxxxxxxxx xxxxxx xx xxxxxx, xxx xx xxx x xxxxxxxxx xxx xx x++ xx xxxx xx xxxxxxxxxxx xxx xxxxx. xx x++ xxx::xxxxxx<xxx> xxxxx_xx_xxxxx( xxxxx xxx::xxxxxx<xxxx xxxx>& xxxxxxxxxx, xxxxx xxx::xxxxxx<xxx::xxxx<xxx, xxx>>& xxxxx, xxxxx xxx::xxxxxx<xxx::xxxxx<xxx, xxx, xxxx xxxx>>& xxxxxxx);

This problem is only available to subscribers.

Language:

Python 3.12 C++23

count_on_paths

def count_on_paths(population: list[int], roads: list[list[int]], queries: list[list[int]]) -> list[int]:
    """..."""
    # ...
    pass

Unlock to runUpgrade

Unlock the problem to run it against the tests.