Codeforces Round 189 (Div. 1)

Solutions for Codeforces Round 189 (Div. 1) (contest 319). 1/2 problems verified against sample I/O. Difficulty range: 2100-3000.

2 items

Codeforces Round 189 (Div. 1)

Type: Div. 1 | Problems: 2 | Verified: 1/2 | Rating range: 2100-3000 | Time: 4m 42s

Problem	Name	Rating	Tags	Solve Time	Verified
C	Kalila and Dimna in the Logging Industry	2100	dp, geometry	2m 47s	✗
E	Ping-Pong	3000	data-structures	1m 55s	✓

Practice › Codeforces Solutions › Codeforces Round 189 (Div. 1) ›

CF 319C - Kalila and Dimna in the Logging Industry

We have a sequence of trees, each with a strictly increasing height, and each tree has an associated cost that represents the price of recharging the chainsaw after completely cutting the highest-indexed tree so far. Kalila and Dimna need to reduce all tree heights to zero.

Practice › Codeforces Solutions › Codeforces Round 189 (Div. 1) ›

CF 319E - Ping-Pong

We are building a growing collection of intervals, and after each addition we may be asked whether one interval can “reach” another through a chain of moves.