Codeforces Round 732 (Div. 1)

7 problems from Codeforces Round 732 (Div. 1) (contest 1545), difficulty 1500-3500. 1/7 solutions verified against sample I/O.

7 items

Codeforces Round 732 (Div. 1)

Div. 1 | 7 problems | 1/7 verified | Difficulty 1500-3500 | 35m 39s

#	Problem	Rating	Tags	Accepted	Time	✓
A	AquaMoon and Strange Sort	1500	sortings	14,880	6m 1s
B	AquaMoon and Chess	1900	combinatorics, math	6,761	4m 18s
C	AquaMoon and Permutations	2800	2-sat, brute-force, combinatorics	767	4m 36s
D	AquaMoon and Wrong Coordinate	3000	constructive-algorithms, interactive, math	606	5m 40s
E1	AquaMoon and Time Stop (easy version)	3500	data-structures, dp	100	6m 53s
E2	AquaMoon and Time Stop (hard version)	3500	data-structures, dp	100	5m 49s
F	AquaMoon and Potatoes	3500	brute-force, data-structures, dp	130	2m 22s	✓

Practice › Codeforces Solutions › Codeforces Round 732 (Div. 1) ›

CF 1545E1 - AquaMoon and Time Stop (easy version)

A single person moves deterministically along a number line: starting from position $x$ at time $0$, his position at time $t$ is exactly $x+t$.

Practice › Codeforces Solutions › Codeforces Round 732 (Div. 1) ›

CF 1545E2 - AquaMoon and Time Stop (hard version)

We are given a person who moves deterministically along a number line: starting at position $x$ at time $0$, and then increasing position by exactly one unit per second. So at time $t$, the person is at $x+t$.

Practice › Codeforces Solutions › Codeforces Round 732 (Div. 1) ›

CF 1545C - AquaMoon and Permutations

We are given $2n$ permutations of size $n$. Each row is a rearrangement of numbers $1$ to $n$. We are promised that there exists a hidden structure behind these rows: they originally came from two intertwined Latin squares of size $n$, but then the rows were shuffled.

Practice › Codeforces Solutions › Codeforces Round 732 (Div. 1) ›

CF 1545B - AquaMoon and Chess

We are given a binary string of length $n$, where each position either contains a pawn or is empty. The board is a line, and pawns can move only in a very constrained way: a pawn can “jump” two cells left or right, but only if the intermediate cell is occupied and the…

Practice › Codeforces Solutions › Codeforces Round 732 (Div. 1) ›

CF 1545F - AquaMoon and Potatoes

We are given three integer arrays a, b, c, each of length n. Array a represents a dynamic sequence that can be updated. Arrays b and c are fixed mappings that define relationships: b[x] gives a value associated with x from a, and c[x] gives another value associated with an index.

Practice › Codeforces Solutions › Codeforces Round 732 (Div. 1) ›

CF 1545D - AquaMoon and Wrong Coordinate

Codeforces 1545D: AquaMoon and Wrong Coordinate

Practice › Codeforces Solutions › Codeforces Round 732 (Div. 1) ›

CF 1545A - AquaMoon and Strange Sort

We are given a row of friends, each wearing a T-shirt with a number. Initially, all friends are facing right. AquaMoon can swap any two adjacent friends, and whenever she does, both friends flip their facing direction.