Codeforces Round 949 (Div. 2)

Solutions for Codeforces Round 949 (Div. 2) (contest 1981). 2/6 problems verified against sample I/O. Difficulty range: 800-3000.

6 items

Codeforces Round 949 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 2/6 | Rating range: 800-3000 | Time: 14m 22s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Turtle and Piggy Are Playing a Game	800	brute-force, greedy, math	2m 13s	✓
B	Turtle and an Infinite Sequence	1300	bitmasks, math	2m 12s	✓
C	Turtle and an Incomplete Sequence	1800	bitmasks, brute-force, constructive-algorithms	2m 41s	✗
D	Turtle and Multiplication	2400	constructive-algorithms, dfs-and-similar, graphs	2m 46s	✗
E	Turtle and Intersected Segments	2600	data-structures, dsu, graphs	2m 12s	✗
F	Turtle and Paths on a Tree	3000	data-structures, dp, trees	2m 18s	✗

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

CF 1981D - Turtle and Multiplication

We need to construct an array of length n such that every adjacent product is unique. More precisely, the values $$a1a2, a2a3, dots, a{n-1}an$$ must all be different.

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

CF 1981F - Turtle and Paths on a Tree

We are given a rooted tree where every node has a label. The structure is restricted so that each node has at most two children, but otherwise it is still a general rooted tree.

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

CF 1981E - Turtle and Intersected Segments

We are given a set of segments on the number line. Each segment also carries a value $ai$. Two segments are considered related if their intervals overlap at least at one point, including touching at endpoints.

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

CF 1981C - Turtle and an Incomplete Sequence

We are given a sequence of positive integers where some elements have gone missing and are represented by -1. The original sequence had a special property: for every consecutive pair of numbers, either the first number is the floor of half of the second, or the second is the…

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

CF 1981A - Turtle and Piggy Are Playing a Game

We are given a range of integers $[l, r]$. Turtle chooses a number $x$ from this range. After that, Piggy repeatedly divides $x$ by one of its divisors greater than or equal to $2$, earning one point for each division, until the number becomes $1$.

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

CF 1981B - Turtle and an Infinite Sequence

We start with an infinite array where position $i$ initially contains the value $i$. So the array begins as a simple identity mapping: index equals value. Every second, all positions update simultaneously.