Codeforces Round 123 (Div. 2)

Solutions for Codeforces Round 123 (Div. 2) (contest 195). 3/4 problems verified against sample I/O. Difficulty range: 1000-2000.

4 items

Codeforces Round 123 (Div. 2)

Type: Div. 2 | Problems: 4 | Verified: 3/4 | Rating range: 1000-2000 | Time: 5m 40s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Let's Watch Football	1000	binary-search, brute-force, math	1m 24s	✓
C	Try and Catch	1800	expression-parsing, implementation	1m 8s	✓
D	Analyzing Polyline	1900	geometry, math, sortings	1m 28s	✗
E	Building Forest	2000	data-structures, dsu, graphs	1m 40s	✓

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

CF 195A - Let's Watch Football

The video consumes a units of data every second while being watched. The internet connection downloads only b units per second, and a b, so if the users start immediately, the buffer will eventually run out.

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

CF 195C - Try and Catch

The task is to simulate the exception-handling behavior of a simple programming language. The program consists of three types of statements: try, catch(type, message), and throw(type).

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

CF 195D - Analyzing Polyline

We are asked to consider a set of linear functions, each defined by a slope $ki$ and intercept $bi$, and to analyze their sum.

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

CF 195E - Building Forest

We build a directed weighted forest incrementally. Every vertex has at most one outgoing edge, so if we start from any vertex and repeatedly follow outgoing edges, we eventually reach a root. When vertex i is added, the input gives several pairs (v, x).