Codeforces Round 567 (Div. 2)

Solutions for Codeforces Round 567 (Div. 2) (contest 1181). 6/6 problems verified against sample I/O. Difficulty range: 1000-3000.

6 items

Codeforces Round 567 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 6/6 | Rating range: 1000-3000 | Time: 21m 38s

Problem Name Rating Tags Solve Time Verified
A Chunga-Changa 1000 greedy, math 9m 51s ✓
B Split a Number 1500 greedy, implementation, strings 1m 17s ✓
C Flag 1900 brute-force, combinatorics, dp 2m 41s ✓
D Irrigation 2200 binary-search, data-structures, implementation 3m 36s ✓
E1 A Story of One Country (Easy) 2500 brute-force, divide-and-conquer, sortings 1m 34s ✓
E2 A Story of One Country (Hard) 3000 brute-force, greedy, sortings 2m 39s ✓
Practice › Codeforces Solutions › Codeforces Round 567 (Div. 2) ›

CF 1181A - Chunga-Changa

Two people hold some amounts of a currency and can optionally transfer integer amounts between each other before spending. Each unit of currency buys one item in chunks of size z, meaning each person independently converts their money into floor(money / z) items.
codeforces competitive-programming greedy math Jun 13, 2026
Practice › Codeforces Solutions › Codeforces Round 567 (Div. 2) ›

CF 1181E2 - A Story of One Country (Hard)

We are given a set of axis-aligned rectangles that represent “castles”. These rectangles do not overlap in area, although they may share boundaries or corners.
codeforces competitive-programming brute-force greedy sortings Jun 13, 2026
Practice › Codeforces Solutions › Codeforces Round 567 (Div. 2) ›

CF 1181D - Irrigation

We are given a sequence of past assignments where each of $m$ cities has hosted an event some number of times. After these first $n$ years, a deterministic rule takes over: in every future year, the city that has hosted the fewest events so far is chosen, and if multiple…
codeforces competitive-programming binary-search data-structures implementation sortings trees two-pointers Jun 13, 2026
Practice › Codeforces Solutions › Codeforces Round 567 (Div. 2) ›

CF 1181C - Flag

We are given a rectangular grid with n rows and m columns, where each cell already has one of three colors. The goal is to repaint some cells so that the final grid looks like a “flag” pattern composed of three horizontal stripes.
codeforces competitive-programming brute-force combinatorics dp implementation Jun 13, 2026
Practice › Codeforces Solutions › Codeforces Round 567 (Div. 2) ›

CF 1181E1 - A Story of One Country (Easy)

We are given n castles on a 2D plane, each represented by an axis-aligned rectangle with integer coordinates. Each castle originally belonged to a country whose territory was also a rectangle.
codeforces competitive-programming brute-force divide-and-conquer sortings Jun 12, 2026
Practice › Codeforces Solutions › Codeforces Round 567 (Div. 2) ›

CF 1181B - Split a Number

We are given a long positive integer as a string of digits, and we need to split it into two non-empty integers such that neither starts with a zero. The goal is to minimize the sum of these two integers after splitting.
codeforces competitive-programming greedy implementation strings Jun 12, 2026