Zepto Code Rush 2014

6 problems from Zepto Code Rush 2014 (contest 436), difficulty 1400-3000. 3/6 solutions verified against sample I/O.

6 items

Zepto Code Rush 2014

Special | 6 problems | 3/6 verified | Difficulty 1400-3000 | 16m 9s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Feed with Candy	1500	greedy	3,788	1m 36s	✓
B	Om Nom and Spiders	1400	implementation, math	3,147	1m 29s	✓
C	Dungeons and Candies	1800	dsu, graphs, greedy	2,886	4m 29s	✓
D	Pudding Monsters	2800	dp	352	2m 7s
E	Cardboard Box	2600	data-structures, greedy	1,822	2m 4s
F	Banners	3000	brute-force, data-structures, dp	458	4m 24s

Practice › Codeforces Solutions › Zepto Code Rush 2014 ›

CF 436A - Feed with Candy

We have up to 2000 candies. Each candy has a type, either 0 or 1, a required jump height, and a mass. Om Nom starts with jump power x. He may eat any uneaten candy whose height is at most his current jump power. After eating a candy with mass m, his jump power increases by m.

Practice › Codeforces Solutions › Zepto Code Rush 2014 ›

CF 436F - Banners

We are asked to optimize revenue from a mobile app that has both a free version with ads and a paid version without ads.

Practice › Codeforces Solutions › Zepto Code Rush 2014 ›

CF 436E - Cardboard Box

Each level can end up in one of three states. State 0 means we ignore it and gain no stars. State 1 means we complete it for one star and spend a[i] time. State 2 means we complete it for two stars and spend b[i] time.

Practice › Codeforces Solutions › Zepto Code Rush 2014 ›

CF 436C - Dungeons and Candies

We are given k game levels. Each level is an n × m grid of characters. A level can be transmitted in two different ways. The first option is to send the entire grid from scratch. Since every cell must be transmitted, the cost is n m.

Practice › Codeforces Solutions › Zepto Code Rush 2014 ›

CF 436D - Pudding Monsters

We have monsters placed on an infinite integer line. Consecutive monsters immediately stick together and form a block. A move chooses one entire block and slides it left or right until it collides with another block. After the collision, the two blocks merge.

Practice › Codeforces Solutions › Zepto Code Rush 2014 ›

CF 436B - Om Nom and Spiders

We are asked to compute how many spiders Om Nom sees if he starts walking from each cell in the top row of a rectangular park. The park is represented as an n × m grid where some cells contain spiders with an initial direction: left, right, up, or down.