Codeforces Round 744 (Div. 3)

Solutions for Codeforces Round 744 (Div. 3) (contest 1579). 1/8 problems verified against sample I/O. Difficulty range: 800-2200.

8 items

Codeforces Round 744 (Div. 3)

Type: Div. 3 | Problems: 8 | Verified: 1/8 | Rating range: 800-2200 | Time: 29m 40s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Casimir's String Solitaire	800	math, strings	5m 46s	✗
B	Shifting Sort	1100	implementation, sortings	2m 10s	✗
C	Ticks	1500	greedy, implementation	5m 50s	✓
D	Productive Meeting	1400	constructive-algorithms, graphs, greedy	2m 39s	✗
E1	Permutation Minimization by Deque	1000	constructive-algorithms, greedy, math	2m 5s	✗
E2	Array Optimization by Deque	1700	data-structures, greedy	3m 30s	✗
F	Array Stabilization (AND version)	1700	brute-force, graphs, math	5m 47s	✗
G	Minimal Coverage	2200	dp	1m 53s	✗

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

CF 1579F - Array Stabilization (AND version)

We are given an array consisting only of zeroes and ones, and a positive integer d that specifies a cyclic right shift.

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

CF 1579E2 - Array Optimization by Deque

The proposed solution does address the actual exercise and identifies the key idea: each pair $(U{2n-1},U{2n})$ is transformed by either keeping it unchanged or swapping coordinates, depending on whether the point lies in $G$. This is indeed the mechanism behind the construction.

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

CF 1579G - Minimal Coverage

We are given a sequence of segment lengths, and we must place these segments one after another on an infinite number line. The first segment starts at coordinate 0, with one endpoint fixed at 0.

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

CF 1579E1 - Permutation Minimization by Deque

We are given a permutation of size $n$, which means an array containing all integers from 1 to $n$ exactly once. Our task is to process this permutation into a double-ended queue, or deque, where each new element can either be placed at the front or the back.

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

CF 1579C - Ticks

We are given a grid of size $n times m$ representing a paper, where some cells are black (denoted by ) and others are white (.). Casimir claims the black cells are produced by drawing ticks.

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

CF 1579A - Casimir's String Solitaire

We are given a string containing only the characters A, B, and C. In one move, we may remove either an A together with a B, or a B together with a C. The two removed characters can come from any positions in the string.

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

CF 1579D - Productive Meeting

We are asked to organize a meeting with $n$ people, where each person has a limit on how many private conversations they can participate in. The array $a$ describes each person’s sociability: $ai$ is the number of talks person $i$ can attend before leaving.

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

CF 1579B - Shifting Sort

We are given an array and a special operation. Instead of swapping individual elements, we may choose any contiguous segment and rotate that segment to the left by any amount. After the rotation, the elements remain inside the same interval, only their order changes cyclically.