MemSQL start[c]up Round 2 - online version

6 problems from MemSQL start[c]up Round 2 - online version (contest 335), difficulty 1400-3000. 1/6 solutions verified against sample I/O.

6 items

MemSQL start[c]up Round 2 - online version

Special | 6 problems | 1/6 verified | Difficulty 1400-3000 | 10m 58s

# Problem Rating Tags Accepted Time ✓
A Banana 1400 binary-search, constructive-algorithms, greedy 2,846 2m 1s ✓
B Palindrome 1900 constructive-algorithms, dp 2,373 1m 45s
C More Reclamation 2100 games 603 1m 53s
D Rectangles and Square 2400 brute-force, dp 350 1m 42s
E Counting Skyscrapers 2800 dp, math, probabilities 241 1m 44s
F Buy One, Get One Free 3000 dp, greedy 740 1m 53s
Practice › Codeforces Solutions › MemSQL start[c]up Round 2 - online version ›

CF 335C - More Reclamation

We are dealing with a two-column grid of arbitrary height r, where each cell initially represents water. Two cities take turns reclaiming cells to turn them into land, but there is a restriction: reclaiming a cell blocks the three neighboring cells in the opposite column from…
codeforces competitive-programming games Jun 6, 2026
Practice › Codeforces Solutions › MemSQL start[c]up Round 2 - online version ›

CF 335B - Palindrome

We are given a single string made of lowercase letters. From this string, we are allowed to delete characters while keeping the remaining characters in order, and we are interested only in the resulting subsequences that are palindromes. The task is twofold.
codeforces competitive-programming constructive-algorithms dp Jun 6, 2026
Practice › Codeforces Solutions › MemSQL start[c]up Round 2 - online version ›

CF 335F - Buy One, Get One Free

We are given a list of pies with positive prices and a store promotion: for each pie you pay full price for, you can take another pie that is strictly cheaper for free. The goal is to determine the minimum total amount you must spend to acquire all pies.
codeforces competitive-programming dp greedy Jun 6, 2026
Practice › Codeforces Solutions › MemSQL start[c]up Round 2 - online version ›

CF 335E - Counting Skyscrapers

We are asked to relate two counting schemes over a sequence of randomly sized skyscrapers. Imagine a row of skyscrapers with random heights, where the height of each building follows a geometric distribution with probability $2^{-i}$ for height $i$.
codeforces competitive-programming dp math probabilities Jun 6, 2026
Practice › Codeforces Solutions › MemSQL start[c]up Round 2 - online version ›

CF 335D - Rectangles and Square

We are given a collection of axis-aligned rectangles with integer coordinates, and we are allowed to pick any subset of them.
codeforces competitive-programming brute-force dp Jun 6, 2026
Practice › Codeforces Solutions › MemSQL start[c]up Round 2 - online version ›

CF 335A - Banana

We are asked to help Piegirl buy sheets of stickers to construct a target string s. Each sheet contains exactly n stickers, and all stickers on a sheet are predetermined by the string we choose for that sheet.
codeforces competitive-programming binary-search constructive-algorithms greedy Jun 6, 2026