GPL 2023 Novice

10 problems from GPL 2023 Novice (contest 104599), difficulty -. 7/10 solutions verified against sample I/O.

10 items

GPL 2023 Novice

Special | 10 problems | 7/10 verified | Difficulty - | 12m 42s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Tall Bots Short Bots				57s	✓
B	Birthday				1m 6s	✓
C	Model Accuracy				1m 17s	✓
D	Dividing Data				56s	✓
E	Speedrun Splits				1m 24s
F	Navigation Puzzle				1m 26s	✓
G	Consecutive Segments				1m 30s
H	Light Tree				2m 18s
I	Intergalactic Terrorism				44s	✓
J	Groups of Bots				1m 4s	✓

Practice › Codeforces Solutions › GPL 2023 Novice ›

CF 104599H - Light Tree

The structure described is a rooted binary tree embedded in an array form. Each node is labeled from $1$ to $N$, and each node can point to at most two children, a left child and a right child. A value of $0$ means that the corresponding child does not exist.

Practice › Codeforces Solutions › GPL 2023 Novice ›

CF 104599J - Groups of Bots

We are given a set of robot groups placed on a number line. Each group has a position and a number of robots sitting on that position.

Practice › Codeforces Solutions › GPL 2023 Novice ›

CF 104599I - Intergalactic Terrorism

We are given a rooted tree with $n$ nodes. Each node $i$ carries a positive value $ai$. The structure is already a tree, so there are exactly $n-1$ edges, each implicitly having weight $1$.

Practice › Codeforces Solutions › GPL 2023 Novice ›

CF 104599G - Consecutive Segments

We are given a string consisting of lowercase characters and a large number of queries. Each query selects a contiguous substring of the string, and for that substring we must count how many substrings consist of only one repeated character.

Practice › Codeforces Solutions › GPL 2023 Novice ›

CF 104599E - Speedrun Splits

We are given several speedrun attempts of the same game, where each run records the time taken to complete each split.

Practice › Codeforces Solutions › GPL 2023 Novice ›

CF 104599F - Navigation Puzzle

We are given a circular track with $n$ labeled positions. Three tokens start at positions $a$, $b$, and $c$. In one move, we pick exactly one token and shift it one step clockwise or counterclockwise along the circle.

Practice › Codeforces Solutions › GPL 2023 Novice ›

CF 104599D - Dividing Data

We are given a collection of files, each with a fixed size in bits, and a storage budget $X$. From these files, we want to select as many as possible while ensuring the total size of selected files does not exceed $X$.

Practice › Codeforces Solutions › GPL 2023 Novice ›

CF 104599C - Model Accuracy

Each test case gives two lists of numbers: expected outputs and actual outputs produced by a model. For every pair $(ei, ai)$, we decide whether the prediction is acceptable by checking if the absolute difference $ The task is to compute the fraction of correct cases among all…

Practice › Codeforces Solutions › GPL 2023 Novice ›

CF 104599B - Birthday

We are given a range of years from $x$ to $y$, both inclusive. For every year in this interval, we must output the calendar date corresponding to March 7th in that year. Each output line represents one such date, formatted as a day number, then the month name, then the year.

Practice › Codeforces Solutions › GPL 2023 Novice ›

CF 104599A - Tall Bots Short Bots

We are given a collection of robot friends, each described only by a single integer value representing its height. Bob wants to build a single “mega robot” by stacking all of them vertically.