Croc Champ 2013 - Finals (online version, Div. 1)

Solutions for Croc Champ 2013 - Finals (online version, Div. 1) (contest 309). 4/4 problems verified against sample I/O. Difficulty range: 1900-2900.

4 items

Croc Champ 2013 - Finals (online version, Div. 1)

Type: Div. 1 | Problems: 4 | Verified: 4/4 | Rating range: 1900-2900 | Time: 12m 12s

Problem Name Rating Tags Solve Time Verified
A Morning run 2000 binary-search, math, two-pointers 4m 7s ✓
C Memory for Arrays 1900 binary-search, bitmasks, greedy 3m 39s ✓
D Tennis Rackets 2700 brute-force, geometry 1m 52s ✓
E Sheep 2900 binary-search, greedy 2m 34s ✓
Practice › Codeforces Solutions › Croc Champ 2013 - Finals (online version, Div. 1) ›

CF 309A - Morning run

We have a circular running track of length l. Each runner starts at a fixed position on the circle, and independently chooses one of two directions with equal probability. Everyone runs at speed 1.
codeforces competitive-programming binary-search math two-pointers May 29, 2026
Practice › Codeforces Solutions › Croc Champ 2013 - Finals (online version, Div. 1) ›

CF 309C - Memory for Arrays

The problem models a simplified memory allocation scenario. We have a computer’s RAM represented as a sequence of cells. Some of these cells are already occupied, and the remaining empty consecutive sequences form memory clusters. Each cluster is described by its size in cells.
codeforces competitive-programming binary-search bitmasks greedy May 29, 2026
Practice › Codeforces Solutions › Croc Champ 2013 - Finals (online version, Div. 1) ›

CF 309D - Tennis Rackets

We are asked to count the number of obtuse triangles that can be formed on a triangular tennis racket with evenly spaced holes along its sides. Each side has n holes dividing it into n+1 equal segments.
codeforces competitive-programming brute-force geometry May 29, 2026
Practice › Codeforces Solutions › Croc Champ 2013 - Finals (online version, Div. 1) ›

CF 309E - Sheep

We have a collection of sheep, each identified by a unique number from 1 to n. Every sheep has a range of meadow regions it likes, represented as an interval $[li, ri]$. In the morning, the first shepherd ties any pair of sheep whose preferred regions overlap.
codeforces competitive-programming binary-search greedy May 29, 2026