Codeforces Round 990 (Div. 2)

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

6 items

Codeforces Round 990 (Div. 2)

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

Problem Name Rating Tags Solve Time Verified
A Alyona and a Square Jigsaw Puzzle 800 implementation, math 2m 12s ✓
B Replace Character 900 brute-force, combinatorics, greedy 1m 46s ✗
C Swap Columns and Find a Path 1200 data-structures, greedy, sortings 1m 24s ✓
D Move Back at a Cost 1600 binary-search, data-structures, greedy 1m 17s ✗
E Adventurers 2100 binary-search, data-structures, flows 2m 11s ✗
F For the Emperor! 3100 flows, graphs 2m 3s ✗
Practice › Codeforces Solutions › Codeforces Round 990 (Div. 2) ›

CF 2047F - For the Emperor!

We have a directed graph of cities. City i initially contains ai messengers. A messenger can move along directed roads. If a messenger already knows the plan, he can carry it while travelling.
codeforces competitive-programming flows graphs Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 990 (Div. 2) ›

CF 2047E - Adventurers

We are given a set of cities represented by their coordinates on a 2D plane. Four merchants want to split the cities among themselves using a single dividing point $(x0, y0)$.
codeforces competitive-programming binary-search data-structures flows greedy implementation Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 990 (Div. 2) ›

CF 2047A - Alyona and a Square Jigsaw Puzzle

Alyona builds a square puzzle layer by layer around a central piece. The first layer consists of only the center piece, so it contains 1 tile. Every later layer forms a complete square ring around the previous puzzle. Each day she adds some number of pieces, given by the array a.
codeforces competitive-programming implementation math Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 990 (Div. 2) ›

CF 2047D - Move Back at a Cost

We are given an array of integers and allowed to perform a single type of operation any number of times. The operation lets us select an element, increase it by one, and then move it to the end of the array.
codeforces competitive-programming binary-search data-structures greedy sortings Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 990 (Div. 2) ›

CF 2047B - Replace Character

We are given a string of lowercase English letters, and we can perform exactly one operation: choose two positions, possibly the same, and set the first character equal to the second.
codeforces competitive-programming brute-force combinatorics greedy strings Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 990 (Div. 2) ›

CF 2047C - Swap Columns and Find a Path

We are given a 2-row matrix with n columns, where each cell contains an integer. We are allowed to swap entire columns any number of times, meaning both elements in a column move together.
codeforces competitive-programming data-structures greedy sortings Jun 9, 2026