Codeforces Round 756 (Div. 3)

Solutions for Codeforces Round 756 (Div. 3) (contest 1611). 5/8 problems verified against sample I/O. Difficulty range: 800-2500.

8 items

Codeforces Round 756 (Div. 3)

Type: Div. 3 | Problems: 8 | Verified: 5/8 | Rating range: 800-2500 | Time: 16m 31s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Make Even	800	constructive-algorithms, math	1m 19s	✓
B	Team Composition: Programmers and Mathematicians	800	binary-search, constructive-algorithms, math	1m 7s	✓
C	Polycarp Recovers the Permutation	1000	constructive-algorithms	1m 56s	✗
D	Weights Assignment For Tree Edges	1500	constructive-algorithms, trees	3m 32s	✗
E1	Escape The Maze (easy version)	1700	dfs-and-similar, greedy, shortest-paths	3m 33s	✓
E2	Escape The Maze (hard version)	1900	dfs-and-similar, dp, greedy	2m 23s	✓
F	ATM and Students	1800	binary-search, data-structures, two-pointers	1m 12s	✓
G	Robot and Candies	2500	data-structures, graph-matchings, greedy	1m 29s	✗

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

CF 1611G - Robot and Candies

We are given a rectangular grid of size $n times m$, where each cell either contains a candy ('1') or is empty ('0'). A robot can start on any cell in the top row and move diagonally down-left or down-right until it leaves the grid.

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

CF 1611F - ATM and Students

The problem involves simulating an ATM that starts with a fixed amount of money and must serve a queue of students. Each student either deposits a positive amount or withdraws a negative amount from the ATM.

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

CF 1611E1 - Escape The Maze (easy version)

The maze is an undirected tree rooted at room 1. Vlad starts at room 1 and wants to reach any leaf node that is not room 1. A leaf is any node with exactly one adjacent corridor. At the same time, several friends are already placed on distinct nodes.

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

CF 1611D - Weights Assignment For Tree Edges

We are given a tree where each vertex has a pointer to its parent, except for the root which points to itself. This parent array b encodes the tree unambiguously.

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

CF 1611E2 - Escape The Maze (hard version)

We are given a tree of rooms. Vlad starts from room 1 and tries to escape by reaching any leaf node that is not room 1. A leaf is a room with exactly one corridor. At the same time, several friends are placed on distinct nodes.

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

CF 1611C - Polycarp Recovers the Permutation

We are given a sequence a of length n that was generated by repeatedly removing the smallest element from either end of a hidden permutation p of the numbers from 1 to n. If the smallest element is at the left, it is prepended to a; if it is at the right, it is appended to a.

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

CF 1611A - Make Even

We are given a number written in decimal form with no zero digits. The only operation allowed is to take a prefix of the number and reverse the order of digits inside that prefix. The prefix length can be anything from 1 up to the full length of the number.

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

CF 1611B - Team Composition: Programmers and Mathematicians

We are given two groups of students: programmers and mathematicians. From these students, we want to form as many teams as possible, where every team contains exactly 4 students.