Codeforces Round 1056 (Div. 2)

6 problems from Codeforces Round 1056 (Div. 2) (contest 2155), difficulty 800-2800. 1/6 solutions verified against sample I/O.

6 items

Codeforces Round 1056 (Div. 2)

Div. 2 | 6 problems | 1/6 verified | Difficulty 800-2800 | 11m 47s

#	Problem	Rating	Tags	Accepted	Time	✓
A	El fucho	800	implementation, math	25,152	1m 11s	✓
B	Abraham's Great Escape	1100	constructive-algorithms, graphs	16,983	1m 45s
C	The Ancient Wizards' Capes	1500	brute-force, greedy, implementation	10,245	1m 52s
D	Batteries	1800	brute-force, constructive-algorithms, graph-matchings	5,860	1m 35s
E	Mimo & Yuyu	2200	games, greedy, math	2,832	3m 28s
F	Juan's Colorful Tree	2800	data-structures, dfs-and-similar, dsu	637	1m 56s

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

CF 2155E - Mimo & Yuyu

We are asked to analyze a two-player game on an $n times m$ grid. Each cell can contain tokens, and on a turn, a player picks a token and moves it along a sequence of adjacent cells that always steps leftwards in columns, ultimately depositing new tokens along that path and…

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

CF 2155F - Juan's Colorful Tree

We are given a tree with n nodes, where each node contains a set of colors drawn from a palette of size k. Each node's set may be different, and the total number of color assignments across all nodes is s.

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

CF 2155D - Batteries

We are given a set of n batteries, some of which work and some of which don't. We do not know how many work, but we do know that at least two do. There is a flashlight that requires exactly two working batteries to turn on.

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

CF 2155C - The Ancient Wizards' Capes

Each wizard sits at a fixed position from 1 to n, and each one chooses a direction for his cape: either left or right. This choice determines from which positions he becomes visible.

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

CF 2155B - Abraham's Great Escape

We are asked to design a maze on an $n times n$ grid where each cell contains an arrow pointing in one of the four cardinal directions: up, down, left, or right. Abraham, starting from any cell, follows the arrow in that cell to the next cell and continues moving in this fashion.

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

CF 2155A - El fucho

We are asked to compute the total number of matches in a modified double-elimination football tournament. In this tournament, teams start in a winners' group. Each round, winners' group teams pair up and play matches.