2020, XIII Samara Regional Intercollegiate Programming Contest

8 problems from 2020, XIII Samara Regional Intercollegiate Programming Contest (contest 102569), difficulty -. 5/8 solutions verified against sample I/O.

8 items

2020, XIII Samara Regional Intercollegiate Programming Contest

Special | 8 problems | 5/8 verified | Difficulty - | 15m 4s

#	Problem	Time	✓
A	Array's Hash	1m 20s	✓
B	Bonuses on a Line	1m 36s	✓
D	Lexicographically Minimal Shortest Path	2m 58s
E	Fluctuations of Mana	1m 19s	✓
G	Nuts and Bolts	2m 11s
H	Tree Painting	1m 31s	✓
J	The Battle of Mages	1m 31s
K	Table	2m 38s	✓

Practice › Codeforces Solutions › 2020, XIII Samara Regional Intercollegiate Programming Contest ›

CF 102569K - Table

We have four bars that will become the four legs of a table. Their lengths determine the heights of the four corners of the tabletop because each leg reaches from the floor to the surface.

Practice › Codeforces Solutions › 2020, XIII Samara Regional Intercollegiate Programming Contest ›

CF 102569J - The Battle of Mages

This is an output-only construction problem. There is no input because the task is not to process data, but to print two sets of creature strengths that create a very specific probability relationship.

Practice › Codeforces Solutions › 2020, XIII Samara Regional Intercollegiate Programming Contest ›

CF 102569H - Tree Painting

The tree represents a network of connected vertices. An operation chooses two vertices and colors every vertex and edge on the unique route between them. The goal is to find the smallest number of chosen routes that together cover every part of the tree.

Practice › Codeforces Solutions › 2020, XIII Samara Regional Intercollegiate Programming Contest ›

CF 102569G - Nuts and Bolts

We have two collections of objects. One collection contains nuts and the other contains bolts. Every nut has a unique size, every bolt has a unique size, and the sizes form the same range.

Practice › Codeforces Solutions › 2020, XIII Samara Regional Intercollegiate Programming Contest ›

CF 102569B - Bonuses on a Line

We have a set of bonus locations placed on a number line. The starting position is coordinate 0, and moving one unit of distance always consumes one second. The task is to choose a group of bonuses and visit every chosen location within the available time t.

Practice › Codeforces Solutions › 2020, XIII Samara Regional Intercollegiate Programming Contest ›

CF 102569E - Fluctuations of Mana

The journey consists of visiting magical sources in a fixed order. Each source changes the mage's current mana by a given amount, and the only failure condition is that the mana level drops below zero at any moment.

Practice › Codeforces Solutions › 2020, XIII Samara Regional Intercollegiate Programming Contest ›

CF 102569D - Lexicographically Minimal Shortest Path

The graph describes a network of vertices connected by two-way edges. Every edge has a lowercase letter attached to it. Moving along a path from vertex 1 to vertex n creates a string from the letters encountered on the edges.

Practice › Codeforces Solutions › 2020, XIII Samara Regional Intercollegiate Programming Contest ›

CF 102569A - Array's Hash

The array hash process repeatedly removes the first two values and replaces them with their difference. Instead of simulating these removals, we need to understand what value survives after all operations. The input gives an initial array and a sequence of range additions.