Croc Champ 2012 - Round 2

Solutions for Croc Champ 2012 - Round 2 (contest 176). 4/4 problems verified against sample I/O. Difficulty range: 1200-3100.

4 items

Croc Champ 2012 - Round 2

Type: Special | Problems: 4 | Verified: 4/4 | Rating range: 1200-3100 | Time: 6m 33s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Trading Business	1200	greedy, sortings	1m 11s	✓
B	Word Cut	1700	dp	1m 42s	✓
C	Playing with Superglue	2000	combinatorics, constructive-algorithms	1m 28s	✓
E	Archaeology	3100	data-structures, dfs-and-similar, trees	2m 12s	✓

Practice › Codeforces Solutions › Croc Champ 2012 - Round 2 ›

CF 176A - Trading Business

Qwerty wants to maximize profit by buying items on one planet and selling them on another. Each planet offers multiple types of items, with known buying and selling prices and stock limits. Qwerty's ship has a fixed capacity, so he cannot carry more than k items.

Practice › Codeforces Solutions › Croc Champ 2012 - Round 2 ›

CF 176B - Word Cut

We start with a string start and want to reach another string end after exactly k operations. One operation chooses a non-empty prefix and a non-empty suffix. If the current word is written as xy, the operation transforms it into yx.

Practice › Codeforces Solutions › Croc Champ 2012 - Round 2 ›

CF 176C - Playing with Superglue

We have a rectangular grid and two chips placed on different cells. The first player moves first. On every turn, the first player chooses one chip that is still movable and shifts it by one square in one of the four cardinal directions.

Practice › Codeforces Solutions › Croc Champ 2012 - Round 2 ›

CF 176E - Archaeology

We are given a weighted tree. Every node represents a village, and every edge represents a road with a length. Villages can appear and disappear over time through online queries. At any moment, only a subset of villages currently exists.