Codeforces Round 558 (Div. 2)

8 problems from Codeforces Round 558 (Div. 2) (contest 1163), difficulty 900-3000. 7/8 solutions verified against sample I/O.

8 items

Codeforces Round 558 (Div. 2)

Div. 2 | 8 problems | 7/8 verified | Difficulty 900-3000 | 22m 56s

# Problem Rating Tags Accepted Time ✓
A Eating Soup 900 greedy, math 13,858 4m 42s ✓
B1 Cat Party (Easy Edition) 1500 data-structures, implementation 7,330 1m 10s ✓
B2 Cat Party (Hard Edition) 1600 data-structures, implementation 7,646 1m 35s ✓
C1 Power Transmission (Easy Edition) 1900 brute-force, geometry 3,578 3m 23s ✓
C2 Power Transmission (Hard Edition) 1900 data-structures, geometry, implementation 3,951 1m 29s ✓
D Mysterious Code 2100 dp, strings 1,541 1m 6s ✓
E Magical Permutation 2400 bitmasks, brute-force, constructive-algorithms 1,011 4m 34s ✓
F Indecisive Taxi Fee 3000 data-structures, graphs, shortest-paths 1,293 4m 57s
Practice › Codeforces Solutions › Codeforces Round 558 (Div. 2) ›

CF 1163E - Magical Permutation

We are given a set of integers that represent allowed XOR “moves”. We are asked to build a permutation of all integers from 0 up to some power of two minus one, such that every adjacent pair in the permutation differs by a value that belongs to the given set.
codeforces competitive-programming bitmasks brute-force constructive-algorithms data-structures graphs math Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 558 (Div. 2) ›

CF 1163F - Indecisive Taxi Fee

We are given a weighted undirected graph with up to 200,000 vertices and edges. Each edge has a fixed weight, and we care about the shortest path from node 1 to node n using the sum of edge weights. The twist is that we are not solving just one shortest path problem.
codeforces competitive-programming data-structures graphs shortest-paths Jun 13, 2026
Practice › Codeforces Solutions › Codeforces Round 558 (Div. 2) ›

CF 1163A - Eating Soup

We start with a circle of $n$ cats sitting in order, forming a single continuous ring of occupied positions. Then $m$ of these cats leave. After each departure, the circle is no longer fully connected, because empty positions break adjacency.
codeforces competitive-programming greedy math Jun 13, 2026
Practice › Codeforces Solutions › Codeforces Round 558 (Div. 2) ›

CF 1163C1 - Power Transmission (Easy Edition)

We are given a set of points on a 2D plane. Each point represents a power pole, and every pair of poles defines a straight infinite line, which we interpret as a “wire”.
codeforces competitive-programming brute-force geometry Jun 13, 2026
Practice › Codeforces Solutions › Codeforces Round 558 (Div. 2) ›

CF 1163D - Mysterious Code

We are given a string c which represents a partially unreadable code. Some positions in c are readable lowercase letters, and others are asterisks representing unknown characters.
codeforces competitive-programming dp strings Jun 12, 2026
Practice › Codeforces Solutions › Codeforces Round 558 (Div. 2) ›

CF 1163C2 - Power Transmission (Hard Edition)

We are given a set of points on a plane, each representing a power pole. Every pair of poles defines a straight infinite line, and that line is considered a “wire”.
codeforces competitive-programming data-structures geometry implementation math Jun 12, 2026
Practice › Codeforces Solutions › Codeforces Round 558 (Div. 2) ›

CF 1163B2 - Cat Party (Hard Edition)

We are given a sequence of colors arriving over time, one per day. Each day contributes one occurrence of a color.
codeforces competitive-programming data-structures implementation Jun 12, 2026
Practice › Codeforces Solutions › Codeforces Round 558 (Div. 2) ›

CF 1163B1 - Cat Party (Easy Edition)

Shiro receives a cat every day, each cat wearing a ribbon of a certain color. The colors are integers from 1 to 10.
codeforces competitive-programming data-structures implementation Jun 12, 2026