Codeforces Round 203 (Div. 2)

5 problems from Codeforces Round 203 (Div. 2) (contest 350), difficulty 1200-2400. 3/5 solutions verified against sample I/O.

5 items

Codeforces Round 203 (Div. 2)

Div. 2 | 5 problems | 3/5 verified | Difficulty 1200-2400 | 11m 11s

# Problem Rating Tags Accepted Time ✓
A TL 1200 brute-force, greedy, implementation 17,529 1m 44s ✓
B Resort 1500 graphs 3,397 4m 28s
C Bombs 1600 greedy, implementation, sortings 6,825 1m 27s ✓
D Looking for Owls 2400 binary-search, data-structures, geometry 296 1m 55s
E Wrong Floyd 2200 brute-force, constructive-algorithms, dfs-and-similar 858 1m 37s ✓
Practice › Codeforces Solutions › Codeforces Round 203 (Div. 2) ›

CF 350C - Bombs

We are given a set of points on an infinite grid, each point containing a single bomb. A robot starts at the origin and must eventually destroy every bomb, but it cannot simply “teleport” to them.
codeforces competitive-programming greedy implementation sortings Jun 6, 2026
Practice › Codeforces Solutions › Codeforces Round 203 (Div. 2) ›

CF 350E - Wrong Floyd

We are given an undirected, simple, connected graph with $n$ vertices and $m$ edges. In addition, a subset of vertices $a1, a2, dots, ak$ is designated as “special”.
codeforces competitive-programming brute-force constructive-algorithms dfs-and-similar graphs Jun 6, 2026
Practice › Codeforces Solutions › Codeforces Round 203 (Div. 2) ›

CF 350D - Looking for Owls

We are asked to count "owls" in a geometric picture composed of segments and circles. An owl is defined as a combination of two circles and a segment where the circles are reflections of each other across the segment, have identical radii, do not overlap, and the segment…
codeforces competitive-programming binary-search data-structures geometry hashing sortings Jun 6, 2026
Practice › Codeforces Solutions › Codeforces Round 203 (Div. 2) ›

CF 350A - TL

We are asked to help Valera set a time limit for a programming problem. He has a set of correct solutions, each with a known runtime, and a set of wrong solutions, also with runtimes.
codeforces competitive-programming brute-force greedy implementation Jun 6, 2026
Practice › Codeforces Solutions › Codeforces Round 203 (Div. 2) ›

CF 350B - Resort

We are given a directed structure on n objects representing a ski resort. Each object is either a mountain or a hotel. Every object has at most one outgoing ski track leading to another object, and a hotel never has outgoing tracks at all.
codeforces competitive-programming graphs May 29, 2026