AGM 2023 Qualification Round

12 problems from AGM 2023 Qualification Round (contest 104325), difficulty -. 7/12 solutions verified against sample I/O.

12 items

AGM 2023 Qualification Round

Special | 12 problems | 7/12 verified | Difficulty - | 22m 48s

# Problem Rating Tags Accepted Time ✓
A Construction plan 1m 39s
B DrahSort 1m 16s ✓
C Field 1m 34s ✓
D Flip 5m 6s
E Another Game 1m 28s ✓
F IPs 1m 56s
G Monty Hall 2m 17s ✓
H N\u0103dlac 1m 29s ✓
I Palindrome 1m 38s ✓
J Pawn Game 1m 48s
K Pirates 1m 12s ✓
L YsaeSort 1m 25s
Practice › Codeforces Solutions › AGM 2023 Qualification Round ›

CF 104325L - YsaeSort

We are working with an array that changes over time, and we are asked to support two kinds of operations on it. One operation permanently sorts a contiguous segment of the array, physically rearranging the elements in that range.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › AGM 2023 Qualification Round ›

CF 104325K - Pirates

We are given a rectangular grid of size $N times M$. Inside this grid, several axis-aligned rectangular regions are marked as bombed. Each bombed region fully covers all cells inside its rectangle, and overlapping rectangles simply reinforce coverage.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › AGM 2023 Qualification Round ›

CF 104325J - Pawn Game

We are given a long number line of positions, but only a small subset of those positions actually contains pawns. Each pawn has a position and a color, and no two pawns ever share a position.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › AGM 2023 Qualification Round ›

CF 104325I - Palindrome

We are given a string and asked to study all of its substrings through a recursive notion of “palindromic depth.” A substring contributes to the answer only if it is a palindrome. If it is not a palindrome, its contribution is irrelevant and its degree is defined as zero.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › AGM 2023 Qualification Round ›

CF 104325D - Flip

We are given a collection of integers, each stored in binary using exactly $K$ bits. We are allowed to perform exactly $P$ operations, and each operation consists of picking one number and flipping one of its bits. Flipping a bit means toggling it from 0 to 1 or from 1 to 0.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › AGM 2023 Qualification Round ›

CF 104325G - Monty Hall

We are standing in front of a circular arrangement of $N$ doors. From any door $x$, we are allowed to perform a single type of action: pick a step size $i$ and move exactly $i$ positions forward, wrapping around when we pass door $N$.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › AGM 2023 Qualification Round ›

CF 104325H - Nădlac

We maintain a dynamic queue of trucks, where each truck is represented by one of seven ordered colors. The colors form a strict priority chain, from red as the highest priority down to violet as the lowest.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › AGM 2023 Qualification Round ›

CF 104325F - IPs

We are managing access to IP addresses, where the entire universe of possible IPs is the integer range from 0 to 10^9. Each country owns a fixed set of IP intervals, and these countries can later be merged into larger groups whose IP sets are unions of the merged members.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › AGM 2023 Qualification Round ›

CF 104325E - Another Game

We are given a row of $N$ piles arranged from left to right, each containing some positive number of stones. Two players alternate turns, starting with Charlie.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › AGM 2023 Qualification Round ›

CF 104325A - Construction plan

We are given a production system where every material is created by exactly one recipe executed on a specific type of machine. Each machine type has a fixed speed multiplier, and each recipe has a base time.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › AGM 2023 Qualification Round ›

CF 104325C - Field

Each cell of the grid must be assigned one of two states, which we can think of as planting wheat or planting sunflower. Choosing wheat in a cell gives a fixed profit from matrix A, while choosing sunflower gives a fixed profit from matrix B.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › AGM 2023 Qualification Round ›

CF 104325B - DrahSort

We are given an array of non-negative integers, and many queries asking about subarrays. Each query picks a segment $[l, r]$, and we conceptually sort only that segment into non-decreasing order using adjacent swaps.
codeforces competitive-programming Jul 1, 2026