Fall 2024 Cupertino Informatics Tournament

11 problems from Fall 2024 Cupertino Informatics Tournament (contest 105400), difficulty -. 3/11 solutions verified against sample I/O.

11 items

Fall 2024 Cupertino Informatics Tournament

Special | 11 problems | 3/11 verified | Difficulty - | 28m 50s

# Problem Rating Tags Accepted Time ✓
A Spilled Milk I 1m 34s ✓
B Spilled Milk II 5m 21s
C Mex Rectangle 1m 43s
D Cool Sort 5m 10s
E Is this Segment Tree Beats? 1m 46s
F Keys Burns Down the House 1m 14s ✓
G Powerful Swaps (Easy Version) 5m 20s
H Pirate's Booty 2m 9s
I Lost 1m 28s ✓
J Coconut vs Orange 1m 44s
K Powerful Swaps (Hard Version) 1m 21s
Practice › Codeforces Solutions › Fall 2024 Cupertino Informatics Tournament ›

CF 105400J - Coconut vs Orange

We are given a grid with 3 rows and N columns. Each cell contains either 0 or 1, representing votes for two candidates. We can think of each cell as a unit city with a binary label.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Fall 2024 Cupertino Informatics Tournament ›

CF 105400F - Keys Burns Down the House

We are given a line of books, each with a value, and a process that removes books from the ends over time. At every second, two things happen in sequence: first, Keys may take exactly one remaining book from anywhere in the current segment, and then the fire burns the current…
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Fall 2024 Cupertino Informatics Tournament ›

CF 105400A - Spilled Milk I

We are given a single integer $N$, which is the product of some hidden sequence of dice rolls. Each roll was a standard die, so every factor in the hidden sequence is an integer from 1 to 6.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Fall 2024 Cupertino Informatics Tournament ›

CF 105400I - Lost

We are given three numbers per test case. These numbers come from four possible values computed from a hidden pair of integers $a$ and $b$: their bitwise AND, OR, XOR, and their sum.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Fall 2024 Cupertino Informatics Tournament ›

CF 105400D - Cool Sort

We are given a permutation of the numbers from 1 to N arranged in a line. The goal is to transform this permutation into the sorted order 1 through N using swaps, but with a strict restriction on what swaps are allowed.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Fall 2024 Cupertino Informatics Tournament ›

CF 105400K - Powerful Swaps (Hard Version)

We are given an array and asked whether it can be transformed into a sorted array using adjacent swaps, but with a constraint that makes swaps progressively harder as the process goes on. The operation is not a standard swap.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Fall 2024 Cupertino Informatics Tournament ›

CF 105400E - Is this Segment Tree Beats?

We are given the final state of an array where every element is between 1 and 10. This array did not start in this form. Instead, it was transformed by repeatedly applying global operations over the entire array.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Fall 2024 Cupertino Informatics Tournament ›

CF 105400B - Spilled Milk II

Codeforces 105400B: Spilled Milk II
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Fall 2024 Cupertino Informatics Tournament ›

CF 105400H - Pirate's Booty

We have a line of ships, each ship behaving like a container with a fixed maximum number of crate slots. Initially all ships are empty. Over time, crates are poured into a chosen ship index.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Fall 2024 Cupertino Informatics Tournament ›

CF 105400C - Mex Rectangle

We are given a grid of integers, and we are allowed to choose any axis-aligned subrectangle. For each such subrectangle, we compute the mex of all values inside it, and we want the maximum possible mex over all choices.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Fall 2024 Cupertino Informatics Tournament ›

CF 105400G - Powerful Swaps (Easy Version)

Codeforces 105400G: Powerful Swaps (Easy Version)
codeforces competitive-programming Jun 22, 2026