Codeforces Round 789 (Div. 1)

Solutions for Codeforces Round 789 (Div. 1) (contest 1677). 1/6 problems verified against sample I/O. Difficulty range: 1600-3500.

6 items

Codeforces Round 789 (Div. 1)

Type: Div. 1 | Problems: 6 | Verified: 1/6 | Rating range: 1600-3500 | Time: 18m 49s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Tokitsukaze and Strange Inequality	1600	brute-force, data-structures, dp	1m 34s	✓
B	Tokitsukaze and Meeting	1700	data-structures, implementation, math	9m 9s	✗
C	Tokitsukaze and Two Colorful Tapes	1900	constructive-algorithms, dfs-and-similar, graphs	1m 55s	✗
D	Tokitsukaze and Permutations	2500	dp, math	2m 11s	✗
E	Tokitsukaze and Beautiful Subsegments	2900	data-structures	1m 47s	✗
F	Tokitsukaze and Gems	3500	dp, math	2m 13s	✗

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

CF 1677B - Tokitsukaze and Meeting

We are asked to simulate a dynamic seating scenario. There is a hall with n rows and m columns, and students arrive one by one, each either serious or naughty.

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

CF 1677F - Tokitsukaze and Gems

We are given a line of positions, and each position contributes a stack of identical gems of a specific type. Position i holds ai gems of type i.

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

CF 1677D - Tokitsukaze and Permutations

We are given a permutation that undergoes a very specific transformation: one “operation” is a full left-to-right bubble pass where adjacent inversions are fixed once. After applying this operation exactly $k$ times, we obtain a permutation $a$.

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

CF 1677E - Tokitsukaze and Beautiful Subsegments

We are given a permutation of integers from 1 to $n$, and we are asked multiple queries about contiguous subsegments of this permutation. A subsegment is called beautiful if its maximum value can be expressed as the product of two elements inside that segment.

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

CF 1677C - Tokitsukaze and Two Colorful Tapes

Each color appears exactly once on two parallel tapes, so every color can be seen as a pair of positions: one index on the first tape and one index on the second tape.

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

CF 1677A - Tokitsukaze and Strange Inequality

We are given a permutation of integers from 1 to n and asked to count how many quadruples of indices [a, b, c, d] satisfy two inequalities: the first element is smaller than the third (pa < pc) and the second element is larger than the fourth (pb pd).