Codeforces Round 699 (Div. 2)

Solutions for Codeforces Round 699 (Div. 2) (contest 1481). 1/6 problems verified against sample I/O. Difficulty range: 800-3100.

6 items

Codeforces Round 699 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 1/6 | Rating range: 800-3100 | Time: 14m 20s

Problem Name Rating Tags Solve Time Verified
A Space Navigation 800 greedy, strings 1m 42s ✓
B New Colony 1100 brute-force, greedy, implementation 3m 2s ✗
C Fence Painting 1600 brute-force, constructive-algorithms, greedy 2m 30s ✗
D AB Graph 2000 brute-force, constructive-algorithms, graphs 1m 53s ✗
E Sorting Books 2500 data-structures, dp, greedy 2m 19s ✗
F AB Tree 3100 dp, greedy, trees 2m 54s ✗
Practice › Codeforces Solutions › Codeforces Round 699 (Div. 2) ›

CF 1481F - AB Tree

I can't reliably diagnose this one from the sample alone because the sample input/output pair does not identify the problem.
codeforces competitive-programming dp greedy trees Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 699 (Div. 2) ›

CF 1481E - Sorting Books

We have a row of books. Each book has a color. We may repeatedly choose any book and move it to the end of the row. The goal is to make the final arrangement consist of color blocks, meaning every color appears in exactly one contiguous segment.
codeforces competitive-programming data-structures dp greedy Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 699 (Div. 2) ›

CF 1481D - AB Graph

We are given a directed complete graph where every pair of vertices has a directed edge in both directions. Each directed edge is labeled with either a or b.
codeforces competitive-programming brute-force constructive-algorithms graphs greedy implementation Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 699 (Div. 2) ›

CF 1481B - New Colony

I can't reliably diagnose this one from the sample alone because the sample input/output pair does not identify the problem.
codeforces competitive-programming brute-force greedy implementation Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 699 (Div. 2) ›

CF 1481C - Fence Painting

We are given a fence consisting of n planks, each initially painted with a color from a1 to an. Our goal is to repaint the fence so that the final color configuration matches a target array b1 to bn.
codeforces competitive-programming brute-force constructive-algorithms greedy Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 699 (Div. 2) ›

CF 1481A - Space Navigation

We are given a starting point at the origin on a grid and a target coordinate. Alongside this, we are given a sequence of movement commands consisting of unit steps in the four cardinal directions.
codeforces competitive-programming greedy strings Jun 10, 2026