IME++ Starters Try-outs 2023

10 problems from IME++ Starters Try-outs 2023 (contest 104415), difficulty -. 10/10 solutions verified against sample I/O.

10 items

IME++ Starters Try-outs 2023

Special | 10 problems | 10/10 verified | Difficulty - | 8m 24s

#	Problem	Time	✓
A	Attendance Points	52s	✓
B	Beached Cannons	51s	✓
C	Candy Shop	45s	✓
D	Daydreaming Strings	54s	✓
E	Elevator Crisis	55s	✓
F	Frisbee Training	43s	✓
G	Graphical Nightmare	52s	✓
H	How do you spell this?	1m 1s	✓
I	Impressing the Captain	43s	✓
J	Jagged Roads	48s	✓

Practice › Codeforces Solutions › IME++ Starters Try-outs 2023 ›

CF 104415J - Jagged Roads

We are given a directed or undirected weighted graph depending on the statement’s interpretation, where each edge does not contribute additively to a path cost, but multiplicatively. A path’s total cost is the product of all edge weights along it.

Practice › Codeforces Solutions › IME++ Starters Try-outs 2023 ›

CF 104415I - Impressing the Captain

We are given a sequence of integers, and we process it from left to right. While scanning, we maintain how many times each value has already appeared.

Practice › Codeforces Solutions › IME++ Starters Try-outs 2023 ›

CF 104415H - How do you spell this?

We are given a fixed dictionary of strings. Each string can be thought of as a path in a character tree, where every character leads to the next branch. After building this structure, we are asked to answer multiple queries.

Practice › Codeforces Solutions › IME++ Starters Try-outs 2023 ›

CF 104415G - Graphical Nightmare

We are given an undirected weighted graph. From this graph, we are asked to construct a minimum spanning tree, and then consider the tree as an unrooted structure where distances are shortest-path distances along tree edges.

Practice › Codeforces Solutions › IME++ Starters Try-outs 2023 ›

CF 104415F - Frisbee Training

The task describes a simple physical situation where a frisbee is thrown from the origin and lands at a point $(x, y)$. A player named Asfora can catch it only if he is able to run far enough before it lands.

Practice › Codeforces Solutions › IME++ Starters Try-outs 2023 ›

CF 104415E - Elevator Crisis

We are given a graph whose vertices are identified by unique integer labels. Some labels in the range from 1 up to a maximum value may not correspond to any actual vertex. The graph also contains undirected edges between these labeled vertices.

Practice › Codeforces Solutions › IME++ Starters Try-outs 2023 ›

CF 104415D - Daydreaming Strings

We are given several independent test cases. In each test case, there are two strings, and the task is to merge them into one string and then rearrange the characters of this merged string so that they appear in sorted order according to the standard lexicographic order of…

Practice › Codeforces Solutions › IME++ Starters Try-outs 2023 ›

CF 104415C - Candy Shop

We are given a list of numbers, each representing how many candies a student is willing to accept in a purchase. The shop is processing students in some order, but we are free to choose the order in which we satisfy them.

Practice › Codeforces Solutions › IME++ Starters Try-outs 2023 ›

CF 104415A - Attendance Points

We are given a sequence of attendance points for a series of classes that must be attended strictly from the first class onward, without skipping or starting from the middle.

Practice › Codeforces Solutions › IME++ Starters Try-outs 2023 ›

CF 104415B - Beached Cannons

We are given a quadratic curve that is known to pass through the origin and two additional points in the plane. In other words, the parabola is uniquely determined by three points, one of which is fixed at (0, 0), and the other two are provided in the input.