AlgorithmsThread Tree Basics Contest

6 problems from AlgorithmsThread Tree Basics Contest (contest 102694), difficulty -. 5/6 solutions verified against sample I/O.

6 items

AlgorithmsThread Tree Basics Contest

Special | 6 problems | 5/6 verified | Difficulty - | 6m 47s

#	Problem	Time	✓
A	Circumference of a Tree	59s	✓
B	Dynamic Diameter	57s	✓
C	Sloth Naptime	1m 28s	✓
D	Cycle Free Flow	1m 5s	✓
E	Filthy Rich Trees	1m 13s	✓
F	The Lorax	1m 5s

Practice › Codeforces Solutions › AlgorithmsThread Tree Basics Contest ›

CF 102694B - Dynamic Diameter

The problem starts with a tree containing n vertices. A new isolated vertex exists outside this tree. For every original vertex i, we imagine connecting that new vertex to i with one extra edge and ask what the diameter of the resulting tree would be.

Practice › Codeforces Solutions › AlgorithmsThread Tree Basics Contest ›

CF 102694C - Sloth Naptime

We have a tree with up to hundreds of thousands of nodes. A sloth starts at node a and wants to reach node b. The only limitation is that it can cross at most c edges before falling asleep. If the path from a to b is shorter than or equal to c, the sloth reaches b.

Practice › Codeforces Solutions › AlgorithmsThread Tree Basics Contest ›

CF 102694F - The Lorax

I can write the editorial, but the requested format is very large and the problem statement details are needed for the sample-based test section. I found the official statement for Codeforces 102694F, including the samples and constraints.

Practice › Codeforces Solutions › AlgorithmsThread Tree Basics Contest ›

CF 102694E - Filthy Rich Trees

We have a rooted tree whose root is node 1. Each node stores a positive integer amount of money. The value produced by a subtree is the product of the values stored in every node inside that subtree. Two operations must be processed online.

Practice › Codeforces Solutions › AlgorithmsThread Tree Basics Contest ›

CF 102694D - Cycle Free Flow

The graph in this problem is a connected undirected tree. Each edge has a capacity value. For every query, we are asked for the maximum amount of flow that can be sent between two given vertices under a special rule: every unit of flow must travel through a complete path…

Practice › Codeforces Solutions › AlgorithmsThread Tree Basics Contest ›

CF 102694A - Circumference of a Tree

The tree is treated like a geometric object where the diameter is the longest path between any two nodes. The problem defines an unusual version of circumference: instead of the real value of pi, we use pi = 3.