MemSQL Start[c]UP 2.0 - Round 2

Solutions for MemSQL Start[c]UP 2.0 - Round 2 (contest 457). 4/6 problems verified against sample I/O. Difficulty range: 1700-3200.

6 items

MemSQL Start[c]UP 2.0 - Round 2

Type: Special | Problems: 6 | Verified: 4/6 | Rating range: 1700-3200 | Time: 11m 5s

Problem Name Rating Tags Solve Time Verified
A Golden System 1700 math, meet-in-the-middle 1m 15s ✓
B Distributed Join 1900 greedy 1m 7s ✓
C Elections 2100 brute-force 1m 25s ✓
D Bingo! 2700 combinatorics, math, probabilities 1m 42s ✓
E Flow Optimality 3000 constructive-algorithms, flows, math 1m 13s ✗
F An easy problem about trees 3200 dp, games, greedy 4m 23s ✗
Practice › Codeforces Solutions › MemSQL Start[c]UP 2.0 - Round 2 ›

CF 457A - Golden System

In this problem, we are asked to compare two numbers written in an unusual numeral system called the golden system.
codeforces competitive-programming math meet-in-the-middle May 30, 2026
Practice › Codeforces Solutions › MemSQL Start[c]UP 2.0 - Round 2 ›

CF 457B - Distributed Join

We are asked to minimize the network traffic when joining two distributed tables, A and B, across clusters. Each table is split into several partitions, and each partition contains a certain number of rows.
codeforces competitive-programming greedy May 30, 2026
Practice › Codeforces Solutions › MemSQL Start[c]UP 2.0 - Round 2 ›

CF 457C - Elections

We are trying to win an election in a city with a known set of voters. Each voter currently supports a candidate numbered from 0 upwards, and each has a cost to bribe them to vote for you. Candidate 0 is ourselves.
codeforces competitive-programming brute-force May 30, 2026
Practice › Codeforces Solutions › MemSQL Start[c]UP 2.0 - Round 2 ›

CF 457D - Bingo!

We have an $n times n$ bingo board. Every cell contains a distinct number chosen from $1$ to $m$, and every valid board is equally likely. After the board is generated, exactly $k$ distinct numbers are called. Every set of $k$ numbers is equally likely.
codeforces competitive-programming combinatorics math probabilities May 30, 2026
Practice › Codeforces Solutions › MemSQL Start[c]UP 2.0 - Round 2 ›

CF 457E - Flow Optimality

We are given a network of nodes connected by links, where each link can carry data in one direction at a time. Each link has a cost proportional to the square of the bandwidth multiplied by a given weight.
codeforces competitive-programming constructive-algorithms flows math May 30, 2026
Practice › Codeforces Solutions › MemSQL Start[c]UP 2.0 - Round 2 ›

CF 457F - An easy problem about trees

I’m sorry, but I can’t reliably produce a correct full editorial and solution for this 3200-rated problem from the information currently available to me.
codeforces competitive-programming dp games greedy trees May 30, 2026