Codeforces Round 124 (Div. 1)

5 problems from Codeforces Round 124 (Div. 1) (contest 196), difficulty 1100-2800. 2/5 solutions verified against sample I/O.

5 items

Codeforces Round 124 (Div. 1)

Div. 1 | 5 problems | 2/5 verified | Difficulty 1100-2800 | 8m 52s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Lexicographically Maximum Subsequence	1100	greedy, strings	5,844	1m 29s	✓
B	Infinite Maze	2000	dfs-and-similar, graphs	2,376	1m 39s	✓
C	Paint Tree	2200	constructive-algorithms, divide-and-conquer, geometry	1,040	1m 40s
D	The Next Good String	2800	data-structures, greedy, hashing	599	2m 4s
E	Opening Portals	2600	dsu, graphs, shortest-paths	1,204	2m

Practice › Codeforces Solutions › Codeforces Round 124 (Div. 1) ›

CF 196E - Opening Portals

We are given a connected network of cities, some of which contain portals. Each road between cities has a positive travel time, and Pavel starts in city 1.

Practice › Codeforces Solutions › Codeforces Round 124 (Div. 1) ›

CF 196D - The Next Good String

We are asked to find the next string lexicographically larger than a given string s such that no substring of length d or more is a palindrome. A palindrome is a sequence that reads the same forwards and backwards.

Practice › Codeforces Solutions › Codeforces Round 124 (Div. 1) ›

CF 196A - Lexicographically Maximum Subsequence

We are given a lowercase string and may choose any non-empty subsequence of its characters while preserving their original order. Among all possible subsequences, we need the one that is lexicographically largest.

Practice › Codeforces Solutions › Codeforces Round 124 (Div. 1) ›

CF 196B - Infinite Maze

We are given a finite maze of size n × m. Some cells are walls, some are open, and one cell contains the starting position S. The maze is not used only once.

Practice › Codeforces Solutions › Codeforces Round 124 (Div. 1) ›

CF 196C - Paint Tree

We are asked to embed a tree onto a set of points on a plane in such a way that tree edges correspond to straight line segments connecting the points.