MemSQL Start[c]UP 2.0 - Round 1

Solutions for MemSQL Start[c]UP 2.0 - Round 1 (contest 452). 4/5 problems verified against sample I/O. Difficulty range: 1000-2700.

5 items

MemSQL Start[c]UP 2.0 - Round 1

Type: Special | Problems: 5 | Verified: 4/5 | Rating range: 1000-2700 | Time: 9m 36s

Problem Name Rating Tags Solve Time Verified
A Eevee 1000 brute-force, implementation, strings 1m 6s ✓
B 4-point polyline 1800 brute-force, constructive-algorithms, geometry 2m 2s ✓
C Magic Trick 2100 combinatorics, math, probabilities 1m 44s ✓
E Three strings 2400 data-structures, dsu, string-suffix-structures 2m 7s ✓
F Permutation 2700 data-structures, divide-and-conquer, hashing 2m 37s ✗
Practice › Codeforces Solutions › MemSQL Start[c]UP 2.0 - Round 1 ›

CF 452A - Eevee

We are given a partially filled crossword slot and asked to identify which of Eevee's evolutions fits it. The input specifies the length of the word and a string pattern using lowercase letters and dots, where a dot represents an unknown character.
codeforces competitive-programming brute-force implementation strings May 30, 2026
Practice › Codeforces Solutions › MemSQL Start[c]UP 2.0 - Round 1 ›

CF 452B - 4-point polyline

We have all lattice points inside and on the boundary of an axis-aligned rectangle whose opposite corners are (0, 0) and (n, m). The task is to choose four distinct lattice points and connect them in the chosen order.
codeforces competitive-programming brute-force constructive-algorithms geometry trees May 30, 2026
Practice › Codeforces Solutions › MemSQL Start[c]UP 2.0 - Round 1 ›

CF 452C - Magic Trick

There are $m$ complete decks, each containing the same $n$ card values. After mixing all decks together, there are $mn$ physical cards in total, and every value appears exactly $m$ times.
codeforces competitive-programming combinatorics math probabilities May 30, 2026
Practice › Codeforces Solutions › MemSQL Start[c]UP 2.0 - Round 1 ›

CF 452E - Three strings

We have three strings. For every length $l$ from $1$ up to the length of the shortest string, we must count how many triples of positions $$(i1,i2,i3)$$ produce three equal substrings of length $l$, one taken from each string.
codeforces competitive-programming data-structures dsu string-suffix-structures strings May 30, 2026
Practice › Codeforces Solutions › MemSQL Start[c]UP 2.0 - Round 1 ›

CF 452F - Permutation

The permutation contains every value from 1 to n exactly once. We need to determine whether there exist two distinct values a and b such that their arithmetic mean $$frac{a+b}{2}$$ appears somewhere between them in the permutation order.
codeforces competitive-programming data-structures divide-and-conquer hashing May 30, 2026