Codeforces Round 695 (Div. 2)

Solutions for Codeforces Round 695 (Div. 2) (contest 1467). 4/5 problems verified against sample I/O. Difficulty range: 900-2500.

5 items

Codeforces Round 695 (Div. 2)

Type: Div. 2 | Problems: 5 | Verified: 4/5 | Rating range: 900-2500 | Time: 9m 17s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Wizard of Orz	900	constructive-algorithms, greedy, math	1m 32s	✓
B	Hills And Valleys	1700	brute-force, implementation	1m 43s	✓
C	Three Bags	1900	constructive-algorithms, greedy	1m 34s	✓
D	Sum of Paths	2200	combinatorics, dp, math	1m 30s	✓
E	Distinctive Roots in a Tree	2500	data-structures, dfs-and-similar, dp	2m 58s	✗

Practice › Codeforces Solutions › Codeforces Round 695 (Div. 2) ›

CF 1467E - Distinctive Roots in a Tree

We are given a tree whose vertices carry values. We may choose any vertex as the root. Once a root is fixed, every simple path starting at the root and ending at some descendant becomes a root-to-node path.

Practice › Codeforces Solutions › Codeforces Round 695 (Div. 2) ›

CF 1467D - Sum of Paths

We are asked to compute the total sum of values for all sequences of length k+1 that a robot can traverse along a line of n cells. Each move must go exactly one step left or right, staying inside the bounds. The value of a path is the sum of the ai values for the cells visited.

Practice › Codeforces Solutions › Codeforces Round 695 (Div. 2) ›

CF 1467B - Hills And Valleys

We are given a sequence of integers and need to identify "hills" and "valleys" in it. A hill occurs at position j if the number there is strictly greater than both neighbors, while a valley occurs if it is strictly smaller than both neighbors.

Practice › Codeforces Solutions › Codeforces Round 695 (Div. 2) ›

CF 1467C - Three Bags

We are given three separate bags, each containing a multiset of integers. We can perform a specific operation any number of times: pick one number from each of two non-empty bags, subtract the second number from the first, and remove the second from its bag while replacing the…

Practice › Codeforces Solutions › Codeforces Round 695 (Div. 2) ›

CF 1467A - Wizard of Orz

We are given a line of identical digital displays, each starting at digit 0, and all of them increase their digit by one every second in a cyclic manner from 9 back to 0. At some moment we choose exactly one display and freeze it permanently.