Bubble Cup 11 - Finals [Online Mirror, Div. 1]

5 problems from Bubble Cup 11 - Finals [Online Mirror, Div. 1] (contest 1045), difficulty 2200-3400. 4/5 solutions verified against sample I/O.

5 items

Bubble Cup 11 - Finals [Online Mirror, Div. 1]

Div. 1 | 5 problems | 4/5 verified | Difficulty 2200-3400 | 21m 12s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Last chance	2500	data-structures, flows, graph-matchings	574	4m 32s
C	Hyperspace Highways	2300	dfs-and-similar, graphs, trees	827	3m 39s	✓
F	Shady Lady	3400	geometry, math	114	3m 49s	✓
G	AI robots	2200	data-structures	1,984	2m 33s	✓
J	Moonwalk challenge	2600	data-structures, strings, trees	210	6m 39s	✓

Practice › Codeforces Solutions › Bubble Cup 11 - Finals [Online Mirror, Div. 1] ›

CF 1045J - Moonwalk challenge

The input describes a tree where each edge connects two craters and carries a single lowercase letter. If you walk between any two craters, there is exactly one simple path, and that path naturally produces a string formed by concatenating the edge labels along the way.

Practice › Codeforces Solutions › Bubble Cup 11 - Finals [Online Mirror, Div. 1] ›

CF 1045F - Shady Lady

We are given a fixed set of monomials in two variables, each monomial having the form $x^{ak}y^{bk}$, but with an unknown positive integer coefficient. Before the coefficients are chosen, Ani is allowed to remove at most one monomial.

Practice › Codeforces Solutions › Bubble Cup 11 - Finals [Online Mirror, Div. 1] ›

CF 1045G - AI robots

We are given a set of robots placed on a number line. Each robot sits at a coordinate and has a fixed symmetric visibility range around its position. Inside that range, it can potentially “see” other robots. However, visibility alone is not enough for interaction.

Practice › Codeforces Solutions › Bubble Cup 11 - Finals [Online Mirror, Div. 1] ›

CF 1045A - Last chance

We are given a collection of weapons and a line of ships, and we want to assign each destroyed ship to exactly one weapon. Each weapon has a limited way of interacting with ships, and the goal is to maximize how many ships get assigned and destroyed under those constraints.

Practice › Codeforces Solutions › Bubble Cup 11 - Finals [Online Mirror, Div. 1] ›

CF 1045C - Hyperspace Highways

We are given a connected undirected graph with up to one hundred thousand vertices and up to half a million edges. Each query asks for the shortest path length between two given vertices, measured in number of edges. A crucial extra constraint changes the structure of the graph.