Heltion Contest 1

12 problems from Heltion Contest 1 (contest 103914), difficulty -. 11/12 solutions verified against sample I/O.

12 items

Heltion Contest 1

Special | 12 problems | 11/12 verified | Difficulty - | 10m 17s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Puzzle: X-Sums Sudoku				45s	✓
B	Puzzle: Patrick's Parabox				54s	✓
C	Puzzle: Hearthstone				47s	✓
D	Poker Game: Decision				59s	✓
E	Poker Game: Construction				54s	✓
F	Longest Common Subsequence				57s	✓
G	Lexicographic Comparison				48s	✓
H	Expression Evaluation				54s	✓
I	Equivalence in Connectivity				1m 21s	✓
J	Symmetry: Tree				53s	✓
K	Symmetry: Convex				23s
L	Symmetry: Closure				42s	✓

Practice › Codeforces Solutions › Heltion Contest 1 ›

CF 103914L - Symmetry: Closure

We are given a collection of lines in the plane. Each line acts like a reflection axis, and we are interested in sets of points that remain consistent under reflection across every one of these lines.

Practice › Codeforces Solutions › Heltion Contest 1 ›

CF 103914I - Equivalence in Connectivity

We are given not one graph but a sequence of graphs that evolve from each other. The first graph is explicitly constructed, and every subsequent graph is obtained from an earlier one by a single edge insertion or deletion.

Practice › Codeforces Solutions › Heltion Contest 1 ›

CF 103914J - Symmetry: Tree

We are given an undirected tree, and the task is to place each vertex at an integer grid point so that when edges are drawn as straight line segments, the drawing behaves like a clean planar tree embedding with no crossings or unintended intersections.

Practice › Codeforces Solutions › Heltion Contest 1 ›

CF 103914K - Symmetry: Convex

We are given a strictly convex polygon with vertices listed in counterclockwise order. From this polygon, we look at a growing sequence of prefixes: the polygon formed by the first 3 vertices, then the first 4, and so on until all n vertices.

Practice › Codeforces Solutions › Heltion Contest 1 ›

CF 103914H - Expression Evaluation

We are not asked to compute anything for the input. The input is only a seed that the checker uses to generate test expressions. Our task is to output a fixed 1024-word program, i.e.

Practice › Codeforces Solutions › Heltion Contest 1 ›

CF 103914G - Lexicographic Comparison

We are working with two evolving permutations over a set of positions from 1 to n. Initially, both permutations are identical to the identity permutation. One permutation, call it a, can be modified by swapping values at two positions.

Practice › Codeforces Solutions › Heltion Contest 1 ›

CF 103914F - Longest Common Subsequence

We are given two sequences of integers, but neither sequence is provided directly. Instead, both are produced by repeatedly applying the same quadratic recurrence modulo a fixed value.

Practice › Codeforces Solutions › Heltion Contest 1 ›

CF 103914E - Poker Game: Construction

We are given two players, Alice and Bob, each starting with exactly two known cards from a standard 52-card deck. In addition, six community cards will be chosen from the remaining deck.

Practice › Codeforces Solutions › Heltion Contest 1 ›

CF 103914D - Poker Game: Decision

We are given a complete poker situation involving ten known cards. Alice starts with two private cards, Bob starts with two private cards, and there are six shared community cards on the table. The players do not draw from an unknown deck, everything is already revealed.

Practice › Codeforces Solutions › Heltion Contest 1 ›

CF 103914A - Puzzle: X-Sums Sudoku

We are dealing with a very rigidly structured Sudoku-like construction, but the actual task is not to solve a Sudoku.

Practice › Codeforces Solutions › Heltion Contest 1 ›

CF 103914B - Puzzle: Patrick's Parabox

We are given a grid-based puzzle that behaves like a modified Sokoban system with two special entities: a player and a box. Both start on distinct floor cells, and each has a designated target cell.

Practice › Codeforces Solutions › Heltion Contest 1 ›

CF 103914C - Puzzle: Hearthstone

We are building a sequence of operations that simulate a system with hidden “secret types” from 1 to n. At any moment there is a set of secrets currently present in a zone. However, the crucial complication is that we do not actually know which secret each add refers to.