2023-2024 ICPC Brazil Subregional Programming Contest

13 problems from 2023-2024 ICPC Brazil Subregional Programming Contest (contest 104555), difficulty -. 9/13 solutions verified against sample I/O.

13 items

2023-2024 ICPC Brazil Subregional Programming Contest

ICPC/IOI | 13 problems | 9/13 verified | Difficulty - | 19m 48s

#	Problem	Time	✓
A	Amusement Park Adventure	1m 16s	✓
B	Best Fair Shuffles	1m 42s	✓
C	Challenging Hike	2m 14s
D	Detour	2m 4s	✓
E	Extracting Pollen	1m 31s	✓
F	Fatigue-Fighting Vacation	57s	✓
G	Great Treaty of Byteland	2m 24s
H	Honest Worker	1m 43s
I	Investigating Zeroes and Ones	58s	✓
J	Jumping to Victory	1m 47s
K	$K$ for More, $K$ for Less	1m 13s	✓
L	Lexicographical Challenge	57s	✓
M	Maximizing Flight Efficiency	1m 2s	✓

Practice › Codeforces Solutions › 2023-2024 ICPC Brazil Subregional Programming Contest ›

CF 104555M - Maximizing Flight Efficiency

We are given a complete weighted graph where each vertex represents a city and every pair of cities has a direct flight with a known cost. The cost matrix is symmetric, so traveling between two cities costs the same in both directions.

Practice › Codeforces Solutions › 2023-2024 ICPC Brazil Subregional Programming Contest ›

CF 104555L - Lexicographical Challenge

We are given a string and a fixed step size $K$. The only allowed operation is to pick an index $i$ and swap the characters at positions $i$ and $i+K$, as long as both positions exist.

Practice › Codeforces Solutions › 2023-2024 ICPC Brazil Subregional Programming Contest ›

CF 104555K - $K$ for More, $K$ for Less

We are given two polynomials, both of degree at most $N$. One polynomial $t(x)$ represents the contribution of theory study, and another polynomial $p(x)$ represents the contribution of practice.

Practice › Codeforces Solutions › 2023-2024 ICPC Brazil Subregional Programming Contest ›

CF 104555J - Jumping to Victory

We are given an axis-aligned rectangular volleyball court and a set of players placed inside it. Each player can move in any direction, but only up to a fixed distance $d$.

Practice › Codeforces Solutions › 2023-2024 ICPC Brazil Subregional Programming Contest ›

CF 104555G - Great Treaty of Byteland

Each kingdom is represented by a point on a 2D plane, and the world is partitioned by a nearest-capital rule. Every location in the infinite plane belongs to whichever capital is strictly closest in Euclidean distance.

Practice › Codeforces Solutions › 2023-2024 ICPC Brazil Subregional Programming Contest ›

CF 104555H - Honest Worker

We are given a collection of independent contract jobs, each defined by a start day, an end day, and a fixed daily income. The pay rate is the same across all jobs, so the only way jobs differ in profitability is their time span and the cost required to even access them.

Practice › Codeforces Solutions › 2023-2024 ICPC Brazil Subregional Programming Contest ›

CF 104555I - Investigating Zeroes and Ones

We are given a binary sequence, meaning each position contains either 0 or 1, and we are asked to count how many contiguous segments of this sequence contain an odd number of ones.

Practice › Codeforces Solutions › 2023-2024 ICPC Brazil Subregional Programming Contest ›

CF 104555D - Detour

The input describes a weighted undirected graph where crossroads are vertices and roads are edges. Each road has a length and normally can be used in both directions.

Practice › Codeforces Solutions › 2023-2024 ICPC Brazil Subregional Programming Contest ›

CF 104555E - Extracting Pollen

We are given a collection of flowers, each storing an integer amount of pollen. Bees arrive one by one in a fixed order, and each bee performs exactly one action before leaving.

Practice › Codeforces Solutions › 2023-2024 ICPC Brazil Subregional Programming Contest ›

CF 104555F - Fatigue-Fighting Vacation

We are simulating a very specific vacation routine where two ordered lists of activities compete for attention under a shared resource called disposition.

Practice › Codeforces Solutions › 2023-2024 ICPC Brazil Subregional Programming Contest ›

CF 104555C - Challenging Hike

We are given a tree rooted at node 1. Each node has a value, and we walk from the root down to any node i along the unique simple path in the tree. While walking, we may optionally “record” some visited nodes, but the recorded sequence must have strictly increasing values.

Practice › Codeforces Solutions › 2023-2024 ICPC Brazil Subregional Programming Contest ›

CF 104555B - Best Fair Shuffles

We are given a final arrangement of a permutation of numbers from 1 to N, and we want to understand how many times we must apply a very specific shuffle operation starting from the identity permutation 1, 2, 3, ..., N to obtain it.

Practice › Codeforces Solutions › 2023-2024 ICPC Brazil Subregional Programming Contest ›

CF 104555A - Amusement Park Adventure

We are given a small amusement park with a fixed list of rides, each ride having a minimum height requirement. Carlitos has a fixed height, and he can only enter a ride if his height is at least as large as that ride’s requirement.