Codeforces Round 834 (Div. 3)

Solutions for Codeforces Round 834 (Div. 3) (contest 1759). 5/7 problems verified against sample I/O. Difficulty range: 800-1900.

7 items

Codeforces Round 834 (Div. 3)

Type: Div. 3 | Problems: 7 | Verified: 5/7 | Rating range: 800-1900 | Time: 26m 21s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Yes-Yes?	800	implementation, strings	1m 59s	✓
B	Lost Permutation	800	math	2m 27s	✓
C	Thermostat	1100	greedy, math, shortest-paths	3m 39s	✓
D	Make It Round	1400	brute-force, number-theory	6m	✓
E	The Humanoid	1500	brute-force, dp, sortings	2m 30s	✓
F	All Possible Digits	1800	binary-search, data-structures, greedy	6m 2s	✗
G	Restore the Permutation	1900	binary-search, constructive-algorithms, data-structures	3m 44s	✗

Practice › Codeforces Solutions › Codeforces Round 834 (Div. 3) ›

CF 1759F - All Possible Digits

We have n quests. Quest i gives a[i] coins whenever it is completed. During d days we may perform at most one quest per day. After doing a quest, we must wait k days before doing that same quest again.

Practice › Codeforces Solutions › Codeforces Round 834 (Div. 3) ›

CF 1759G - Restore the Permutation

We are given the array of pairwise maxima of an unknown permutation. The permutation has even length n. If we group its elements into pairs (p1, p2), (p3, p4), ... and replace each pair by its maximum, we obtain an array b of length n/2.

Practice › Codeforces Solutions › Codeforces Round 834 (Div. 3) ›

CF 1759D - Make It Round

We are repeatedly given a starting integer and a limit on how much we are allowed to scale it. For each case, we choose a multiplier $k$ between 1 and $m$, multiply the original number by $k$, and obtain a candidate result.

Practice › Codeforces Solutions › Codeforces Round 834 (Div. 3) ›

CF 1759E - The Humanoid

We have a humanoid with initial power h and a collection of astronauts with powers a[i]. The humanoid can absorb an astronaut only if the astronaut's power is strictly smaller than the humanoid's current power.

Practice › Codeforces Solutions › Codeforces Round 834 (Div. 3) ›

CF 1759C - Thermostat

We are given a thermostat whose current temperature is a, and we want to adjust it to a target temperature b. The thermostat has hard limits: it can only be set to temperatures between l and r inclusive, and any single adjustment must change the temperature by at least x.

Practice › Codeforces Solutions › Codeforces Round 834 (Div. 3) ›

CF 1759B - Lost Permutation

We are given several numbers that definitely belong to some unknown permutation. The missing numbers were lost, but we know the sum of all missing values.

Practice › Codeforces Solutions › Codeforces Round 834 (Div. 3) ›

CF 1759A - Yes-Yes?

We are given a short string for each query and we want to decide whether it could have appeared inside an infinitely repeated pattern formed by writing the word “Yes” over and over again without separators.