Codeforces Round 564 (Div. 1)

7 problems from Codeforces Round 564 (Div. 1) (contest 1172), difficulty 1800-3300. 3/7 solutions verified against sample I/O.

7 items

Codeforces Round 564 (Div. 1)

Div. 1 | 7 problems | 3/7 verified | Difficulty 1800-3300 | 41m 7s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Nauuo and Cards	1800	greedy, implementation	5,175	7m 25s	✓
B	Nauuo and Circle	1900	combinatorics, dfs-and-similar, dp	4,404	1m 31s	✓
C1	Nauuo and Pictures (easy version)	2300	dp, probabilities	1,225	6m 32s	✓
C2	Nauuo and Pictures (hard version)	2600	dp, probabilities	995	4m 21s
D	Nauuo and Portals	2900	constructive-algorithms	699	7m 28s
E	Nauuo and ODT	3300	data-structures	357	7m 16s
F	Nauuo and Bug	3300	data-structures	594	6m 34s

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

CF 1172F - Nauuo and Bug

We are given a static array of integers and a parameter $p$. There is a peculiar addition routine used inside a hidden implementation: it adds numbers left to right, but after each addition it performs a conditional correction.

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

CF 1172E - Nauuo and ODT

The input describes a tree where each node carries a color label. What we are asked to compute is not about a single path, but about all simple paths between ordered pairs of distinct nodes.

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

CF 1172D - Nauuo and Portals

We are given an $n times n$ grid where movement is deterministic. From any cell, a traveller moves in a fixed direction until something changes that flow.

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

CF 1172A - Nauuo and Cards

We are given a system split into two parts: a hand of cards and a pile of cards. Together they contain every integer card from 1 to n exactly once, while zeros represent empty placeholders that behave like dummy cards with no value.

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

CF 1172C2 - Nauuo and Pictures (hard version)

We are given a collection of pictures, each with a positive weight. These weights determine how likely each picture is shown when Nauuo visits the website: a picture is selected with probability proportional to its current weight, so picture $i$ is chosen with probability $wi…

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

CF 1172C1 - Nauuo and Pictures (easy version)

We are working with a system of pictures where each picture has a weight that controls how likely it is to be shown when we visit a website. At any moment, the probability of seeing picture $i$ is its weight divided by the total weight of all pictures.

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

CF 1172B - Nauuo and Circle

We are asked to count how many ways we can place the nodes of a given tree around a circle such that the edges, drawn as straight lines between nodes, do not cross. The tree has n nodes labeled from 1 to n, and n-1 edges connecting them.