Codeforces Beta Round 19

Solutions for Codeforces Beta Round 19 (contest 19). 5/5 problems verified against sample I/O. Difficulty range: 1400-2900.

5 items

Codeforces Beta Round 19

Type: Beta | Problems: 5 | Verified: 5/5 | Rating range: 1400-2900 | Time: 16m 37s

Problem	Name	Rating	Tags	Solve Time	Verified
A	World Football Cup	1400	implementation	5m 51s	✓
B	Checkout Assistant	1900	dp	3m 5s	✓
C	Deletion of Repeats	2200	greedy, hashing, string-suffix-structures	2m 2s	✓
D	Points	2800	data-structures	3m 49s	✓
E	Fairy	2900	dfs-and-similar, divide-and-conquer, dsu	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.