Codeforces Beta Round 19

5 problems from Codeforces Beta Round 19 (contest 19), difficulty 1400-2900. 5/5 solutions verified against sample I/O.

5 items

Codeforces Beta Round 19

Beta | 5 problems | 5/5 verified | Difficulty 1400-2900 | 16m 37s

#	Problem	Rating	Tags	Accepted	Time	✓
A	World Football Cup	1400	implementation	3,141	5m 51s	✓
B	Checkout Assistant	1900	dp	5,822	3m 5s	✓
C	Deletion of Repeats	2200	greedy, hashing, string-suffix-structures	1,325	2m 2s	✓
D	Points	2800	data-structures	3,168	3m 49s	✓
E	Fairy	2900	dfs-and-similar, divide-and-conquer, dsu	2,512	1m 50s	✓

Practice › Codeforces Solutions › Codeforces Beta Round 19 ›

CF 19A - World Football Cup

We are given the full results of a football tournament where every pair of teams plays exactly one match. For each match, we know how many goals each side scored. Using the tournament rules, we must determine which teams advance to the knockout stage.

Practice › Codeforces Solutions › Codeforces Beta Round 19 ›

CF 19B - Checkout Assistant

Each item has two properties. If Bob pays for that item, the cashier spends t[i] seconds processing it and Bob also spends c[i] money. During those t[i] seconds, Bob can steal other items, one item per second.

Practice › Codeforces Solutions › Codeforces Beta Round 19 ›

CF 19D - Points

We maintain a dynamic set of points on a 2D plane. Three operations are supported.

Practice › Codeforces Solutions › Codeforces Beta Round 19 ›

CF 19E - Fairy

We are given an undirected graph. Each edge represents a segment drawn between two points. We may erase exactly one edge, and after removing it we want the remaining graph to become bipartite.