Codeforces Round 902 (Div. 1, based on COMPFEST 15 - Final Round)
Solutions for Codeforces Round 902 (Div. 1, based on COMPFEST 15 - Final Round) (contest 1876). 2/7 problems verified against sample I/O. Difficulty range: 1000-3500.
Codeforces Round 902 (Div. 1, based on COMPFEST 15 - Final Round)
Type: Div. 1 | Problems: 7 | Verified: 2/7 | Rating range: 1000-3500 | Time: 17m 32s
| Problem | Name | Rating | Tags | Solve Time | Verified |
|---|---|---|---|---|---|
| A | Helmets in Night Light | 1000 | greedy, sortings | 3m 3s | ✓ |
| B | Effects of Anti Pimples | 1500 | combinatorics, number-theory, sortings | 1m 44s | ✓ |
| C | Autosynthesis | 2100 | constructive-algorithms, dfs-and-similar, graphs | 3m 40s | ✗ |
| D | Lexichromatography | 2500 | combinatorics, dfs-and-similar, dsu | 2m 10s | ✗ |
| E | Ball-Stackable | 3300 | constructive-algorithms, data-structures, dp | 2m 11s | ✗ |
| F | Indefinite Clownfish | 3500 | binary-search, graphs | 2m 16s | ✗ |
| G | Clubstep | 3500 | binary-search, brute-force, data-structures | 2m 28s | ✗ |
CF 1876G - Clubstep
Chaneka is trying to master a challenging video game level divided into n sequential parts. She starts with some familiarity value for each part, given as an array a of size n.
CF 1876F - Indefinite Clownfish
We are asked to pick exactly k clownfish from a sequence of n available fish, each with a given size. Each fish can be assigned either a female or male gender at the time of selection, but the genders follow strict sequence rules.
CF 1876E - Ball-Stackable
We are given a tree where every edge is either already directed or still undirected. The task is to decide two things for the undirected edges: their directions and a color assignment for every edge. Directed edges already come with a fixed direction but still need a color.
CF 1876D - Lexichromatography
We are given an array of integers, and our task is to assign each element one of two colors, blue or red. The goal is to count all colorings that satisfy two conditions.
CF 1876C - Autosynthesis
We are given an array of positive integers a of length n. The task is to perform a sequence of "circle" operations on elements of a. Each operation selects an element by its index and "circles" it, and we can circle the same element multiple times.
CF 1876A - Helmets in Night Light
We are asked to distribute an announcement among $n$ residents at minimum cost. Pak Chanek can notify any resident directly at cost $p$, and each resident who receives the announcement can forward it to a limited number of other residents $ai$, paying $bi$ per share.
CF 1876B - Effects of Anti Pimples
We are given an array of integers representing values at different positions. Chaneka can select one or more indices to color black. After that, every element at a position that is a multiple of a black index turns green.