Codeforces Round 193 (Div. 2)

5 problems from Codeforces Round 193 (Div. 2) (contest 332), difficulty 1300-2400. 2/5 solutions verified against sample I/O.

5 items

Codeforces Round 193 (Div. 2)

Div. 2 | 5 problems | 2/5 verified | Difficulty 1300-2400 | 9m

#	Problem	Rating	Tags	Accepted	Time	✓
A	Down the Hatch!	1300	implementation	3,724	1m 34s	✓
B	Maximum Absurdity	1500	data-structures, dp, implementation	8,708	1m 16s	✓
C	Students' Revenge	2200	data-structures, greedy, sortings	1,028	1m 52s
D	Theft of Blueprints	2400	graphs, math	417	1m 47s
E	Binary Key	2400	dp, greedy, implementation	334	2m 31s

Practice › Codeforces Solutions › Codeforces Round 193 (Div. 2) ›

CF 332B - Maximum Absurdity

We are given a list of numbers placed on a line, where each position represents a law and its value represents how “useful” or “valuable” it is. We must select exactly two contiguous blocks of fixed length k.

Practice › Codeforces Solutions › Codeforces Round 193 (Div. 2) ›

CF 332C - Students' Revenge

We are given a collection of orders. From these, we must select exactly $p$ orders that will be enforced. Each chosen order has two effects: if the chairperson complies with it, it contributes some amount of “damage” measured by $ai$, and if she refuses, it causes…

Practice › Codeforces Solutions › Codeforces Round 193 (Div. 2) ›

CF 332E - Binary Key

We are given a string p, which acts as a container, and a target message s that we want to extract. To do this, we must construct a binary key q of length k.

Practice › Codeforces Solutions › Codeforces Round 193 (Div. 2) ›

CF 332D - Theft of Blueprints

We are asked to analyze a network of missile silos connected by underground passages, each guarded by a certain number of droids. The silos form a highly structured network: for any subset of silos of size k, there is exactly one silo connected directly to all of them.

Practice › Codeforces Solutions › Codeforces Round 193 (Div. 2) ›

CF 332A - Down the Hatch!

The game can be thought of as a circle of n players taking turns performing one of two actions, denoted by 'a' for elbow and 'b' for nod. Vasya, at index 0, wants to maximize the number of times he can drink a glass of juice.