Codeforces Round 532 (Div. 2)

6 problems from Codeforces Round 532 (Div. 2) (contest 1100), difficulty 1000-2500. 4/6 solutions verified against sample I/O.

6 items

Codeforces Round 532 (Div. 2)

Div. 2 | 6 problems | 4/6 verified | Difficulty 1000-2500 | 31m 23s

# Problem Rating Tags Accepted Time ✓
A Roman and Browser 1000 implementation 10,674 4m 20s ✓
B Build a Contest 1300 data-structures, implementation 11,774 5m 27s ✓
C NN and the Optical Illusion 1200 binary-search, geometry, math 10,930 1m 27s ✓
D Dasha and Chess 2500 constructive-algorithms, games, interactive 916 9m 7s
E Andrew and Taxi 2200 binary-search, dfs-and-similar, graphs 2,623 7m 2s
F Ivan and Burgers 2500 data-structures, divide-and-conquer, greedy 3,686 4m ✓
Practice › Codeforces Solutions › Codeforces Round 532 (Div. 2) ›

CF 1100E - Andrew and Taxi

We are given a directed graph representing a city map, where each road has a direction and a cost associated with reversing it.
codeforces competitive-programming binary-search dfs-and-similar graphs Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 532 (Div. 2) ›

CF 1100B - Build a Contest

We are given a stream of problems, each tagged with a difficulty from 1 to n. Arkady keeps a pool of created problems, and at any moment he is allowed to form a contest if he can pick exactly one unused problem of every difficulty from 1 to n.
codeforces competitive-programming data-structures implementation Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 532 (Div. 2) ›

CF 1100D - Dasha and Chess

We are simulating an interaction on a 999 by 999 grid with a single white king and many black rooks. The king moves first and can step to any of the eight neighboring cells.
codeforces competitive-programming constructive-algorithms games interactive Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 532 (Div. 2) ›

CF 1100A - Roman and Browser

We are given a row of browser tabs indexed from 1 to n. Each tab is either useful for an exam or represents a social media site. This is encoded as an array of length n where each value is either 1 or -1. Roman chooses a step size k. After that, he selects a starting tab b.
codeforces competitive-programming implementation Jun 13, 2026
Practice › Codeforces Solutions › Codeforces Round 532 (Div. 2) ›

CF 1100F - Ivan and Burgers

We are given an array of values on a line, where each position represents a burger shop and the value at that position is the cost of the most expensive burger available there.
codeforces competitive-programming data-structures divide-and-conquer greedy math Jun 13, 2026
Practice › Codeforces Solutions › Codeforces Round 532 (Div. 2) ›

CF 1100C - NN and the Optical Illusion

We are building a very specific circle configuration. There is one central circle of radius $r$. Around it, $n$ identical circles are placed so that they form a ring.
codeforces competitive-programming binary-search geometry math Jun 12, 2026