Codeforces Global Round 3

Solutions for Codeforces Global Round 3 (contest 1148). 2/8 problems verified against sample I/O. Difficulty range: 800-3500.

8 items

Codeforces Global Round 3

Type: Global | Problems: 8 | Verified: 2/8 | Rating range: 800-3500 | Time: 12m 46s

Problem Name Rating Tags Solve Time Verified
A Another One Bites The Dust 800 greedy 1m 38s ✓
B Born This Way 1600 binary-search, brute-force, two-pointers 32s ✗
C Crazy Diamond 1700 constructive-algorithms, sortings 3m 19s ✓
D Dirty Deeds Done Dirt Cheap 1800 greedy, sortings 36s ✗
E Earth Wind and Fire 2300 constructive-algorithms, greedy, math 1m 43s ✗
F Foo Fighters 2700 bitmasks, constructive-algorithms 1m 34s ✗
G Gold Experience 3300 constructive-algorithms, graphs, math 1m 45s ✗
H Holy Diver 3500 data-structures 1m 39s ✗
Practice › Codeforces Solutions › Codeforces Global Round 3 ›

CF 1148H - Holy Diver

We are asked to maintain an array that grows dynamically. On each operation, we append a new element to the array and immediately count the number of contiguous subarrays (segments) within a given range [l, r] whose mex equals a given number k.
codeforces competitive-programming data-structures Jun 12, 2026
Practice › Codeforces Solutions › Codeforces Global Round 3 ›

CF 1148G - Gold Experience

We are given an array of integers placed on vertices of a complete set of labels. Between any two vertices we implicitly define an undirected edge if the two associated values share a nontrivial common divisor, meaning their gcd is greater than one.
codeforces competitive-programming constructive-algorithms graphs math number-theory probabilities Jun 12, 2026
Practice › Codeforces Solutions › Codeforces Global Round 3 ›

CF 1148C - Crazy Diamond

We are given a permutation of the numbers from 1 to $n$, where $n$ is guaranteed to be even. A permutation means each number appears exactly once in the array. The task is to sort this permutation in ascending order.
codeforces competitive-programming constructive-algorithms sortings Jun 12, 2026
Practice › Codeforces Solutions › Codeforces Global Round 3 ›

CF 1148F - Foo Fighters

We are given a collection of objects, each contributing a signed value and a binary mask. We must choose a positive integer s. Once s is fixed, each object is either kept as-is or flipped in sign depending on a parity condition computed from s and its mask.
codeforces competitive-programming bitmasks constructive-algorithms Jun 12, 2026
Practice › Codeforces Solutions › Codeforces Global Round 3 ›

CF 1148E - Earth Wind and Fire

We are given two multisets of integer positions on a number line. One multiset describes where stones start, the other describes where we want them to end.
codeforces competitive-programming constructive-algorithms greedy math sortings two-pointers Jun 12, 2026
Practice › Codeforces Solutions › Codeforces Global Round 3 ›

CF 1148A - Another One Bites The Dust

We are given three pools of building blocks. There are a pieces of the letter string "a", b pieces of "b", and c pieces of "ab". We are allowed to select any subset of these blocks and concatenate them in any order we want.
codeforces competitive-programming greedy Jun 12, 2026
Practice › Codeforces Solutions › Codeforces Global Round 3 ›

CF 1148D - Dirty Deeds Done Dirt Cheap

We are given a collection of $n$ disjoint pairs of integers. Every integer from $1$ to $2n$ appears exactly once across all pairs, so each number belongs to exactly one pair and there is no overlap.
codeforces competitive-programming greedy sortings Jun 12, 2026
Practice › Codeforces Solutions › Codeforces Global Round 3 ›

CF 1148B - Born This Way

We are given two sorted timelines of flights forming a mandatory two-leg journey. A passenger first chooses a flight from A to B, spending a fixed travel time, and then immediately connects to a flight from B to C, again with a fixed travel time.
codeforces competitive-programming binary-search brute-force two-pointers Jun 12, 2026