MemSQL start[c]up Round 1

5 problems from MemSQL start[c]up Round 1 (contest 325), difficulty 1500-2900. 3/5 solutions verified against sample I/O.

5 items

MemSQL start[c]up Round 1

Special | 5 problems | 3/5 verified | Difficulty 1500-2900 | 11m 24s

# Problem Rating Tags Accepted Time ✓
A Square and Rectangles 1500 implementation 2,301 4m 20s ✓
B Stadium and Games 1800 binary-search, math 1,674 1m 50s ✓
C Monsters and Diamonds 2600 dfs-and-similar, graphs, shortest-paths 448 2m 46s
D Reclamation 2900 dsu 579 1m 30s
E The Red Button 2800 combinatorics, dfs-and-similar, dsu 949 58s ✓
Practice › Codeforces Solutions › MemSQL start[c]up Round 1 ›

CF 325D - Reclamation

We are asked to simulate a process of turning cells in a cylindrical grid from sea into land, one by one, while ensuring that a sea path connecting the top row to the bottom row always exists.
codeforces competitive-programming dsu Jun 6, 2026
Practice › Codeforces Solutions › MemSQL start[c]up Round 1 ›

CF 325B - Stadium and Games

We are given the exact number of football games that must be played, and we need to find every possible initial number of teams that produces exactly that many games under a specific tournament format.
codeforces competitive-programming binary-search math Jun 6, 2026
Practice › Codeforces Solutions › MemSQL start[c]up Round 1 ›

CF 325E - The Red Button

We are asked to find a sequence of node disarmaments for a circular system of size n where node 0 is special. Node 0 must appear twice: first at the start and last at the end. Every other node must appear exactly once.
codeforces competitive-programming combinatorics dfs-and-similar dsu graphs greedy Jun 6, 2026
Practice › Codeforces Solutions › MemSQL start[c]up Round 1 ›

CF 325C - Monsters and Diamonds

Each monster type has one or more split rules. Applying a rule consumes one monster of that type and produces two things: First, some number of diamonds. Second, a multiset of new monsters.
codeforces competitive-programming dfs-and-similar graphs shortest-paths Jun 6, 2026
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.
codeforces competitive-programming implementation May 29, 2026