Lyft Level 5 Challenge 2018 - Final Round

6 problems from Lyft Level 5 Challenge 2018 - Final Round (contest 1044), difficulty 1700-3100. 1/6 solutions verified against sample I/O.

6 items

Lyft Level 5 Challenge 2018 - Final Round

Special | 6 problems | 1/6 verified | Difficulty 1700-3100 | 30m 21s

# Problem Rating Tags Accepted Time ✓
A The Tower is Going Home 1700 binary-search, two-pointers 3,076 10m 12s
B Intersecting Subtrees 1900 dfs-and-similar, interactive, trees 1,708 1m 59s ✓
C Optimal Polygon Perimeter 2100 dp, geometry 1,409 5m 59s
D Deduction Queries 2400 data-structures, dsu 1,186 7m
E Grid Sort 3100 implementation 129 3m 20s
F DFS 2700 data-structures 683 1m 51s
Practice › Codeforces Solutions › Lyft Level 5 Challenge 2018 - Final Round ›

CF 1044D - Deduction Queries

We are dealing with an extremely large conceptual array indexed from 0 up to $2^{30}-1$, but we never actually store its values.
codeforces competitive-programming data-structures dsu Jun 16, 2026
Practice › Codeforces Solutions › Lyft Level 5 Challenge 2018 - Final Round ›

CF 1044F - DFS

We are working with a fixed tree on $n$ vertices.
codeforces competitive-programming data-structures Jun 16, 2026
Practice › Codeforces Solutions › Lyft Level 5 Challenge 2018 - Final Round ›

CF 1044A - The Tower is Going Home

We are given a huge grid, but movement is not about stepping cell by cell. Instead, a rook starts at the bottom-left corner and can teleport along an entire row or column, as long as nothing blocks its straight-line path. There are two kinds of obstacles.
codeforces competitive-programming binary-search two-pointers Jun 16, 2026
Practice › Codeforces Solutions › Lyft Level 5 Challenge 2018 - Final Round ›

CF 1044E - Grid Sort

We are given a small grid, at most 20 by 20, containing a permutation of the numbers from 1 to nm. The goal is to transform this grid into sorted order when read row by row.
codeforces competitive-programming implementation Jun 16, 2026
Practice › Codeforces Solutions › Lyft Level 5 Challenge 2018 - Final Round ›

CF 1044B - Intersecting Subtrees

We are given a tree with n vertices, but there is a twist: there are two different labelings of the same underlying tree. In your view, the vertices are numbered from 1 to n and the edges are given in this numbering.
codeforces competitive-programming dfs-and-similar interactive trees Jun 16, 2026
Practice › Codeforces Solutions › Lyft Level 5 Challenge 2018 - Final Round ›

CF 1044C - Optimal Polygon Perimeter

We are given a convex polygon with its vertices already listed in clockwise order. The geometry is fixed: we cannot move points, only choose subsets of vertices.
codeforces competitive-programming dp geometry Jun 16, 2026