FIICode2023Round1

5 problems from FIICode2023Round1 (contest 104786), difficulty -. 4/5 solutions verified against sample I/O.

5 items

FIICode2023Round1

Special | 5 problems | 4/5 verified | Difficulty - | 6m 53s

#	Problem	Rating	Tags	Accepted	Time	✓
A	John and M\u00f6bius Convolution				59s	✓
B	John and tree game				1m 21s	✓
C	John and Olaf				1m 22s	✓
D	Many biscuits				1m 46s	✓
E	School				1m 25s

Practice › Codeforces Solutions › FIICode2023Round1 ›

CF 104786B - John and tree game

We are given a tree with (N) nodes. John wants to select disjoint pairs of nodes, with the restriction that a pair is valid only if the distance between the two nodes along the tree is even.

Practice › Codeforces Solutions › FIICode2023Round1 ›

CF 104786E - School

We are given a permutation of size $n$, meaning every integer from 1 to $n$ appears exactly once. For every pair of indices $(l, r)$, we look at the segment of the array from $l$ to $r$.

Practice › Codeforces Solutions › FIICode2023Round1 ›

CF 104786D - Many biscuits

We are given a rooted tree with root fixed at vertex 1. Every vertex initially contains exactly one biscuit. We will perform exactly k operations. In one operation we pick a vertex x and immediately eat every biscuit that still exists on the simple path from x up to the root.

Practice › Codeforces Solutions › FIICode2023Round1 ›

CF 104786C - John and Olaf

We are simulating two entities moving along a one-dimensional line of integer points from 1 to N. One of them, Olaf, moves deterministically: every minute he shifts one step to the right.

Practice › Codeforces Solutions › FIICode2023Round1 ›

CF 104786A - John and Möbius Convolution

We are given two arrays of integers, each of length $n$. Every value in both arrays is small, at most $10^3$, but the arrays themselves can be large, up to $2 cdot 10^5$ elements.