Codeforces Round 527 (Div. 3)

Solutions for Codeforces Round 527 (Div. 3) (contest 1092). 4/7 problems verified against sample I/O. Difficulty range: 800-2200.

7 items

Codeforces Round 527 (Div. 3)

Type: Div. 3 | Problems: 7 | Verified: 4/7 | Rating range: 800-2200 | Time: 36m 33s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Uniform String	800	implementation	9m 46s	✗
B	Teams Forming	800	sortings	2m 51s	✓
C	Prefixes and Suffixes	1700	strings	2m 57s	✓
D1	Great Vova Wall (Version 1)	2200	greedy, implementation, math	4m 20s	✓
D2	Great Vova Wall (Version 2)	2200	data-structures, implementation	3m 38s	✓
E	Minimal Diameter Forest	2000	constructive-algorithms, dfs-and-similar, greedy	5m 14s	✗
F	Tree with Maximum Cost	1900	dfs-and-similar, dp, trees	7m 47s	✗

Practice › Codeforces Solutions › Codeforces Round 527 (Div. 3) ›

CF 1092F - Tree with Maximum Cost

We are given a weighted tree, where each node carries a positive value. We are allowed to choose any node as a reference point, and for that choice we compute a score defined as the sum over all nodes of their value multiplied by their distance to the chosen node.

Practice › Codeforces Solutions › Codeforces Round 527 (Div. 3) ›

CF 1092E - Minimal Diameter Forest

We are given a graph that is already a forest, meaning it consists of several disconnected trees. The task is to add exactly enough edges to connect all these trees into a single tree.

Practice › Codeforces Solutions › Codeforces Round 527 (Div. 3) ›

CF 1092A - Uniform String

We are asked to construct a string for each query such that the string has a fixed length n and uses only the first k lowercase Latin letters, from 'a' up to the k-th letter. Every one of these k letters must appear at least once in the final string.

Practice › Codeforces Solutions › Codeforces Round 527 (Div. 3) ›

CF 1092D1 - Great Vova Wall (Version 1)

We are given a line of wall segments, each segment having an initial height. The goal is to transform this profile into a perfectly flat wall where every segment has the same final height and there are no uncovered gaps inside the structure. Two operations are allowed.

Practice › Codeforces Solutions › Codeforces Round 527 (Div. 3) ›

CF 1092D2 - Great Vova Wall (Version 2)

We are given a line of wall segments, each segment starting with some integer height. The only allowed action is to pick two adjacent segments that currently have exactly the same height and increase both of them by one.

Practice › Codeforces Solutions › Codeforces Round 527 (Div. 3) ›

CF 1092C - Prefixes and Suffixes

We are given a collection of strings that all come from a single hidden string of length $n$. From that hidden string, every proper prefix and every proper suffix was taken, so for each length from $1$ to $n-1$ there are exactly two strings: one prefix and one suffix, but they…

Practice › Codeforces Solutions › Codeforces Round 527 (Div. 3) ›

CF 1092B - Teams Forming

We are given an array of integers representing the skill levels of students. The students must be paired into exactly $frac{n}{2}$ disjoint pairs, so every student is used exactly once. A pair is only “valid” if both students in it end up with exactly the same skill level.