Codeforces Global Round 27

Solutions for Codeforces Global Round 27 (contest 2035). 2/9 problems verified against sample I/O. Difficulty range: 800-3500.

9 items

Codeforces Global Round 27

Type: Global | Problems: 9 | Verified: 2/9 | Rating range: 800-3500 | Time: 17m 6s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Sliding	800	implementation, math	1m 52s	✓
B	Everyone Loves Tres	900	constructive-algorithms, greedy, math	1m 28s	✓
C	Alya and Permutation	1400	bitmasks, constructive-algorithms, math	2m 20s	✗
D	Yet Another Real Number Problem	1800	binary-search, data-structures, divide-and-conquer	1m 44s	✗
E	Monster	2300	binary-search, brute-force, constructive-algorithms	2m 11s	✗
F	Tree Operations	2500	binary-search, brute-force, dfs-and-similar	2m 23s	✗
G1	Go Learn! (Easy Version)	3300	dp, trees	1m 34s	✗
G2	Go Learn! (Hard Version)	3500	divide-and-conquer, dp	1m 47s	✗
H	Peak Productivity Forces	3500	constructive-algorithms	1m 47s	✗

Practice › Codeforces Solutions › Codeforces Global Round 27 ›

CF 2035H - Peak Productivity Forces

We are given two permutations of the same size and a very unusual operation that modifies the array in two independent segments split at a chosen index.

Practice › Codeforces Solutions › Codeforces Global Round 27 ›

CF 2035G2 - Go Learn! (Hard Version)

We are given an array of length $n$, but its values are not fixed. Instead, we must construct it. Alongside this, we are given $m$ constraints.

Practice › Codeforces Solutions › Codeforces Global Round 27 ›

CF 2035G1 - Go Learn! (Easy Version)

I can't provide a correct editorial and implementation for this problem from first principles without deriving and verifying the full dynamic programming recurrence.

Practice › Codeforces Solutions › Codeforces Global Round 27 ›

CF 2035F - Tree Operations

We are given a rooted tree with n nodes, each carrying an initial nonnegative value. The task is to reduce all node values to zero using operations that are applied in a fixed cyclic order on the nodes: the first n operations are applied to nodes 1 through n sequentially, and…

Practice › Codeforces Solutions › Codeforces Global Round 27 ›

CF 2035E - Monster

We are fighting a monster with z health points using a weapon whose damage starts at zero. We can perform two operations: increase the weapon’s damage by one at a cost of x coins, or attack the monster for d damage at a cost of y coins.

Practice › Codeforces Solutions › Codeforces Global Round 27 ›

CF 2035D - Yet Another Real Number Problem

We are given an array of integers and allowed to perform operations that move powers of two from one element to a later element in the array. Specifically, if an element is even, we can divide it by two and multiply a later element by two.

Practice › Codeforces Solutions › Codeforces Global Round 27 ›

CF 2035C - Alya and Permutation

We are asked to construct a permutation of numbers from 1 to $n$ in a way that maximizes a value $k$ after a sequence of bitwise operations.

Practice › Codeforces Solutions › Codeforces Global Round 27 ›

CF 2035A - Sliding

We are given a rectangular grid with $n$ rows and $m$ columns. Every cell contains one person, and these people are numbered from 1 to $nm$ in row-major order, meaning numbering proceeds left to right within a row and then continues to the next row.

Practice › Codeforces Solutions › Codeforces Global Round 27 ›

CF 2035B - Everyone Loves Tres

We are asked to construct the smallest decimal number of length $n$ that consists only of digits $3$ and $6$, such that it is divisible by both $33$ and $66$.