CAMA 2023

16 problems from CAMA 2023 (contest 104745), difficulty -. 16/16 solutions verified against sample I/O.

16 items

CAMA 2023

Special | 16 problems | 16/16 verified | Difficulty - | 13m 38s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Saving the cinema				45s	✓
B	Operation				48s	✓
C	Maximum profit				49s	✓
D	jbum				1m 5s	✓
E	Looking for palindromes				46s	✓
F	Harry Potter in CMS				52s	✓
G	XOR + Constructive = Love				47s	✓
H	Menorca's ants				49s	✓
I	Fake bills				50s	✓
J	Force Perturbation				51s	✓
K	\u00d3scar and his battle				55s	✓
L	Random intervals				1m 7s	✓
M	The battle of Helm's Deep				58s	✓
N	The Omer's orange tree				51s	✓
O	Bea the maximizer				47s	✓
P	Ski resort				38s	✓

Practice › Codeforces Solutions › CAMA 2023 ›

CF 104745D - jbum

We are simulating a very simple production process that increases the number of discs Javier has over time. He starts with a single disc.

Practice › Codeforces Solutions › CAMA 2023 ›

CF 104745P - Ski resort

We are given a directed acyclic graph representing ski pistes, plus a small number of additional directed edges representing ski lifts. Every edge, whether piste or lift, takes exactly one minute to traverse.

Practice › Codeforces Solutions › CAMA 2023 ›

CF 104745O - Bea the maximizer

We are given two arrays, both of length n. We are allowed to permute the indices of one of them, say b, and then pair elements position by position with a. For a chosen permutation p, we form n values of the form ai + bp[i], and we take the bitwise AND over all of them.

Practice › Codeforces Solutions › CAMA 2023 ›

CF 104745N - The Omer's orange tree

We are given a rooted tree with nodes numbered from 1 to n, rooted at node 1. Each node carries a distinct weight, and these weights form a permutation of the integers from 1 to n. For every query, we focus on a specific node u and an interval of integers from a to b.

Practice › Codeforces Solutions › CAMA 2023 ›

CF 104745M - The battle of Helm's Deep

We are given several defensive towers, each tower having a structural durability and a combat effectiveness. We also have a limited pool of soldiers that can be distributed across these towers before the attack begins.

Practice › Codeforces Solutions › CAMA 2023 ›

CF 104745L - Random intervals

We are given a fixed collection of intervals on the integer segment from 1 to m. These intervals come from the first run of a random generator and are already fully known.

Practice › Codeforces Solutions › CAMA 2023 ›

CF 104745K - Óscar and his battle

Each test case gives a set of playable characters and a set of monsters. A character is defined by two strengths: attack and defense. A monster is also defined by two thresholds, attack and defense, and a reward value in coins. You are allowed to pick exactly one character.

Practice › Codeforces Solutions › CAMA 2023 ›

CF 104745J - Force Perturbation

We are given several independent scenarios. In each scenario, there is a target value $x$ representing a deficit that must be reduced to exactly zero. We also have $n$ students, each starting with an initial power $ai$. Time evolves in discrete days.

Practice › Codeforces Solutions › CAMA 2023 ›

CF 104745I - Fake bills

We are working on a grid where a robber tries to travel from the top-left cell to the bottom-right cell. The grid is static in size but dynamically dangerous because of cameras placed on some cells.

Practice › Codeforces Solutions › CAMA 2023 ›

CF 104745H - Menorca's ants

We are given several independent scenarios. In each scenario, there are multiple types of ants, where type $i$ has $ai$ ants available. The goal is to throw at least $p$ ants in total using a sequence of moves. Each move has two independent constraints.

Practice › Codeforces Solutions › CAMA 2023 ›

CF 104745G - XOR + Constructive = Love

We are asked to construct an array of non-negative integers. Instead of being given the array directly, we are given three types of constraints that must simultaneously be satisfied. First, there is a global sum constraint.

Practice › Codeforces Solutions › CAMA 2023 ›

CF 104745F - Harry Potter in CMS

We process a stream of events about submissions, where each submission is just a set of subtasks that were solved correctly in that attempt. Subtasks are identified by integers, and a single submission may cover multiple subtasks.

Practice › Codeforces Solutions › CAMA 2023 ›

CF 104745E - Looking for palindromes

We are working with digit strings of a fixed length, where each character is from 0 to 9. A normal palindrome reads the same forwards and backwards.

Practice › Codeforces Solutions › CAMA 2023 ›

CF 104745C - Maximum profit

We are given a sequence of bank checks, each with a fixed monetary value. From this sequence, we are allowed to pick at most k checks in a single day, and our goal is to maximize the total value of the selected checks.

Practice › Codeforces Solutions › CAMA 2023 ›

CF 104745B - Operation

We are given two positive integers, and we are allowed to apply one of the four basic arithmetic operations between them: addition, subtraction, multiplication, or division. Each operation produces a value, and we must determine which operation yields the largest result.

Practice › Codeforces Solutions › CAMA 2023 ›

CF 104745A - Saving the cinema

The task is to build a tiny classifier that reads a single name and returns a fixed sentence depending on which fictional universe that name belongs to. The input is always exactly one of three possible character names.