Codeforces Round 193 (Div. 2)

Solutions for Codeforces Round 193 (Div. 2) (contest 332). 0/2 problems verified against sample I/O. Difficulty range: 2200-2400.

2 items

Codeforces Round 193 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 0/2 | Rating range: 2200-2400 | Time: 9m

Problem	Name	Rating	Tags	Solve Time	Verified
C	Students' Revenge	2200	data-structures, greedy, sortings	7m 1s	✗
E	Binary Key	2400	dp, greedy, implementation	1m 59s	✗

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

CF 332C - Students' Revenge

We have n possible university orders. Every order has two values. The value a[i] measures how many grey hairs the chairperson gets if she obeys that order. The value b[i] measures how unhappy the directors become if she refuses that order.

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

CF 332E - Binary Key

We are given a container string p and a target message string s. The container is arbitrary, while the message contains the sequence we wish to extract. The extraction mechanism is governed by a binary key q of length k.