Codeforces Round 550 (Div. 3)

Solutions for Codeforces Round 550 (Div. 3) (contest 1144). 3/7 problems verified against sample I/O. Difficulty range: 800-2400.

7 items

Codeforces Round 550 (Div. 3)

Type: Div. 3 | Problems: 7 | Verified: 3/7 | Rating range: 800-2400 | Time: 12m 3s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Diverse Strings	800	implementation, strings	1m 18s	✓
B	Parity Alternated Deletions	900	greedy, implementation, sortings	1m 18s	✓
C	Two Shuffled Sequences	1000	constructive-algorithms, sortings	1m 48s	✗
D	Equalize Them All	1400	constructive-algorithms, greedy	3m 16s	✗
E	Median String	1900	bitmasks, math, number-theory	1m 18s	✓
F	Graph Without Long Directed Paths	1700	dfs-and-similar, graphs	1m 35s	✗
G	Two Merged Sequences	2400	dp, greedy	1m 30s	✗

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

CF 1144D - Equalize Them All

We are given a sequence of integers arranged in a line. In one move, we pick two neighboring positions and use the difference between their values to either increase or decrease one of them by exactly that difference.

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

CF 1144G - Two Merged Sequences

We are given a single sequence, and we are told that it was originally formed by taking two hidden sequences and interleaving them.

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

CF 1144F - Graph Without Long Directed Paths

We are given a connected undirected graph with n vertices and m edges. Our task is to assign a direction to every edge so that the resulting directed graph does not contain any path of length two or more.

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

CF 1144E - Median String

We are asked to find the median string between two given strings of the same length, s and t, using lexicographical ordering. Both strings consist only of lowercase Latin letters, and s is guaranteed to be strictly smaller than t.

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

CF 1144C - Two Shuffled Sequences

We are given a multiset of integers that was created by taking two sequences, one strictly increasing and one strictly decreasing, merging all their elements together, and then shuffling the result. The original order inside the merged array is lost.

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

CF 1144A - Diverse Strings

We are given several short strings, and for each one we need to decide whether it forms a single continuous block of the alphabet without any gaps or repetition. Think of the lowercase alphabet as a line from ‘a’ to ‘z’.

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

CF 1144B - Parity Alternated Deletions

We are given a sequence of integers, and we are allowed to remove elements one by one under a parity constraint that depends on the previous deletion. The first removed element can be anything.