MemSQL start[c]up Round 1

Solutions for MemSQL start[c]up Round 1 (contest 325). 2/2 problems verified against sample I/O. Difficulty range: 1500-2800.

2 items

MemSQL start[c]up Round 1

Type: Special | Problems: 2 | Verified: 2/2 | Rating range: 1500-2800 | Time: 6m 17s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Square and Rectangles	1500	implementation	4m 20s	✓
E	The Red Button	2800	combinatorics, dfs-and-similar, dsu	1m 57s	✓

Practice › Codeforces Solutions › MemSQL start[c]up Round 1 ›

CF 325A - Square and Rectangles

We are given up to five axis-aligned rectangles on a plane. Each rectangle is defined by its bottom-left and top-right coordinates. No two rectangles overlap, although they may touch at edges or corners.

Practice › Codeforces Solutions › MemSQL start[c]up Round 1 ›

CF 325E - The Red Button

We are asked to construct a walk on a directed functional graph defined by a very specific transition rule. Each state is a node from 0 to n − 1. From a current node i, the next state is not arbitrary: it must be either 2i mod n or (2i + 1) mod n.