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

5 problems from Croc Champ 2013 - Finals (online version, Div. 1) (contest 309), difficulty 1900-2900. 4/5 solutions verified against sample I/O.

5 items

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

Div. 1 | 5 problems | 4/5 verified | Difficulty 1900-2900 | 7m 55s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Morning run	2000	binary-search, math, two-pointers	530	2m 40s
B	Context Advertising	2100	dp, two-pointers	818	1m 10s	✓
C	Memory for Arrays	1900	binary-search, bitmasks, greedy	1,493	1m 16s	✓
D	Tennis Rackets	2700	brute-force, geometry	186	1m 28s	✓
E	Sheep	2900	binary-search, greedy	299	1m 21s	✓

Practice › Codeforces Solutions › Croc Champ 2013 - Finals (online version, Div. 1) ›

CF 309A - Morning run

We are asked to compute the expected number of collisions between runners on a circular track. Each runner starts at a distinct position along a track of length l and chooses to run either clockwise or counter-clockwise with equal probability.

Practice › Codeforces Solutions › Croc Champ 2013 - Finals (online version, Div. 1) ›

CF 309C - Memory for Arrays

We are given a memory layout split into several contiguous free segments, which we can think of as independent blocks of space. Each block has a fixed length, and we also have a collection of arrays we may want to place into this memory.

Practice › Codeforces Solutions › Croc Champ 2013 - Finals (online version, Div. 1) ›

CF 309E - Sheep

We are given a collection of segments on a very large number line. Each sheep corresponds to one segment, and two sheep become “connected” if their segments overlap in at least one point. After this preprocessing, we must arrange all sheep in a single linear order.

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 drawn inside an equilateral triangular tennis racket frame. The racket’s three sides each have n equally spaced holes.

Practice › Codeforces Solutions › Croc Champ 2013 - Finals (online version, Div. 1) ›

CF 309B - Context Advertising

We are given a sequence of words in fixed order, and we want to select a consecutive block of them, starting at some position and ending later, such that this block can be printed on a rectangular banner.