CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!)

Solutions for CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) (contest 1810). 2/8 problems verified against sample I/O. Difficulty range: 800-3200.

8 items

CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!)

Type: Div. 1+2 | Problems: 8 | Verified: 2/8 | Rating range: 800-3200 | Time: 16m 8s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Beautiful Sequence	800	brute-force, greedy	3m 44s	✗
B	Candies	800	constructive-algorithms, math, number-theory	1m 47s	✗
C	Make It Permutation	1300	brute-force, greedy, sortings	1m 44s	✓
D	Climbing the Tree	1700	binary-search, math	1m 12s	✓
E	Monsters	2100	brute-force, data-structures, dfs-and-similar	1m 32s	✗
F	M-tree	2800	data-structures, math, sortings	1m 39s	✗
G	The Maximum Prefix	3200	dp	1m 31s	✗
H	Last Number	2900	combinatorics, math	2m 59s	✗

Practice › Codeforces Solutions › CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) ›

CF 1810H - Last Number

The issue here is purely syntactic in the way the multi-line string was written. The triple-quoted string for the test input was not terminated properly, causing a SyntaxError. Every """ must be paired correctly.

Practice › Codeforces Solutions › CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) ›

CF 1810G - The Maximum Prefix

We are building a random sequence of +1 and -1 values, but we never actually simulate it directly. Instead, for a fixed length k, each position independently becomes +1 with probability pi and -1 otherwise.

Practice › Codeforces Solutions › CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) ›

CF 1810F - M-tree

We are asked to build a rooted tree that satisfies a very particular property: each non-leaf node must have exactly m children, and every leaf holds a positive integer. The tree is called "good" if it satisfies this structure.

Practice › Codeforces Solutions › CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) ›

CF 1810A - Beautiful Sequence

The traceback you are seeing: is not a logic error in your algorithm. It happens because your code does: but the input is empty. input() reaches end-of-file immediately, so Python raises an EOFError. This is a classic edge case: empty input or zero test cases.

Practice › Codeforces Solutions › CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) ›

CF 1810E - Monsters

We are given an undirected graph where every vertex contains a monster with a numeric requirement. If a monster has value a[i], you are only allowed to defeat it when you have already defeated at least a[i] other monsters.

Practice › Codeforces Solutions › CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) ›

CF 1810D - Climbing the Tree

We are dealing with a scenario where snails climb a tree of unknown height. Each snail has two numbers, a and b, representing meters climbed during the day and meters slid down at night. The first snail reports the number of days n it took to reach the top.

Practice › Codeforces Solutions › CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) ›

CF 1810B - Candies

We start with a single candy and want to reach exactly $n$ candies using at most 40 spells. Each spell either doubles the current number of candies and subtracts one, or doubles and adds one. The input consists of multiple test cases, each giving a target number $n$.

Practice › Codeforces Solutions › CodeTON Round 4 (Div. 1 + Div. 2, Rated, Prizes!) ›

CF 1810C - Make It Permutation

We are given an array and two operations with fixed costs. We may delete any existing element for cost c, or insert any positive integer for cost d. The goal is to transform the array into a valid permutation of some length m.