Codeforces Round 607 (Div. 1)

6 problems from Codeforces Round 607 (Div. 1) (contest 1280), difficulty 1700-3400. 2/6 solutions verified against sample I/O.

6 items

Codeforces Round 607 (Div. 1)

Div. 1 | 6 problems | 2/6 verified | Difficulty 1700-3400 | 35m 2s

# Problem Rating Tags Accepted Time ✓
A Cut and Paste 1700 implementation, math 5,842 2m 8s ✓
B Beingawesomeism 1800 implementation, math 4,203 6m 37s
C Jeremy Bearimy 2000 dfs-and-similar, graphs, greedy 3,038 11m 16s
D Miss Punyverse 2500 dp, greedy, trees 1,230 6m 38s
E Kirchhoff's Current Loss 2900 math 229 5m 37s
F Intergalactic Sliding Puzzle 3400 combinatorics, constructive-algorithms, math 107 2m 46s ✓
Practice › Codeforces Solutions › Codeforces Round 607 (Div. 1) ›

CF 1280E - Kirchhoff's Current Loss

The circuit is given as a fully parenthesized expression that builds a tree of components. Leaves are individual resistors, each represented by . Internal nodes are either series connections or parallel connections over two or more subcircuits.
codeforces competitive-programming math Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Round 607 (Div. 1) ›

CF 1280C - Jeremy Bearimy

We are given a weighted tree with $2k$ vertices. On these vertices we must place $2k$ people, where the people are grouped into $k$ fixed pairs.
codeforces competitive-programming dfs-and-similar graphs greedy trees Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Round 607 (Div. 1) ›

CF 1280D - Miss Punyverse

We are given a tree where each node represents a “nesting place” that contains two types of insects: bees and wasps. Every insect votes for its own side, so bees always contribute to the bee count of a region and wasps always contribute to the wasp count.
codeforces competitive-programming dp greedy trees Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Round 607 (Div. 1) ›

CF 1280B - Beingawesomeism

We are given a grid of size $r times c$, where each cell is either $A$ or $P$. The goal is to convert every $P$ into $A$ using a special operation that behaves like a directional flood from a chosen line segment.
codeforces competitive-programming implementation math Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Round 607 (Div. 1) ›

CF 1280F - Intergalactic Sliding Puzzle

We are asked to rearrange a scrambled 2-row grid of alien organs into a prescribed order. The grid has dimensions 2 × (2k + 1) with 4k + 1 organs numbered 1 through 4k + 1 and exactly one empty cell.
codeforces competitive-programming combinatorics constructive-algorithms math Jun 11, 2026
Practice › Codeforces Solutions › Codeforces Round 607 (Div. 1) ›

CF 1280A - Cut and Paste

The process starts with a short string made only of digits 1, 2, and 3. Alongside this string, we maintain a cursor that moves from left to right over positions between characters, and a clipboard that can store a copied suffix of the string.
codeforces competitive-programming implementation math Jun 11, 2026