Teamscode Spring 2024 (Advanced Division)

12 problems from Teamscode Spring 2024 (Advanced Division) (contest 105067), difficulty -. 1/12 solutions verified against sample I/O.

12 items

Teamscode Spring 2024 (Advanced Division)

Special | 12 problems | 1/12 verified | Difficulty - | 20m 25s

#	Problem	Time	✓
A	It's Time to Submit	47s	✓
B	Richard Lore	1m 45s
C	Unique Subsequences	1m 50s
D	Sleepy Pandas	1m 31s
E	Another Ordering Problem	1m 37s
F	Another Bitwise Problem	3m 19s
G	Mayoi Tree	1m 39s
H	Gaslighting	1m 32s
I	Fire Fighters	1m 31s
J	Arknights Chips	1m 37s
K	ANDtreew	1m 26s
L	Everyone Loves Threes Magic (Hard Version)	1m 51s

Practice › Codeforces Solutions › Teamscode Spring 2024 (Advanced Division) ›

CF 105067L - Everyone Loves Threes Magic (Hard Version)

We are given a function that depends on two layers of summation. First, for a fixed interval $[l, r]$, we look only at numbers divisible by 3 inside that interval. For each such number $x$, we count how many digit ‘3’ appear in its decimal representation and sum this count.

Practice › Codeforces Solutions › Teamscode Spring 2024 (Advanced Division) ›

CF 105067J - Arknights Chips

We are repeatedly simulating a farming process that produces two types of items. Each run of the stage independently yields either a sniper chip with probability $p = frac{a}{100}$ or a caster chip with probability $1 - p$.

Practice › Codeforces Solutions › Teamscode Spring 2024 (Advanced Division) ›

CF 105067K - ANDtreew

We are given a tree with nodes labeled from 1 to n. Each query selects a subset of these nodes, and we are allowed to delete any subset of the selected nodes. After deletions, the remaining nodes form a forest.

Practice › Codeforces Solutions › Teamscode Spring 2024 (Advanced Division) ›

CF 105067I - Fire Fighters

We are given a line of fighters, each carrying a power value. A tournament repeatedly takes the first two remaining fighters in the current sequence and makes them fight. The loser is removed, while in the case of a tie both are removed.

Practice › Codeforces Solutions › Teamscode Spring 2024 (Advanced Division) ›

CF 105067H - Gaslighting

We are given a fixed string and then many independent queries, each query selecting a contiguous segment of that string.

Practice › Codeforces Solutions › Teamscode Spring 2024 (Advanced Division) ›

CF 105067G - Mayoi Tree

We are given a tree where every edge is equipped with two directed weights. If we stand at node u, each neighbor v has a positive weight Cu(v).

Practice › Codeforces Solutions › Teamscode Spring 2024 (Advanced Division) ›

CF 105067E - Another Ordering Problem

Each item in the input represents a topping. The topping has a value, and it also carries a single restriction pointing to another topping index. If you decide to include topping i in your final selection, then the topping bi is no longer allowed to appear together with it.

Practice › Codeforces Solutions › Teamscode Spring 2024 (Advanced Division) ›

CF 105067C - Unique Subsequences

We are given a string and a number $k$. From the string, we look at all subsequences that have exactly length $k$. The question is whether any two different ways of choosing positions in the string can produce the same resulting length-$k$ sequence of characters.

Practice › Codeforces Solutions › Teamscode Spring 2024 (Advanced Division) ›

CF 105067B - Richard Lore

We are given an array of length n and a fixed sequence of swaps. Each swap exchanges two positions in the array, and this sequence is always applied in the same order.

Practice › Codeforces Solutions › Teamscode Spring 2024 (Advanced Division) ›

CF 105067D - Sleepy Pandas

We are given an array of numbers, each number representing a panda’s label. For any ordered pair of distinct indices $(i, j)$, we form a new number by writing $xi$ directly followed by $xj$.

Practice › Codeforces Solutions › Teamscode Spring 2024 (Advanced Division) ›

CF 105067F - Another Bitwise Problem

We are given an array and a variable integer $x$. For any choice of $x$, we compute a value by XORing $x$ with every array element and summing the results. This produces a single integer $S(x)$.

Practice › Codeforces Solutions › Teamscode Spring 2024 (Advanced Division) ›

CF 105067A - It's Time to Submit

The task reduces a contest joke into a binary decision. We are given a single integer $T$, but the important part is not the value itself, it is the meta-information: we are asked whether it is possible to obtain a correct solution submission simply by printing the sample output.