Codeforces Beta Round 33 (Codeforces format)

Solutions for Codeforces Beta Round 33 (Codeforces format) (contest 33). 4/5 problems verified against sample I/O. Difficulty range: 1200-2600.

5 items

Codeforces Beta Round 33 (Codeforces format)

Type: Beta | Problems: 5 | Verified: 4/5 | Rating range: 1200-2600 | Time: 18m 29s

Problem	Name	Rating	Tags	Solve Time	Verified
A	What is for dinner?	1200	greedy, implementation	3m 53s	✓
B	String Problem	1800	shortest-paths	7m 1s	✓
C	Wonderful Randomized Sum	1800	greedy	3m 6s	✓
D	Knights	2000	geometry, graphs, shortest-paths	1m 32s	✓
E	Helper	2600	-	2m 57s	✗

Practice › Codeforces Solutions › Codeforces Beta Round 33 (Codeforces format) ›

CF 33A - What is for dinner?

Each tooth belongs to exactly one row. When Valerie eats one crucian using a row, every tooth in that row loses one unit of viability. A row becomes unusable as soon as at least one tooth inside it would drop below zero.

Practice › Codeforces Solutions › Codeforces Beta Round 33 (Codeforces format) ›

CF 33B - String Problem

We are given two lowercase strings of the same length. We may repeatedly transform characters using directed conversion rules. A rule like a -> b with cost 5 means we can change one occurrence of a into b by paying 5.

Practice › Codeforces Solutions › Codeforces Beta Round 33 (Codeforces format) ›

CF 33C - Wonderful Randomized Sum

We are given a sequence of integers, and the task is to maximize its sum by performing two operations: first, we may choose any prefix of the sequence and multiply every element in it by -1; second, we may choose any suffix of the sequence and multiply every element in it by -1.

Practice › Codeforces Solutions › Codeforces Beta Round 33 (Codeforces format) ›

CF 33D - Knights

We are given a map of Berland with several control points and circular fences. Each knight occupies a control point. Fences separate the kingdom into regions, and a knight must cross fences to move between control points.

Practice › Codeforces Solutions › Codeforces Beta Round 33 (Codeforces format) ›

CF 33E - Helper

Valera has a list of subjects he knows how to solve. Every subject takes a fixed amount of working time. Students come with requests: each request has a subject, an exam deadline, and a reward. If Valera finishes the solution strictly before the exam starts, he gets paid.