Codeforces Round 519 by Botan Investments

7 problems from Codeforces Round 519 by Botan Investments (contest 1043), difficulty 800-3500. 5/7 solutions verified against sample I/O.

7 items

Codeforces Round 519 by Botan Investments

Special | 7 problems | 5/7 verified | Difficulty 800-3500 | 29m 20s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Elections	800	implementation, math	11,279	3m 25s	✓
B	Lost Array	1200	implementation	6,551	3m 43s	✓
C	Smallest Word	1500	constructive-algorithms, greedy, implementation	7,221	4m 31s
D	Mysterious Crime	1700	brute-force, combinatorics, math	4,761	4m 37s	✓
E	Train Hard, Win Easy	1900	constructive-algorithms, greedy, math	3,461	4m 14s	✓
F	Make It One	2500	bitmasks, combinatorics, dp	2,993	1m 55s	✓
G	Speckled Band	3500	data-structures, divide-and-conquer, hashing	323	6m 55s

Practice › Codeforces Solutions › Codeforces Round 519 by Botan Investments ›

CF 1043G - Speckled Band

We are given a long string and many queries, each asking about a substring. For each substring, we imagine splitting it into several consecutive pieces. Among those pieces, identical pieces are considered the same “band”.

Practice › Codeforces Solutions › Codeforces Round 519 by Botan Investments ›

CF 1043D - Mysterious Crime

We are given several different observations of the same set of people, each observation being a full ordering of the same $n$ elements.

Practice › Codeforces Solutions › Codeforces Round 519 by Botan Investments ›

CF 1043E - Train Hard, Win Easy

We are given a set of participants, each described by two numbers. These two numbers represent how much penalty a participant contributes depending on whether they solve the first task or the second task in a two-person training contest.

Practice › Codeforces Solutions › Codeforces Round 519 by Botan Investments ›

CF 1043F - Make It One

We are given a multiset of positive integers, and we are allowed to choose any subset of these numbers. For a chosen subset, we compute the greatest common divisor of all selected elements.

Practice › Codeforces Solutions › Codeforces Round 519 by Botan Investments ›

CF 1043C - Smallest Word

We are given a binary string consisting only of characters a and b. We process its prefixes from left to right in a fixed order, meaning we first decide what to do with the prefix of length 1, then length 2, and so on until the full string.

Practice › Codeforces Solutions › Codeforces Round 519 by Botan Investments ›

CF 1043B - Lost Array

We are given a sequence of prefix values a[0], a[1], ..., a[n] where a[0] = 0. The sequence was originally generated from a hidden array x of length k, but that array is no longer available.

Practice › Codeforces Solutions › Codeforces Round 519 by Botan Investments ›

CF 1043A - Elections

Each student in the school is forced to distribute a fixed number of votes, denoted by $k$, between two candidates. For every student, we are given how many votes they intend to give to Elodreip.