Codeforces Round 883 (Div. 3)

Solutions for Codeforces Round 883 (Div. 3) (contest 1846). 4/8 problems verified against sample I/O. Difficulty range: 800-1900.

8 items

Codeforces Round 883 (Div. 3)

Type: Div. 3 | Problems: 8 | Verified: 4/8 | Rating range: 800-1900 | Time: 14m 22s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Rudolph and Cut the Rope	800	implementation, math	1m 57s	✗
B	Rudolph and Tic-Tac-Toe	800	brute-force, implementation, strings	5m 8s	✗
C	Rudolf and the Another Competition	1200	constructive-algorithms, data-structures, dp	1m 2s	✓
D	Rudolph and Christmas Tree	1200	constructive-algorithms, geometry, math	1m 20s	✗
E1	Rudolf and Snowflakes (simple version)	1300	brute-force, implementation, math	1m 6s	✓
E2	Rudolf and Snowflakes (hard version)	1800	binary-search, brute-force, implementation	1m 20s	✓
F	Rudolph and Mimic	1800	constructive-algorithms, implementation, interactive	1m 14s	✗
G	Rudolf and CodeVid-23	1900	bitmasks, dp, graphs	1m 15s	✓

Practice › Codeforces Solutions › Codeforces Round 883 (Div. 3) ›

CF 1846B - Rudolph and Tic-Tac-Toe

We are given a final state of a very small board, always 3 by 3, for a simplified tic-tac-toe variant with three different symbols. One player places X, another places O, and the third places plus signs. Some cells may still be empty.

Practice › Codeforces Solutions › Codeforces Round 883 (Div. 3) ›

CF 1846G - Rudolf and CodeVid-23

We are given a set of symptoms that Rudolf currently has, along with a list of medicines. Each medicine takes a certain number of days to take, removes some symptoms, and may induce new symptoms as side effects.

Practice › Codeforces Solutions › Codeforces Round 883 (Div. 3) ›

CF 1846F - Rudolph and Mimic

We are given a collection of positions, each holding an object with a visible type label. Hidden among them is a single special entity, the mimic.

Practice › Codeforces Solutions › Codeforces Round 883 (Div. 3) ›

CF 1846E2 - Rudolf and Snowflakes (hard version)

We are given a construction process that builds a special kind of tree-like graph. It starts from a single root vertex. From there, every time a vertex becomes a leaf, it “expands” by attaching exactly k new vertices to it, where k 1.

Practice › Codeforces Solutions › Codeforces Round 883 (Div. 3) ›

CF 1846E1 - Rudolf and Snowflakes (simple version)

We are asked to determine whether it is possible to construct a "snowflake" graph with exactly $n$ vertices, following a recursive branching rule. The graph starts with a single vertex. From this vertex, we attach $k 1$ new vertices.

Practice › Codeforces Solutions › Codeforces Round 883 (Div. 3) ›

CF 1846D - Rudolph and Christmas Tree

We are given a stylized drawing made of several identical triangular “branches” placed along a vertical line. Each branch is an isosceles triangle with a fixed base length d and height h.

Practice › Codeforces Solutions › Codeforces Round 883 (Div. 3) ›

CF 1846A - Rudolph and Cut the Rope

We are given a set of nails on a wall, each at a different height, and each nail has a rope of a certain length tied to it. The other ends of all the ropes are connected to a candy, forming a single point that is suspended somewhere in the air.

Practice › Codeforces Solutions › Codeforces Round 883 (Div. 3) ›

CF 1846C - Rudolf and the Another Competition

Each participant in the contest is given the same list of problems, but each person needs a different amount of time to solve each problem. The competition lasts for a fixed number of minutes, and every participant chooses an order in which to solve problems.