Codeforces Global Round 29 (Div. 1 + Div. 2)

10 problems from Codeforces Global Round 29 (Div. 1 + Div. 2) (contest 2147), difficulty 800-3500. 1/10 solutions verified against sample I/O.

10 items

Codeforces Global Round 29 (Div. 1 + Div. 2)

Div. 1+2 | 10 problems | 1/10 verified | Difficulty 800-3500 | 20m 3s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Shortest Increasing Path	800	constructive-algorithms, greedy	18,624	1m 57s
B	Multiple Construction	1000	constructive-algorithms	16,950	1m 37s
C	Rabbits	1500	constructive-algorithms, dp, greedy	9,737	1m 41s
D	Game on Array	1700	games, greedy	7,482	2m 14s
E	Maximum OR Popcount	2300	binary-search, bitmasks, brute-force	2,118	1m 53s	✓
F	Exchange Queries	2800	combinatorics, data-structures, greedy	665	2m 46s
G	Modular Tetration	3100	combinatorics, math, number-theory	359	3m 11s
H	Maxflow GCD Coloring	3500	constructive-algorithms, flows, graphs	189	1m 44s
I1	Longest Increasing Path (Easy Version)	3300	constructive-algorithms, math	134	1m 30s
I2	Longest Increasing Path (Hard Version)	3500	constructive-algorithms, math	104	1m 30s

Practice › Codeforces Solutions › Codeforces Global Round 29 (Div. 1 + Div. 2) ›

CF 2147I2 - Longest Increasing Path (Hard Version)

We are asked to construct a long sequence of integers, where the sequence behaves like a walk on the number line. Each consecutive pair defines a jump distance, and these jump distances must strictly increase as we move along the sequence.

Practice › Codeforces Solutions › Codeforces Global Round 29 (Div. 1 + Div. 2) ›

CF 2147G - Modular Tetration

We are asked to analyze sequences generated by repeated exponentiation modulo a given number. Specifically, for a positive integer $a$, we define a sequence $bn$ by $b0 = 1$ and $bn = a^{b{n-1}}$ for $n ge 1$.

Practice › Codeforces Solutions › Codeforces Global Round 29 (Div. 1 + Div. 2) ›

CF 2147I1 - Longest Increasing Path (Easy Version)

We are asked to construct a sequence of integers of length $n$ placed on the number line. The only structural constraint is about consecutive jumps: if we define the jump sizes as $ So the sequence of distances is strictly increasing, while the actual points $ai$ can move left…

Practice › Codeforces Solutions › Codeforces Global Round 29 (Div. 1 + Div. 2) ›

CF 2147H - Maxflow GCD Coloring

The graph defines a family of pairwise connectivity strengths. For every ordered pair of distinct vertices, we look at the maximum flow value between them when treating edges as undirected capacitated connections.

Practice › Codeforces Solutions › Codeforces Global Round 29 (Div. 1 + Div. 2) ›

CF 2147F - Exchange Queries

We are given a set of items, and each item is ranked in two independent ways. One ranking comes from permutation p, the other from permutation s.

Practice › Codeforces Solutions › Codeforces Global Round 29 (Div. 1 + Div. 2) ›

CF 2147D - Game on Array

We are given a sequence of positive integers, representing a set of “tiles” with values. Two players, Alice and Bob, take turns picking a number that currently exists in the array.

Practice › Codeforces Solutions › Codeforces Global Round 29 (Div. 1 + Div. 2) ›

CF 2147E - Maximum OR Popcount

We are given an array of non-negative integers, and for each query we are allowed to increment any elements of the array a certain number of times.

Practice › Codeforces Solutions › Codeforces Global Round 29 (Div. 1 + Div. 2) ›

CF 2147A - Shortest Increasing Path

We are on a two-dimensional grid starting at the origin $(0, 0)$ and want to reach a target $(x, y)$. Movement is constrained in two ways. First, we alternate axes: the first step moves right along $x$, the second up along $y$, the third along $x$ again, and so on.

Practice › Codeforces Solutions › Codeforces Global Round 29 (Div. 1 + Div. 2) ›

CF 2147C - Rabbits

We are given a row of flower pots, some with flowers and some empty. Each empty pot must host a rabbit, and we have to decide which way each rabbit will face: left or right. Rabbits are fidgety and may jump to the adjacent pot in the direction they face.

Practice › Codeforces Solutions › Codeforces Global Round 29 (Div. 1 + Div. 2) ›

CF 2147B - Multiple Construction

We are asked to construct a permutation-like array of length $2n$, but with repetition allowed: every number from $1$ to $n$ must appear exactly twice. The real constraint is not placement, but spacing.