Robbing Balloons 2.0 Qualifications

11 problems from Robbing Balloons 2.0 Qualifications (contest 105314), difficulty -. 11/11 solutions verified against sample I/O.

11 items

Robbing Balloons 2.0 Qualifications

Special | 11 problems | 11/11 verified | Difficulty - | 10m 20s

#	Problem	Time	✓
A	Rama and Cats Syndrome	50s	✓
B	Ahmad and Pairs Syndrome	53s	✓
C	Hamza and Fulfillment Syndrome	1m 16s	✓
D	The Boys and Wasting Time Syndrome	55s	✓
E	Ahmad and Substrings Syndrome	1m 10s	✓
F	Ahmad and Swapping Syndrome	50s	✓
G	Ahmad and Cinema Syndrome	51s	✓
H	Hamza and the Forgotten Tree Syndrome	1m 15s	✓
I	Ahmad and Gifting Syndrome	51s	✓
J	Ahmad and Prediction Syndrome	39s	✓
K	Ahmad and Distinct Syndrome	50s	✓

Practice › Codeforces Solutions › Robbing Balloons 2.0 Qualifications ›

CF 105314K - Ahmad and Distinct Syndrome

We are given several independent test cases. In each test case, we are shown a line of contestants, each carrying a balloon of some color represented by an integer.

Practice › Codeforces Solutions › Robbing Balloons 2.0 Qualifications ›

CF 105314H - Hamza and the Forgotten Tree Syndrome

We are given a tree where each node carries an integer value. For every unordered pair of nodes $u, v$, we look at the unique simple path between them. On that path we define two quantities: the number of nodes on the path, and the gcd of all node values along the path.

Practice › Codeforces Solutions › Robbing Balloons 2.0 Qualifications ›

CF 105314J - Ahmad and Prediction Syndrome

The task describes a very simple qualification rule for a contest. Each test case gives a single integer representing how many distinct balloons a team has robbed. A team qualifies if and only if it has robbed at least 8 different balloons.

Practice › Codeforces Solutions › Robbing Balloons 2.0 Qualifications ›

CF 105314E - Ahmad and Substrings Syndrome

We are given a base string s. For each query, we are also given another string t, but the twist is that t is not fixed in order. We are allowed to permute its characters arbitrarily, and we want to know whether some substring of s can be rearranged to match t.

Practice › Codeforces Solutions › Robbing Balloons 2.0 Qualifications ›

CF 105314G - Ahmad and Cinema Syndrome

We are given several independent scenarios. In each scenario, there are $n$ movies, each with a fixed ticket price. The goal is to watch all movies exactly once. Normally, watching a movie requires paying its individual ticket cost.

Practice › Codeforces Solutions › Robbing Balloons 2.0 Qualifications ›

CF 105314C - Hamza and Fulfillment Syndrome

We are given several test cases. Each test case describes a sequence of items arranged in a fixed order. Every item has an ID and a color. From this sequence, we want to select a subsequence of items while preserving the original order.

Practice › Codeforces Solutions › Robbing Balloons 2.0 Qualifications ›

CF 105314D - The Boys and Wasting Time Syndrome

We are given several test cases. In each test case there is an array of items. Each item has two attributes: a value a[i] and a weight-like parameter b[i].

Practice › Codeforces Solutions › Robbing Balloons 2.0 Qualifications ›

CF 105314B - Ahmad and Pairs Syndrome

We are given an array of integers. From this array, we conceptually form all pairwise differences between every ordered pair of distinct indices.

Practice › Codeforces Solutions › Robbing Balloons 2.0 Qualifications ›

CF 105314I - Ahmad and Gifting Syndrome

We are given several independent test cases. In each test case, there are $n$ intervals. From each interval $[li, ri]$, we must choose exactly one integer $xi$. After making all choices, we compute the sum of all selected values.

Practice › Codeforces Solutions › Robbing Balloons 2.0 Qualifications ›

CF 105314F - Ahmad and Swapping Syndrome

We are given several independent test cases. In each test case, there is a sequence of words arranged in a line. The task is to count how many pairs of positions $(i, j)$ with $i < j$ satisfy a simple visual condition: the two words at these positions “fascinate Ahmad” if…

Practice › Codeforces Solutions › Robbing Balloons 2.0 Qualifications ›

CF 105314A - Rama and Cats Syndrome

We are given several test cases. In each test case, there is an array of positive integers representing values of food bags. Rama must choose exactly $n-1$ of these bags and her “satisfaction” is defined as the bitwise OR of the chosen values.