Codeforces Round 730 (Div. 2)

5 problems from Codeforces Round 730 (Div. 2) (contest 1543), difficulty 900-2700. 2/5 solutions verified against sample I/O.

5 items

Codeforces Round 730 (Div. 2)

Div. 2 | 5 problems | 2/5 verified | Difficulty 900-2700 | 31m 29s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Exciting Bets	900	greedy, math, number-theory	40,917	8m 6s	✓
B	Customising the Track	900	combinatorics, greedy, math	24,475	4m 35s	✓
C	Need for Pink Slips	1900	bitmasks, brute-force, dfs-and-similar	5,625	6m 31s
D1	RPD and Rap Sheet (Easy Version)	1700	bitmasks, constructive-algorithms, interactive	8,000	6m 17s
E	The Final Pursuit	2700	bitmasks, constructive-algorithms, divide-and-conquer	450	6m

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

CF 1543A - Exciting Bets

We are given two non-negative integers, and we can move them in lockstep: every operation changes both values by exactly the same amount, either increasing both by one or decreasing both by one (as long as we do not go below zero).

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

CF 1543D1 - RPD and Rap Sheet (Easy Version)

We are playing an interactive game with a hidden number that always stays in the range from 0 to n − 1. We repeatedly submit guesses. If a guess is correct, the interaction ends immediately.

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

CF 1543E - The Final Pursuit

The input describes a graph that is guaranteed to be a permuted hypercube. This means the graph has exactly $2^n$ vertices, every vertex has degree exactly $n$, and the structure is isomorphic to the standard $n$-dimensional hypercube, but the vertex labels have been…

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

CF 1543C - Need for Pink Slips

We are repeatedly running a stochastic process that evolves a small probability distribution over three outcomes. At any moment there are up to three “active” slips, one of which is a terminal success state (the pink slip) and the other two are transient states.

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

CF 1543B - Customising the Track

We are given a list of non-negative integers where each value represents how many cars sit on a segment of a road. The “cost” of the whole configuration is defined by comparing every pair of segments and summing the absolute difference of their car counts.