Croc Champ 2012 - Round 1

Solutions for Croc Champ 2012 - Round 1 (contest 173). 3/5 problems verified against sample I/O. Difficulty range: 1300-2600.

5 items

Croc Champ 2012 - Round 1

Type: Special | Problems: 5 | Verified: 3/5 | Rating range: 1300-2600 | Time: 10m 55s

Problem Name Rating Tags Solve Time Verified
A Rock-Paper-Scissors 1300 implementation, math 1m 40s ✓
B Chamber of Secrets 1800 dfs-and-similar, shortest-paths 1m 49s ✓
C Spiral Maximum 1900 brute-force, dp 2m 41s ✗
D Deputies 2500 constructive-algorithms, graphs, greedy 3m 4s ✓
E Camping Groups 2600 data-structures, sortings 1m 41s ✗
Practice › Codeforces Solutions › Croc Champ 2012 - Round 1 ›

CF 173A - Rock-Paper-Scissors

In this problem, two players, Nikephoros and Polycarpus, play multiple rounds of rock-paper-scissors. Each player has a fixed sequence of moves that they cycle through as the rounds progress.
codeforces competitive-programming implementation math May 29, 2026
Practice › Codeforces Solutions › Croc Champ 2012 - Round 1 ›

CF 173B - Chamber of Secrets

The Chamber of Secrets is represented as a grid of size n by m, where each cell is either empty or contains a column. A basilisk is stationed in the bottom-right corner and looks left, while a person trying to enter starts at the top-left corner and looks right.
codeforces competitive-programming dfs-and-similar shortest-paths May 29, 2026
Practice › Codeforces Solutions › Croc Champ 2012 - Round 1 ›

CF 173C - Spiral Maximum

We are given a rectangular grid of integers. Inside this grid, we may place any odd-sized square, for example a 3×3, 5×5, or 7×7 subgrid. Inside that square we draw the standard spiral that starts at the top-left corner and winds inward. The spiral does not visit every cell.
codeforces competitive-programming brute-force dp May 29, 2026
Practice › Codeforces Solutions › Croc Champ 2012 - Round 1 ›

CF 173D - Deputies

We are asked to assign k deputies to n cities, with the condition that each deputy manages exactly three cities. The cities are placed on two sides of a river, and some pairs of cities are connected by bridges that span the river.
codeforces competitive-programming constructive-algorithms graphs greedy implementation May 29, 2026
Practice › Codeforces Solutions › Croc Champ 2012 - Round 1 ›

CF 173E - Camping Groups

We are asked to partition a club of members into groups based on responsibility and age constraints. Each member has a responsibility value and an age.
codeforces competitive-programming data-structures sortings May 29, 2026