Technocup 2022 - Elimination Round 1

8 problems from Technocup 2022 - Elimination Round 1 (contest 1583), difficulty 800-3300. 1/8 solutions verified against sample I/O.

8 items

Technocup 2022 - Elimination Round 1

Special | 8 problems | 1/8 verified | Difficulty 800-3300 | 40m 43s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Windblume Ode	800	math, number-theory	14,380	4m 53s
B	Omkar and Heavenly Tree	1200	constructive-algorithms, trees	13,250	5m 16s
C	Omkar and Determination	1700	data-structures, dp	7,439	2m 16s	✓
D	Omkar and the Meaning of Life	1800	constructive-algorithms, greedy, interactive	5,934	5m 5s
E	Moment of Bloom	2200	constructive-algorithms, dfs-and-similar, graph-matchings	2,485	6m 39s
F	Defender of Childhood Dreams	2500	bitmasks, constructive-algorithms, divide-and-conquer	1,536	4m 38s
G	Omkar and Time Travel	3000	data-structures, math	496	4m 59s
H	Omkar and Tours	3300	data-structures, divide-and-conquer, sortings	406	6m 57s

Practice › Codeforces Solutions › Technocup 2022 - Elimination Round 1 ›

CF 1583H - Omkar and Tours

We are given a tree of cities. Each city has a fixed value called enjoyment. Each road connects two cities and has two properties: a capacity and a toll. A group query gives a starting city and a number of vehicles.

Practice › Codeforces Solutions › Technocup 2022 - Elimination Round 1 ›

CF 1583E - Moment of Bloom

We are given a connected undirected graph where every edge initially has weight 0. We then receive a sequence of queries, each query specifying two vertices. For each query, we must choose a simple path between its endpoints and add 1 to every edge along that path.

Practice › Codeforces Solutions › Technocup 2022 - Elimination Round 1 ›

CF 1583G - Omkar and Time Travel

Each task has two special moments: the moment Okabe learns about it, and the earlier time at which it should actually be completed. When he learns about a task, he either confirms it is already done correctly, or he is forced to jump back in time to fix it immediately.

Practice › Codeforces Solutions › Technocup 2022 - Elimination Round 1 ›

CF 1583F - Defender of Childhood Dreams

We are given a complete directed acyclic graph on the vertices from 1 to n, where every pair (i, j) with i < j has a directed edge from i to j.

Practice › Codeforces Solutions › Technocup 2022 - Elimination Round 1 ›

CF 1583B - Omkar and Heavenly Tree

We are asked to construct a tree on $n$ labeled nodes, where a tree means a connected graph with exactly $n-1$ edges and a unique simple path between every pair of nodes. Alongside this, we are given $m$ constraints.

Practice › Codeforces Solutions › Technocup 2022 - Elimination Round 1 ›

CF 1583D - Omkar and the Meaning of Life

We are trying to recover an unknown permutation of the numbers from 1 to n. We never see this permutation directly. Instead, we can probe it using a query mechanism that mixes our chosen array with the hidden permutation in a very specific way.

Practice › Codeforces Solutions › Technocup 2022 - Elimination Round 1 ›

CF 1583A - Windblume Ode

We are given several independent test cases. In each test case there is an array of distinct positive integers, and the task is to choose as many elements as possible such that the sum of the chosen elements is not prime.

Practice › Codeforces Solutions › Technocup 2022 - Elimination Round 1 ›

CF 1583C - Omkar and Determination

We are given a rectangular board where each cell is either blocked by an X or empty. From an empty cell we may move only upward or leftward. A cell is called exitable if some sequence of such moves lets us leave the grid. The question is not to simulate those moves.