Bay Area Programming Contest 2024

13 problems from Bay Area Programming Contest 2024 (contest 105012), difficulty -. 13/13 solutions verified against sample I/O.

13 items

Bay Area Programming Contest 2024

Special | 13 problems | 13/13 verified | Difficulty - | 10m 59s

#	Problem	Time	✓
A	An X-Camp Transformer Game	54s	✓
B	Big Data	53s	✓
C	Crazy Dance	44s	✓
D	Deviously Disorganized Documents	42s	✓
E	Ezra and Experiments	51s	✓
F	Funky Finding	49s	✓
G	GCD Spanning Tree	46s	✓
H	Haphazard Reconstruction	48s	✓
I	Interesting Constructive	1m 1s	✓
J	Jovial Jaunt	57s	✓
K	Kickball	52s	✓
L	Legendary Gyrating Mill	51s	✓
M	Methodical Mixing	51s	✓

Practice › Codeforces Solutions › Bay Area Programming Contest 2024 ›

CF 105012M - Methodical Mixing

We start with an array that is initially a permutation of length $n$, specifically $[1,2,dots,n]$. A sequence of $m$ operations is applied in order. Each operation first swaps two positions $xp$ and $yp$, then performs a cyclic right rotation of the entire array.

Practice › Codeforces Solutions › Bay Area Programming Contest 2024 ›

CF 105012L - Legendary Gyrating Mill

We are given a set of points in the plane, with the guarantee that no three lie on a single line. We imagine a process that starts from one point together with a directed line passing through it.

Practice › Codeforces Solutions › Bay Area Programming Contest 2024 ›

CF 105012K - Kickball

We are simulating a group of people moving on an infinite integer grid. Each person appears at a given time, starts at a fixed coordinate, and initially faces north. Time advances in discrete minutes, and every active person performs two actions in a fixed order each minute.

Practice › Codeforces Solutions › Bay Area Programming Contest 2024 ›

CF 105012J - Jovial Jaunt

We are given a tree with values on its vertices. A player chooses any two vertices as endpoints of a simple path and walks along the unique path between them. The score of a path is not a simple sum or maximum.

Practice › Codeforces Solutions › Bay Area Programming Contest 2024 ›

CF 105012I - Interesting Constructive

We are given a rectangular grid where every cell starts uncolored. We must output an order in which to color all cells exactly once.

Practice › Codeforces Solutions › Bay Area Programming Contest 2024 ›

CF 105012H - Haphazard Reconstruction

We are working on an $n times n$ grid that starts completely white. We must paint exactly $k$ cells black, but the final pattern must look unchanged after a 90-degree clockwise rotation.

Practice › Codeforces Solutions › Bay Area Programming Contest 2024 ›

CF 105012G - GCD Spanning Tree

We are given a complete undirected graph on vertices labeled from 1 to n. Every pair of distinct vertices i and j is connected, and the weight of that edge is defined as gcd(i, j).

Practice › Codeforces Solutions › Bay Area Programming Contest 2024 ›

CF 105012E - Ezra and Experiments

We are given a rooted tree with vertex 1 as the root. Each vertex has a value called “aliveness”, which is defined recursively from the leaves upward. For any vertex, we first compute a quantity $S$, which is the sum of aliveness of all its children plus one extra unit.

Practice › Codeforces Solutions › Bay Area Programming Contest 2024 ›

CF 105012F - Funky Finding

We are given two integers $x$ and $y$, and instead of comparing them in the usual increasing order of natural numbers, we compare them in a very specific permutation of the positive integers called the Sharkovskii ordering. This ordering is constructed in layers.

Practice › Codeforces Solutions › Bay Area Programming Contest 2024 ›

CF 105012D - Deviously Disorganized Documents

We are given an array that represents a permutation-like document of essays, where position and value both matter. The value at index i is the label of the essay currently placed there.

Practice › Codeforces Solutions › Bay Area Programming Contest 2024 ›

CF 105012A - An X-Camp Transformer Game

We are given two integer arrays of equal length. The first array is a starting configuration, and the second array is the target configuration. We are allowed to perform a sequence of exactly n operations, where each operation is defined by choosing an index i.

Practice › Codeforces Solutions › Bay Area Programming Contest 2024 ›

CF 105012B - Big Data

We are given a binary array and a second array that describes target segment sizes. If we take the binary array and compress it into maximal runs of equal values, we get a sequence of block lengths. For example, a sequence like 1 1 0 0 0 1 becomes blocks of lengths [2, 3, 1].

Practice › Codeforces Solutions › Bay Area Programming Contest 2024 ›

CF 105012C - Crazy Dance

We are given $n$ independent dancers placed somewhere on an integer line. Each dancer starts at some integer coordinate, and then simultaneously moves one step either left or right, each direction chosen independently with probability $1/2$.