MemSQL Start[c]UP 2.0 - Round 1

6 problems from MemSQL Start[c]UP 2.0 - Round 1 (contest 452), difficulty 1000-2700. 6/6 solutions verified against sample I/O.

6 items

MemSQL Start[c]UP 2.0 - Round 1

Special | 6 problems | 6/6 verified | Difficulty 1000-2700 | 11m 45s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Eevee	1000	brute-force, implementation, strings	8,513	1m 6s	✓
B	4-point polyline	1800	brute-force, constructive-algorithms, geometry	2,117	2m 2s	✓
C	Magic Trick	2100	combinatorics, math, probabilities	1,750	1m 44s	✓
D	Washer, Dryer, Folder	1900	greedy, implementation	1,666	1m 52s	✓
E	Three strings	2400	data-structures, dsu, string-suffix-structures	1,197	2m 7s	✓
F	Permutation	2700	data-structures, divide-and-conquer, hashing	1,794	2m 54s	✓

Practice › Codeforces Solutions › MemSQL Start[c]UP 2.0 - Round 1 ›

CF 452F - Permutation

We are given a permutation of the numbers 1...n. For two distinct values a and b, their average is (a+b)/2. Since the permutation contains every integer exactly once, this average is also present whenever a+b is even.

Practice › Codeforces Solutions › MemSQL Start[c]UP 2.0 - Round 1 ›

CF 452D - Washer, Dryer, Folder

We have a three-stage production pipeline. Every laundry item must first be washed, then immediately transferred to a dryer when washing finishes, then immediately transferred to a folding machine when drying finishes.

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.

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.

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.

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.