FIICode2023

6 problems from FIICode2023 (contest 104328), difficulty -. 4/6 solutions verified against sample I/O.

6 items

FIICode2023

Special | 6 problems | 4/6 verified | Difficulty - | 9m 32s

#	Problem	Rating	Tags	Accepted	Time	✓
A	John and Circles				1m 26s	✓
B	John and AndMax				1m 18s	✓
C	John and Tractor				1m 37s	✓
D	John and President				1m 50s
E	John and Lights				1m 42s
F	John and Computer Science				1m 39s	✓

Practice › Codeforces Solutions › FIICode2023 ›

CF 104328D - John and President

We are given a tree with $n$ vertices, where each vertex represents a person and each person has an integer value $pi$. We also have the notion of a political plan value $x$. A person will support John if and only if their value $pi$ is divisible by $x$.

Practice › Codeforces Solutions › FIICode2023 ›

CF 104328F - John and Computer Science

We are generating a random string one character at a time, where each character is chosen independently and uniformly from the 26 lowercase English letters. There is a fixed target string of length $n$, and we are watching the stream as it grows.

Practice › Codeforces Solutions › FIICode2023 ›

CF 104328E - John and Lights

We are given a tree with $N$ nodes. All nodes initially have a light turned on. Then we are given a permutation of the nodes, and in that order, we turn off exactly one node per step.

Practice › Codeforces Solutions › FIICode2023 ›

CF 104328C - John and Tractor

We are given a grid where every cell behaves like a terrain tile with a movement cost. Some tiles are cheap roads, some are normal dirt, and some are expensive farmland.

Practice › Codeforces Solutions › FIICode2023 ›

CF 104328A - John and Circles

We are given an array of integers, and each query selects a contiguous segment of this array. For every query, we imagine taking that segment and wrapping it into a circle, so after the last element we return to the first.

Practice › Codeforces Solutions › FIICode2023 ›

CF 104328B - John and AndMax

We are given a directed acyclic graph where every vertex carries a 20-bit integer value. The task is to choose a path that moves along directed edges, uses exactly $k$ vertices, and computes a score defined as the bitwise AND of all values along the path.