LU ICPC Selection Contest 2023

13 problems from LU ICPC Selection Contest 2023 (contest 104755), difficulty -. 13/13 solutions verified against sample I/O.

13 items

LU ICPC Selection Contest 2023

ICPC/IOI | 13 problems | 13/13 verified | Difficulty - | 11m 56s

#	Problem	Time	✓
A	Poster	49s	✓
B	Checkmate	48s	✓
C	Flipping	52s	✓
D	Railroads	1m 17s	✓
E	T-shirt	1m 1s	✓
F	Pinholes	1m 12s	✓
G	Respect	40s	✓
H	Triangles	47s	✓
I	Loginess	1m 14s	✓
J	Arcology	45s	✓
K	Quadroku	52s	✓
L	Reconstruction	47s	✓
M	Hexagons	52s	✓

Practice › Codeforces Solutions › LU ICPC Selection Contest 2023 ›

CF 104755F - Pinholes

We are working in a one-dimensional geometric setup where the vertical structure is fixed but the horizontal placement matters. There is a ceiling line at height 2, a floor at height 0, and a middle “screen” at height 1 that contains fixed holes at given x-coordinates.

Practice › Codeforces Solutions › LU ICPC Selection Contest 2023 ›

CF 104755B - Checkmate

We are given a single black king placed somewhere on an otherwise empty 8 by 8 chessboard. Our task is to place some white pieces, chosen from the standard set of chess pieces excluding quantity limits, so that the black king is checkmated.

Practice › Codeforces Solutions › LU ICPC Selection Contest 2023 ›

CF 104755L - Reconstruction

We are given a hidden convex polygon with $n$ vertices. Instead of being shown the polygon directly, we receive a multiset of geometric “snapshots”, where each snapshot is a triangle formed by choosing three vertices of the polygon and recording their coordinates.

Practice › Codeforces Solutions › LU ICPC Selection Contest 2023 ›

CF 104755M - Hexagons

We are working on an infinite hexagonal grid where each cell has six neighbors and distance is measured as the minimum number of edge-to-edge moves between hexagons. The grasshopper starts at the origin and performs an infinite sequence of jumps.

Practice › Codeforces Solutions › LU ICPC Selection Contest 2023 ›

CF 104755K - Quadroku

We are given a partially filled 4 by 4 grid that must be completed into a valid “quadruple Sudoku” variant. Each cell contains a digit from 1 to 4, except for some cells which are zero and must be filled. The rules are simple but strict.

Practice › Codeforces Solutions › LU ICPC Selection Contest 2023 ›

CF 104755I - Loginess

We are given a directed graph where every vertex carries a positive integer label. Each directed edge from a vertex (u) to a vertex (v) contributes a weight defined as (log{au}(av)).

Practice › Codeforces Solutions › LU ICPC Selection Contest 2023 ›

CF 104755J - Arcology

We are given an $n times m$ grid, where each cell represents a vertical stack of unit cubes forming a tower of height $h{i,j}$. Think of each cell as a column with discrete levels from 1 up to $h{i,j}$.

Practice › Codeforces Solutions › LU ICPC Selection Contest 2023 ›

CF 104755H - Triangles

We are given a collection of straight lines in the plane. Every line is guaranteed to be one of three special orientations: horizontal lines of the form $y = c$, vertical lines of the form $x = c$, and diagonal lines of the form $x + y = c$.

Practice › Codeforces Solutions › LU ICPC Selection Contest 2023 ›

CF 104755G - Respect

We are given a fixed modulus $n$ and a set $A subseteq {1,2,dots,n}$ of size at most 40. From this set we consider all of its subsets.

Practice › Codeforces Solutions › LU ICPC Selection Contest 2023 ›

CF 104755D - Railroads

We are given a line of stations numbered from 1 to n. From every station i there are exactly two outgoing roads. Each road either sends the train back to station 1 or forward to station i + 1, except that from station n both roads always go to station 1.

Practice › Codeforces Solutions › LU ICPC Selection Contest 2023 ›

CF 104755E - T-shirt

We are given an $n times n$ grid of unit squares, but the actual objects we work with are the grid intersection points, i.e. the $(n+1) times (n+1)$ lattice of vertices. Between adjacent vertices there are unit edges, forming the standard square grid graph.

Practice › Codeforces Solutions › LU ICPC Selection Contest 2023 ›

CF 104755C - Flipping

We are given a rectangular grid where each cell contains either 0 or 1. We start from the top-left cell and must output a sequence of moves on the grid.

Practice › Codeforces Solutions › LU ICPC Selection Contest 2023 ›

CF 104755A - Poster

We are given a short poster text and a pen that can write using three fixed colors. Each color has a limited capacity measured in how many characters it can be used for.