Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round)
Solutions for Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round) (contest 2021). 2/8 problems verified against sample I/O. Difficulty range: 800-2800.
Codeforces Round 977 (Div. 2, based on COMPFEST 16 - Final Round)
Type: Div. 2 | Problems: 8 | Verified: 2/8 | Rating range: 800-2800 | Time: 12m 10s
| Problem | Name | Rating | Tags | Solve Time | Verified |
|---|---|---|---|---|---|
| A | Meaning Mean | 800 | data-structures, greedy, math | 1m 22s | ✓ |
| B | Maximize Mex | 1200 | brute-force, greedy, math | 39s | ✗ |
| C1 | Adjust The Presentation (Easy Version) | 1300 | constructive-algorithms, greedy | 1m 31s | ✗ |
| C2 | Adjust The Presentation (Hard Version) | 1900 | constructive-algorithms, data-structures, greedy | 57s | ✗ |
| D | Boss, Thirsty | 2500 | dp, greedy, implementation | 1m 40s | ✗ |
| E1 | Digital Village (Easy Version) | 2300 | brute-force, data-structures, dfs-and-similar | 2m 17s | ✓ |
| E2 | Digital Village (Hard Version) | 2500 | data-structures, dp, dsu | 1m 56s | ✗ |
| E3 | Digital Village (Extreme Version) | 2800 | data-structures, dfs-and-similar, dp | 1m 48s | ✗ |
CF 2021E3 - Digital Village (Extreme Version)
We are given a connected village represented as a graph. Each node is a house, and edges are internet cables with a latency weight. Some subset of houses specifically need internet.
CF 2021E1 - Digital Village (Easy Version)
In this problem, we are given a village represented as a connected graph with houses as nodes and internet cables as edges. Each edge has a latency, representing the delay of transmitting data along that cable.
CF 2021E2 - Digital Village (Hard Version)
We are given a connected undirected graph representing a village, where nodes are houses and edges are internet cables with latencies. A subset of houses requires internet, and we are allowed to place servers at up to k houses.
CF 2021D - Boss, Thirsty
We are asked to plan drink sales over several days in a canteen. Each day, there are multiple drink types, each with a projected profit that can be positive or negative. On any day, we must select a contiguous segment of drink types to sell.
CF 2021C2 - Adjust The Presentation (Hard Version)
We have a fixed permutation a describing the initial order of team members in a line. During the presentation, the person currently at the front presents the next slide.
CF 2021C1 - Adjust The Presentation (Easy Version)
We are given an initial lineup of people, where each person appears exactly once. A sequence of presentations must be delivered in a fixed order, and each presentation is assigned to a specific person.
CF 2021A - Meaning Mean
We are given an array of positive integers and a process that repeatedly combines two elements into a single new element: we pick two distinct elements, compute the floor of their average, remove the original two, and append the new number.
CF 2021B - Maximize Mex
We start with an array of non-negative integers. The only operation allowed is to pick an element and add x to it. We may repeat this operation any number of times on any element. Adding x repeatedly has a very specific effect.