Coder-Strike 2014 - Round 2

5 problems from Coder-Strike 2014 - Round 2 (contest 413), difficulty 1200-2200. 4/5 solutions verified against sample I/O.

5 items

Coder-Strike 2014 - Round 2

Special | 5 problems | 4/5 verified | Difficulty 1200-2200 | 9m 37s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Data Recovery	1200	implementation	2,967	1m 42s	✓
B	Spyke Chatting	1300	implementation	1,844	1m 48s
C	Jeopardy!	1400	greedy, math	2,676	2m 23s	✓
D	2048	2000	bitmasks, dp	908	2m 23s	✓
E	Maze 2D	2200	data-structures, divide-and-conquer	851	1m 21s	✓

Practice › Codeforces Solutions › Coder-Strike 2014 - Round 2 ›

CF 413A - Data Recovery

The problem gives us a sequence of processor temperatures recorded over n steps. The chief engineer has reliable notes of the minimum and maximum temperature observed, but the assistant only recorded m of the n temperatures.

Practice › Codeforces Solutions › Coder-Strike 2014 - Round 2 ›

CF 413B - Spyke Chatting

We are given a company where employees participate in several independent chat groups. Each chat has a fixed membership defined in advance. Over time, a log records messages: each event says that a particular employee posts in a particular chat.

Practice › Codeforces Solutions › Coder-Strike 2014 - Round 2 ›

CF 413C - Jeopardy!

The game consists of n questions, each with some base value a[i]. Some questions are marked as auctions. Team R2 starts by choosing the first question. After that, whoever answered the previous question correctly gets to choose the next question.

Practice › Codeforces Solutions › Coder-Strike 2014 - Round 2 ›

CF 413D - 2048

We process a sequence of tiles, each tile being either 2 or 4. A tile starts far to the right and slides left. When it touches an equal value, the two merge into a doubled value and the new tile keeps moving.

Practice › Codeforces Solutions › Coder-Strike 2014 - Round 2 ›

CF 413E - Maze 2D

We are working on a very narrow grid: only two rows, but a large number of columns. Each cell in this 2 by n strip is either free or blocked.