Codeforces Round 114 (Div. 1)

Solutions for Codeforces Round 114 (Div. 1) (contest 167). 3/5 problems verified against sample I/O. Difficulty range: 1600-3000.

5 items

Codeforces Round 114 (Div. 1)

Type: Div. 1 | Problems: 5 | Verified: 3/5 | Rating range: 1600-3000 | Time: 10m 57s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Wizards and Trolleybuses	1600	implementation, math	1m 40s	✓
B	Wizards and Huge Prize	1800	dp, math, probabilities	1m 38s	✗
C	Wizards and Numbers	2300	games, math	1m 39s	✗
D	Wizards and Roads	3000	data-structures, divide-and-conquer, graph-matchings	2m 8s	✓
E	Wizards and Bets	2900	dfs-and-similar, graphs, math	3m 52s	✓

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

CF 167A - Wizards and Trolleybuses

Each trolleybus starts from the depot at a fixed departure time. It begins with speed 0, can accelerate at most a, and can never exceed its own speed limit v[i]. The destination is d meters away.

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

CF 167B - Wizards and Huge Prize

We are asked to calculate the probability of performing well in a sequence of wizard contests, given both your chances of winning each contest and the types of prizes you may receive.

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

CF 167C - Wizards and Numbers

We have a two-player game played with two numbers on a blackboard, call them a and b. Each player can, on their turn, either replace the larger number with the remainder of dividing it by the smaller number, or subtract a positive multiple of the smaller number from the larger…

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

CF 167D - Wizards and Roads

We are given a set of cities on the plane. Every city has a unique x coordinate and a unique y coordinate. The first k cities are given explicitly, and the remaining cities are generated by two linear recurrences.

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

CF 167E - Wizards and Bets

We are given a directed acyclic graph. Some vertices are sources, meaning no edge enters them. Some vertices are sinks, meaning no edge leaves them. The number of sources and sinks is guaranteed to be equal.