Codeforces Round 665 (Div. 2)

Solutions for Codeforces Round 665 (Div. 2) (contest 1401). 3/6 problems verified against sample I/O. Difficulty range: 900-2400.

6 items

Codeforces Round 665 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 3/6 | Rating range: 900-2400 | Time: 24m 18s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Distance and Axis	900	constructive-algorithms, math	1m 35s	✓
B	Ternary Sequence	1100	constructive-algorithms, greedy, math	1m 35s	✓
C	Mere Array	1300	constructive-algorithms, math, number-theory	9m 14s	✓
D	Maximum Distributed Tree	1800	dfs-and-similar, dp, greedy	7m 36s	✗
E	Divide Square	2400	data-structures, geometry, implementation	2m 17s	✗
F	Reverse and Swap	2400	binary-search, bitmasks, data-structures	2m 1s	✗

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

CF 1401C - Mere Array

We are given an array of positive integers. The allowed operation is a swap between two elements if the greatest common divisor (GCD) of those two elements equals the minimum element of the array.

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

CF 1401D - Maximum Distributed Tree

Got it. Let’s go careful step by step. The input is: - The first line 5 is the number of queries (n = 5). - Each of the next 5 lines contains 4 integers: a b c d. The expected output is: - Each output line corresponds to an input line. - Each output line has 4 integers.

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

CF 1401F - Reverse and Swap

We are working with an array of length $2^n$, where $n$ can be up to 18, so the array can have up to $262{,}144$ elements. Queries modify the array or request the sum of subarrays. There are four types of modifications. The first directly replaces an element.

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

CF 1401E - Divide Square

We are asked to compute the number of pieces a large square is divided into after drawing several horizontal and vertical line segments.

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

CF 1401A - Distance and Axis

We are given a point $A$ placed on the integer number line at coordinate $n$. We are allowed to adjust this point one unit left or right per move.

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

CF 1401B - Ternary Sequence

We are given two multisets of numbers, each number being only 0, 1, or 2. The size of both multisets is the same, because we are told the total counts in each sequence match. We are allowed to reorder both sequences arbitrarily, and then we pair elements position by position.