2024 USACO.Guide Informatics Tournament

12 problems from 2024 USACO.Guide Informatics Tournament (contest 105009), difficulty -. 2/12 solutions verified against sample I/O.

12 items

2024 USACO.Guide Informatics Tournament

Special | 12 problems | 2/12 verified | Difficulty - | 17m 29s

#	Problem	Time	✓
A	TriNum Array	1m 8s	✓
B	Two Way Homework	59s	✓
C	Balanced Difference	1m 27s
D	Producing Digits	1m 12s
E	Gardening is Hard	1m 18s
F	Farmer John's Cities	1m 8s
G	Soccer League	1m 20s
H	Cheating the Group System	2m 4s
I	Hori and Cake	1m 23s
J	CRP Game	1m 51s
K	Counting Pairs	1m 55s
L	Modulo Queries	1m 44s

Practice › Codeforces Solutions › 2024 USACO.Guide Informatics Tournament ›

CF 105009C - Balanced Difference

We are given a list of numbers and we must split it into two groups that do not overlap and together contain every element. Each group must contain at least two elements.

Practice › Codeforces Solutions › 2024 USACO.Guide Informatics Tournament ›

CF 105009A - TriNum Array

We are given a sequence of integers laid out in a single line, and we are asked to find a contiguous segment of this sequence that uses at most three distinct values, while being as long as possible. Think of the array as a timeline of trades in Numerica.

Practice › Codeforces Solutions › 2024 USACO.Guide Informatics Tournament ›

CF 105009L - Modulo Queries

We are given a fixed array of integers and many independent range queries. Each query picks a contiguous segment from index $l$ to $r$, and a modulus value $x$.

Practice › Codeforces Solutions › 2024 USACO.Guide Informatics Tournament ›

CF 105009K - Counting Pairs

We start from a single state described by an ordered pair of positive integers, initially (1, 1). Each move changes the state in a very structured way: either the first component absorbs the second, or the second absorbs the first.

Practice › Codeforces Solutions › 2024 USACO.Guide Informatics Tournament ›

CF 105009J - CRP Game

We are given a sequence of length $N$ containing only values $0,1,2,3$. All elements start on board $A$, and we must move them to board $B$ by repeatedly taking the front of $A$ and appending it to $B$.

Practice › Codeforces Solutions › 2024 USACO.Guide Informatics Tournament ›

CF 105009I - Hori and Cake

We are given a collection of line segments on a number line. The key structural constraint is that any two segments are either disjoint or one fully contains the other.

Practice › Codeforces Solutions › 2024 USACO.Guide Informatics Tournament ›

CF 105009H - Cheating the Group System

There are many students, but only a relatively small number of them are explicitly connected by “must-stay-together” relationships. These relationships form an undirected graph over students.

Practice › Codeforces Solutions › 2024 USACO.Guide Informatics Tournament ›

CF 105009G - Soccer League

We are given a summary of a football team’s season. Each team is described by five numbers: how many matches they won, drew, and lost, and the total goals they scored and conceded across all matches.

Practice › Codeforces Solutions › 2024 USACO.Guide Informatics Tournament ›

CF 105009F - Farmer John's Cities

We are given a directed weighted graph representing a road network between cities. From a fixed starting city $s$, we want to reach a target city $t$. The graph already contains $M$ roads, and additionally there are $K$ optional roads.

Practice › Codeforces Solutions › 2024 USACO.Guide Informatics Tournament ›

CF 105009E - Gardening is Hard

We are given an $n times n$ grid where each cell represents one of three terrain types: usable planting land, a water source, or unusable blocked land. We are asked to count how many horizontal strips of height exactly two rows are “valid gardening strips”.

Practice › Codeforces Solutions › 2024 USACO.Guide Informatics Tournament ›

CF 105009D - Producing Digits

Each test case gives two arrays of the same length. You process positions from left to right. At position i, you start with the value a[i] and are allowed to optionally multiply it by any subset of the earlier values a[1] ... a[i-1].

Practice › Codeforces Solutions › 2024 USACO.Guide Informatics Tournament ›

CF 105009B - Two Way Homework

We are given two sequences of the same length. At each position we must pick exactly one value, either from the first sequence or from the second, and sum up all chosen values.