Codeforces Round 185 (Div. 1)

Solutions for Codeforces Round 185 (Div. 1) (contest 311). 3/4 problems verified against sample I/O. Difficulty range: 1300-2500.

4 items

Codeforces Round 185 (Div. 1)

Type: Div. 1 | Problems: 4 | Verified: 3/4 | Rating range: 1300-2500 | Time: 7m 26s

Problem Name Rating Tags Solve Time Verified
A The Closest Pair 1300 constructive-algorithms, implementation 3m 3s ✓
B Cats Transport 2400 data-structures, dp 56s ✓
C Fetch the Treasure 2500 brute-force, data-structures, graphs 1m 7s ✓
E Biologist 2300 flows 2m 20s ✗
Practice › Codeforces Solutions › Codeforces Round 185 (Div. 1) ›

CF 311A - The Closest Pair

We are given a set of points in a 2D plane, and we want to measure how quickly a specific closest-pair algorithm behaves on a worst-case input.
codeforces competitive-programming constructive-algorithms implementation May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 185 (Div. 1) ›

CF 311B - Cats Transport

We have a farm with a straight road and several hills numbered from 1 to n. Each hill is separated from the previous one by a known distance. There are m cats, each of which finishes wandering on a particular hill at a certain time, and waits there for a feeder.
codeforces competitive-programming data-structures dp May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 185 (Div. 1) ›

CF 311C - Fetch the Treasure

We have a linear arrangement of h cells, numbered from 1 to h. Some of these cells contain treasures, each with a positive dollar value.
codeforces competitive-programming brute-force data-structures graphs shortest-paths May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 185 (Div. 1) ›

CF 311E - Biologist

We are tasked with optimizing the gain of a biologist, SmallR, who can change the sex of each of her n dogs at a cost. Each dog has an initial sex, either female (0) or male (1), and a cost to change sex.
codeforces competitive-programming flows May 29, 2026