Educational Codeforces Round 105 (Rated for Div. 2)

Solutions for Educational Codeforces Round 105 (Rated for Div. 2) (contest 1494). 3/6 problems verified against sample I/O. Difficulty range: 900-2900.

6 items

Educational Codeforces Round 105 (Rated for Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 3/6 | Rating range: 900-2900 | Time: 16m 41s

Problem	Name	Rating	Tags	Solve Time	Verified
A	ABC String	900	bitmasks, brute-force, implementation	1m 39s	✓
B	Berland Crossword	1400	bitmasks, brute-force, greedy	2m 54s	✗
C	1D Sokoban	1900	binary-search, dp, greedy	3m 5s	✓
D	Dogeforces	2300	constructive-algorithms, data-structures, dfs-and-similar	2m 42s	✗
E	A-Z Graph	2400	constructive-algorithms, data-structures, graphs	2m 56s	✗
F	Delete The Edges	2900	brute-force, constructive-algorithms, dfs-and-similar	3m 25s	✓

Practice › Codeforces Solutions › Educational Codeforces Round 105 (Rated for Div. 2) ›

CF 1494F - Delete The Edges

We are given a connected undirected graph with n vertices and m edges. The task is to remove all edges by walking along them. Initially, walking along an edge destroys it. At most once, we can activate a mode shift.

Practice › Codeforces Solutions › Educational Codeforces Round 105 (Rated for Div. 2) ›

CF 1494E - A-Z Graph

I can't reliably diagnose this one from the sample alone because the sample input/output pair does not identify the problem.

Practice › Codeforces Solutions › Educational Codeforces Round 105 (Rated for Div. 2) ›

CF 1494D - Dogeforces

We are asked to reconstruct a company hierarchy from partial salary information. Specifically, we know the salaries of all the lowest-level employees and, for every pair of them, the salary of their lowest common supervisor.

Practice › Codeforces Solutions › Educational Codeforces Round 105 (Rated for Div. 2) ›

CF 1494C - 1D Sokoban

We are asked to maximize the number of boxes placed on special positions along a one-dimensional infinite number line. You start at position 0 and can move left or right, pushing boxes in the direction you move.

Practice › Codeforces Solutions › Educational Codeforces Round 105 (Rated for Div. 2) ›

CF 1494B - Berland Crossword

I can't reliably diagnose this one from the sample alone because the sample input/output pair does not identify the problem.

Practice › Codeforces Solutions › Educational Codeforces Round 105 (Rated for Div. 2) ›

CF 1494A - ABC String

We are given a string over three symbols: A, B, and C. We must assign to each position a bracket, either “(” or “)”, producing a bracket sequence of the same length.