Codeforces Round 498 (Div. 3)

6 problems from Codeforces Round 498 (Div. 3) (contest 1006), difficulty 800-2100. 4/6 solutions verified against sample I/O.

6 items

Codeforces Round 498 (Div. 3)

Div. 3 | 6 problems | 4/6 verified | Difficulty 800-2100 | 9m 42s

# Problem Rating Tags Accepted Time ✓
A Adjacent Replacements 800 implementation 22,872 1m 42s ✓
B Polycarp's Practice 1200 greedy, implementation, sortings 14,655 1m 47s
C Three Parts of the Array 1200 binary-search, data-structures, two-pointers 25,307 1m 13s ✓
D Two Strings Swaps 1700 implementation 6,477 1m 39s
E Military Problem 1600 dfs-and-similar, graphs, trees 11,623 1m 26s ✓
F Xor-Paths 2100 bitmasks, brute-force, dp 6,884 1m 55s ✓
Practice › Codeforces Solutions › Codeforces Round 498 (Div. 3) ›

CF 1006F - Xor-Paths

We are given a rectangular grid where each cell contains a non-negative integer. A path starts at the top-left cell and moves only right or down until it reaches the bottom-right cell.
codeforces competitive-programming bitmasks brute-force dp meet-in-the-middle Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Round 498 (Div. 3) ›

CF 1006E - Military Problem

We are given a rooted tree of officers where each officer has a unique direct superior except the root officer 1. This creates a hierarchy where every node represents an officer and edges point from superior to subordinate.
codeforces competitive-programming dfs-and-similar graphs trees Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Round 498 (Div. 3) ›

CF 1006D - Two Strings Swaps

We are given two strings of equal length, and we are allowed to manipulate them using a small set of swap operations. Each position forms a vertical pair of characters, one from the first string and one from the second.
codeforces competitive-programming implementation Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Round 498 (Div. 3) ›

CF 1006B - Polycarp's Practice

We are given a sequence of problem difficulties in a fixed order, and we must split this sequence into exactly k consecutive segments. Each segment corresponds to one day of practice, and every problem must belong to exactly one segment.
codeforces competitive-programming greedy implementation sortings Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Round 498 (Div. 3) ›

CF 1006A - Adjacent Replacements

We are given a sequence of integers, each lying in a very large range up to $10^9$. Mishka repeatedly applies a global transformation rule that acts independently on each value: every pair of consecutive integers $(1,2)$, $(3,4)$, $(5,6)$, and so on, gets swapped in place, but…
codeforces competitive-programming implementation Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Round 498 (Div. 3) ›

CF 1006C - Three Parts of the Array

We are given a sequence of numbers arranged in a line, and we want to cut this line into three consecutive segments. The first segment starts at the beginning, the second sits in the middle, and the third ends at the last element.
codeforces competitive-programming binary-search data-structures two-pointers Jun 16, 2026