Zepto Code Rush 2014

Solutions for Zepto Code Rush 2014 (contest 436). 0/3 problems verified against sample I/O. Difficulty range: 1400-3000.

3 items

Zepto Code Rush 2014

Type: Special | Problems: 3 | Verified: 0/3 | Rating range: 1400-3000 | Time: 9m 32s

Problem	Name	Rating	Tags	Solve Time	Verified
B	Om Nom and Spiders	1400	implementation, math	3m 56s	✗
E	Cardboard Box	2600	data-structures, greedy	1m 21s	✗
F	Banners	3000	brute-force, data-structures, dp	4m 15s	✗

Practice › Codeforces Solutions › Zepto Code Rush 2014 ›

CF 436B - Om Nom and Spiders

We have a rectangular grid representing the park. Some cells initially contain spiders, and each spider permanently moves in one fixed direction: left, right, up, or down. Every second, a spider moves to the adjacent cell in that direction.

Practice › Codeforces Solutions › Zepto Code Rush 2014 ›

CF 436E - Cardboard Box

We are given a set of levels in a game, each with two possible completion times. Completing a level for one star takes a[i] time, and completing it for two stars takes b[i] time, with a[i] < b[i].

Practice › Codeforces Solutions › Zepto Code Rush 2014 ›

CF 436F - Banners

We have two versions of a mobile application. The paid version costs p rubles and contains no ads. The free version contains c banners. Each user has two limits. The value a[i] is the maximum amount this user is willing to pay for the paid version.