Codeforces Round 513 by Barcelona Bootcamp (rated, Div. 1 + Div. 2)
8 problems from Codeforces Round 513 by Barcelona Bootcamp (rated, Div. 1 + Div. 2) (contest 1060), difficulty 800-3400. 4/8 solutions verified against sample I/O.
Codeforces Round 513 by Barcelona Bootcamp (rated, Div. 1 + Div. 2)
Div. 1+2 | 8 problems | 4/8 verified | Difficulty 800-3400 | 54m 21s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Phone Numbers | 800 | brute-force | 15,712 | 4m 44s | ✓ |
| B | Maximum Sum of Digits | 1100 | greedy | 9,496 | 10m 49s | ✓ |
| C | Maximum Subrectangle | 1600 | binary-search, implementation, two-pointers | 5,209 | 4m 48s | ✓ |
| D | Social Circles | 1900 | greedy, math | 3,874 | 6m 2s | |
| E | Sergey and Subway | 2000 | dfs-and-similar, dp, trees | 3,496 | 6m 55s | |
| F | Shrinking Tree | 2900 | combinatorics, dp | 787 | 4m 9s | |
| G | Balls and Pockets | 3400 | data-structures | 259 | 15m 10s | |
| H | Sophisticated Device | 3300 | constructive-algorithms | 245 | 1m 44s | ✓ |
CF 1060G - Balls and Pockets
We are given an infinite line of positions starting from zero. Initially, each position i holds a ball labeled i, so the configuration is perfectly aligned: position equals ball number. Some positions are marked as pockets.
CF 1060F - Shrinking Tree
We are given a tree with up to 50 vertices, and we repeatedly compress it until only one vertex remains. Each operation picks an edge uniformly at random. The two endpoints of that edge disappear, and they are replaced by a single merged vertex.
CF 1060H - Sophisticated Device
We are working in a very unusual computational model: instead of directly manipulating variables, we interact with an array of hidden memory cells. Only two of them initially contain unknown values, while all others are initialized to one.
CF 1060E - Sergey and Subway
We start with a tree of subway stations. Every station is a node, and every tunnel is an edge, so there is exactly one simple path between any two stations.
CF 1060B - Maximum Sum of Digits
We are given a single large integer $n$, and we want to split it into two non-negative integers $a$ and $b$ such that their sum stays exactly $n$.
CF 1060D - Social Circles
We are given several guests, and each guest has a personal requirement about how they sit in a circular arrangement.
CF 1060C - Maximum Subrectangle
The matrix in this problem is not given explicitly. Instead, every cell is formed by multiplying an element from array a with an element from array b. This creates a grid where each row is a scaled version of b, and each column is a scaled version of a.
CF 1060A - Phone Numbers
We are given a multiset of digit cards, each card containing a single character from 0 to 9. From these cards, we want to assemble as many valid phone numbers as possible.