MemSQL start[c]up Round 2 - online version

Solutions for MemSQL start[c]up Round 2 - online version (contest 335). 1/3 problems verified against sample I/O. Difficulty range: 1900-2800.

3 items

MemSQL start[c]up Round 2 - online version

Type: Special | Problems: 3 | Verified: 1/3 | Rating range: 1900-2800 | Time: 8m 55s

Problem	Name	Rating	Tags	Solve Time	Verified
B	Palindrome	1900	constructive-algorithms, dp	2m 24s	✗
D	Rectangles and Square	2400	brute-force, dp	3m 41s	✓
E	Counting Skyscrapers	2800	dp, math, probabilities	2m 50s	✗

Practice › Codeforces Solutions › MemSQL start[c]up Round 2 - online version ›

CF 335B - Palindrome

We are given a lowercase string and asked to extract a palindromic subsequence from it. A subsequence keeps the original order of characters but may skip positions. The output requirement has a twist.

Practice › Codeforces Solutions › MemSQL start[c]up Round 2 - online version ›

CF 335D - Rectangles and Square

We are given up to one hundred thousand axis-aligned rectangles on a plane. Rectangles never overlap in their interiors, although touching at borders is allowed.

Practice › Codeforces Solutions › MemSQL start[c]up Round 2 - online version ›

CF 335E - Counting Skyscrapers

We have a sequence of skyscrapers, each with a height chosen randomly and independently according to a geometric distribution where floor i exists with probability 2⁻ⁱ. The number of skyscrapers is unknown, but uniformly distributed between 2 and 314!.