Codeforces Round 554 (Div. 2)

Solutions for Codeforces Round 554 (Div. 2) (contest 1152). 4/7 problems verified against sample I/O. Difficulty range: 800-3000.

7 items

Codeforces Round 554 (Div. 2)

Type: Div. 2 | Problems: 7 | Verified: 4/7 | Rating range: 800-3000 | Time: 12m 11s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Neko Finds Grapes	800	greedy, implementation, math	1m 24s	✓
B	Neko Performs Cat Furrier Transform	1300	bitmasks, constructive-algorithms, dfs-and-similar	1m 43s	✗
C	Neko does Maths	1800	brute-force, math, number-theory	3m 35s	✓
D	Neko and Aki's Prank	2100	dp, greedy, trees	1m 37s	✓
E	Neko and Flashback	2400	constructive-algorithms, dfs-and-similar, graphs	53s	✗
F1	Neko Rules the Catniverse (Small Version)	2800	bitmasks, dp, matrices	58s	✓
F2	Neko Rules the Catniverse (Large Version)	3000	bitmasks, dp, matrices	2m 1s	✗

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

CF 1152F2 - Neko Rules the Catniverse (Large Version)

We are asked to count sequences of planet visits with strong structural constraints. A path starts at any planet from 1 to n, and then performs exactly k − 1 moves.

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

CF 1152F1 - Neko Rules the Catniverse (Small Version)

We are asked to count ordered sequences of distinct planets visited by a character who starts on any planet and then makes exactly $k-1$ moves.

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

CF 1152C - Neko does Maths

We are given two starting integers. From both numbers, we are allowed to shift them upward by the same non-negative amount $k$, producing the pair $a+k$ and $b+k$. For each such shift, we can compute the least common multiple of the two resulting numbers.

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

CF 1152D - Neko and Aki's Prank

The problem describes a full trie built from all correct bracket sequences of length $2n$. Every node in this trie corresponds to a prefix of some valid sequence, and edges correspond to appending either an opening or closing bracket while maintaining validity.

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

CF 1152E - Neko and Flashback

The task is to reconstruct an array of positive integers, a, given two arrays b' and c'. These arrays were generated from a through two stages: first, by taking all consecutive pairs in a to form b and c, where each bi is the minimum and each ci is the maximum of the pair (ai…

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

CF 1152B - Neko Performs Cat Furrier Transform

We are given a positive integer x representing the "number" of a cat. Our goal is to transform x into a number of the form 2^m - 1 for some non-negative integer m. These numbers in binary consist entirely of 1s, such as 0 (empty longcat), 1, 3, 7, 15, and so on.

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

CF 1152A - Neko Finds Grapes

We are given a collection of treasure chests and a collection of keys. Each chest has a number written on it and each key also has a number written on it. A key can open a chest only when the sum of their numbers is odd.