Bay Area Programming Contest 2025

11 problems from Bay Area Programming Contest 2025 (contest 105755), difficulty -. 11/11 solutions verified against sample I/O.

11 items

Bay Area Programming Contest 2025

Special | 11 problems | 11/11 verified | Difficulty - | 13m 4s

# Problem Rating Tags Accepted Time ✓
A A Times B 1m 2s ✓
B Bitstring Accruing Policy Convergence 1m 21s ✓
C Count Pairs 1m 20s ✓
D Drowsy Robots 1m 40s ✓
E Even Even Odd Odd 53s ✓
F Fill the Gym with Argon 1m 7s ✓
G Grids of Grids 52s ✓
H Heaps of Queries 53s ✓
I In the News 1m 25s ✓
J Joystick Jumping 52s ✓
K Killer Cows 1m 39s ✓
Practice › Codeforces Solutions › Bay Area Programming Contest 2025 ›

CF 105755H - Heaps of Queries

We are given a deterministic way of building a binary tree-like structure by inserting values from 1 up to n into a skew heap.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Bay Area Programming Contest 2025 ›

CF 105755K - Killer Cows

We are given a set of at most 20 cows, each identified by a bit position. Initially all cows are on the left bank of a river, and the goal is to move them all to the right bank.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Bay Area Programming Contest 2025 ›

CF 105755D - Drowsy Robots

We are given a line of robots labeled from left to right. Robot $i$ starts at position $x = i$, and all robots begin moving left at time zero.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Bay Area Programming Contest 2025 ›

CF 105755C - Count Pairs

We are given a multiset of positive integers, and we want to choose a subset with no duplicates such that every pair of chosen numbers satisfies a strict bitwise condition involving XOR. For any two chosen numbers $x$ and $y$, we compute $x oplus y$.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Bay Area Programming Contest 2025 ›

CF 105755F - Fill the Gym with Argon

We are given a rooted structure of activities. Each activity has a profit value, which can be positive or negative, and every activity except the first depends on exactly one earlier activity.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Bay Area Programming Contest 2025 ›

CF 105755I - In the News

We are given a sequence of class days and a collection of news events, where each event is active over a contiguous range of days.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Bay Area Programming Contest 2025 ›

CF 105755J - Joystick Jumping

We are given a line of buildings, each with a height, and a starting position. From the starting building, a player wants to eventually step on every building at least once. Movement is only allowed between neighboring buildings.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Bay Area Programming Contest 2025 ›

CF 105755G - Grids of Grids

We are given a collection of small binary grids, each of size $m times m$, where each cell is either empty or filled.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Bay Area Programming Contest 2025 ›

CF 105755E - Even Even Odd Odd

We are given two arrays of equal length. The starting array can be modified step by step until it matches a target array.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Bay Area Programming Contest 2025 ›

CF 105755B - Bitstring Accruing Policy Convergence

We are asked to construct two bitstrings, call them s and t, with the same length and the same number of zeros and ones. Both strings are then transformed by repeatedly applying a substitution rule many times, specifically 22 times.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Bay Area Programming Contest 2025 ›

CF 105755A - A Times B

We are given a grid where every cell at coordinate $(i, j)$ has a value equal to $i times j$. A token starts at $(a, b)$ and must reach $(n, m)$.
codeforces competitive-programming Jun 22, 2026