Educational Codeforces Round 163 (Rated for Div. 2)

Solutions for Educational Codeforces Round 163 (Rated for Div. 2) (contest 1948). 2/6 problems verified against sample I/O. Difficulty range: 800-3100.

6 items

Educational Codeforces Round 163 (Rated for Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 2/6 | Rating range: 800-3100 | Time: 11m 57s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Special Characters	800	brute-force, constructive-algorithms	1m 17s	✗
C	Arrow Path	1300	brute-force, constructive-algorithms, dfs-and-similar	56s	✓
D	Tandem Repeats?	1700	brute-force, strings, two-pointers	2m 48s	✗
E	Clique Partition	2100	brute-force, constructive-algorithms, graphs	2m 41s	✗
F	Rare Coins	2500	combinatorics, math, probabilities	2m 56s	✗
G	MST with Matching	3100	bitmasks, brute-force, dsu	1m 19s	✓

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

CF 1948A - Special Characters

We are asked to construct a string over uppercase Latin letters such that a specific counting rule is satisfied. A position in the string is called special if the character at that position matches exactly one of its immediate neighbors.

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

CF 1948C - Arrow Path

We have a 2-row grid with $n$ columns, and each cell contains an arrow pointing either left or right. The robot starts at the top-left corner, and each second it first moves to an adjacent cell (up, down, left, right) and then follows the arrow in the new cell.

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

CF 1948D - Tandem Repeats?

We are given a string consisting of lowercase letters and wildcard characters. Each wildcard can later be replaced by any lowercase letter we choose.

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

CF 1948E - Clique Partition

We are given a problem where we need to assign integers to vertices of an initially empty graph and then construct edges based on a Manhattan-like distance metric. Specifically, for vertices labeled $1$ through $n$, each vertex receives a distinct integer from $1$ to $n$.

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

CF 1948F - Rare Coins

Each bag contains a fixed number of gold coins and a number of silver coins. Gold coins always contribute one unit of value. Silver coins are uncertain, each silver coin independently contributes either 0 or 1 with equal probability.

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

CF 1948G - MST with Matching

We are given a connected undirected weighted graph with at most 20 vertices. We must choose a spanning tree. The cost of that tree has two parts. The first part is standard, the sum of the chosen edge weights. The second part depends on the structure of the tree.