Codeforces Round 123 (Div. 2)

5 problems from Codeforces Round 123 (Div. 2) (contest 195), difficulty 1000-2000. 5/5 solutions verified against sample I/O.

5 items

Codeforces Round 123 (Div. 2)

Div. 2 | 5 problems | 5/5 verified | Difficulty 1000-2000 | 8m

#	Problem	Rating	Tags	Accepted	Time	✓
A	Let's Watch Football	1000	binary-search, brute-force, math	10,129	1m 39s	✓
B	After Training	1300	data-structures, implementation, math	5,512	1m 9s	✓
C	Try and Catch	1800	expression-parsing, implementation	1,239	2m 23s	✓
D	Analyzing Polyline	1900	geometry, math, sortings	1,135	1m 28s	✓
E	Building Forest	2000	data-structures, dsu, graphs	859	1m 21s	✓

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

CF 195B - After Training

We are asked to simulate the process of distributing numbered footballs into a row of baskets according to a specific order. Each new ball must go into the basket that currently contains the fewest balls.

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

CF 195A - Let's Watch Football

The video lasts for c seconds. Watching one second of video consumes a units of data, while the internet connection downloads only b units per second. Since a b, starting immediately is impossible because data would be consumed faster than it arrives.

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

CF 195E - Building Forest

We are asked to construct a special kind of directed forest where each vertex has at most one outgoing edge, and each edge carries a weight. Vertices are added one by one. When adding a vertex, we are optionally given a set of pairs consisting of an existing vertex and a number.

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

CF 195D - Analyzing Polyline

We are asked to analyze the polyline formed by summing several linear functions. Each function is of the form $yi(x) = ki cdot The input consists of $n$ lines, each providing the slope $ki$ for the positive $x$-side and a constant $bi$.

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

CF 195C - Try and Catch

We are given the source code of a tiny language that contains only three kinds of statements: try, catch(type, message), and exactly one throw(type). Each try is paired with a later catch, forming a try-catch block.