Problems
Pick a problem and write your solution in the built-in editor. The judge runs it against real test cases while you watch, and the wider archive is open to read whenever you like.
Total results1,917 problems
| Title | Level | Topics | Solved | Time limit | Memory limit | Judge |
|---|---|---|---|---|---|---|
| Voronoi DiagramGiven a connected weighted graph and a set of source vertices, assign every point on every edge to its nearest source (smallest index on ties) and report the total length each source owns. | Hard9 | GraphShortest path+2 | No attempts yet | 2s | 1024 MB | Judgeable |
| The SprawlOn an infinite grid, N cities grow one cell per day in index order; sum over all pairs the first day the two cities' territories touch and connect. | Hard9 | GraphBFS+2 | No attempts yet | 5s | 768 MB | Judgeable |
| BoosterFor each query, decide whether the character can travel from checkpoint A to checkpoint B with maximum HP X, given walking drains HP and the booster moves only along axes. | Hard9 | GraphUnion-find+2 | No attempts yet | 8s | 512 MB | Judgeable |
| ConstellationChoose a subset of up to 2e5 points maximizing total brightness so that from any chosen point all others fall in the first or third quadrant, with the nearest point in each occupied quadrant within Chebyshev distance L. | Hard9 | MathGeometry+2 | No attempts yet | 1.5s | 512 MB | Judgeable |
| SatellitesSatellites appear and disappear above a half-disc planet; for each query decide whether two satellites have a common coverage point outside the planet that no other live satellite covers. | Hard9 | GeometryDynamic programming+2 | No attempts yet | 4s | 512 MB | Judgeable |
| Removing Magical TilesGiven trapezoid tiles above the x-axis, find the minimum number of groups where each group is a set of tiles that pairwise overlap. | Hard9 | GreedyGeometry+2 | No attempts yet | 2s | 512 MB | Judgeable |
| Magic TrianglesGiven up to 100000 counter-clockwise triangles, compute the area of their common intersection. | Hard9 | GeometryDivide and conquer+2 | No attempts yet | 2s | 512 MB | Judgeable |
| Mowing MischiefGiven flowers on a grid, pick a longest chain of flowers both paths must visit, then find the minimum area the two monotone paths can sweep. | Hard9 | Dynamic programmingSorting+2 | No attempts yet | 2s | 512 MB | Judgeable |
| The Tallest and Widest CastleChoose which signposts serve as vertices of each floor so the castle has the most floors, then the largest total floor area, then the fewest signposts used, and report each signpost's floor number. | Hard9 | GeometryDynamic programming+2 | No attempts yet | 1s | 512 MB | Judgeable |
| Construction ProjectPlace at most H airports among N towns and connect all towns with axis-parallel roads that avoid M rectangular obstacles, minimizing airport cost times count plus total road length. | Hard9 | Minimum spanning treeGeometry+2 | No attempts yet | 5s | 256 MB | Judgeable |
| ConstellationCount the ways to assign each unlabeled point to constellation A or B so that the two vertex sets can be drawn connected with mutually non-crossing segments. | Hard9 | GeometryCombinatorics+2 | No attempts yet | 1s | 512 MB | Judgeable |
| Nearest PointsCount the integer lattice points in an axis-aligned rectangle whose Euclidean distance to p1 is the minimum among K marked points. | Hard9 | GeometryDivide and conquer+2 | No attempts yet | 2s | 512 MB | Judgeable |
| IneqGiven a finite set S of integer lattice points, decide whether S can be cut out as exactly the integer points lying strictly below every line of some finite family of half-planes. | Hard9 | GeometryMath+2 | No attempts yet | 2s | 512 MB | Judgeable |
| Unseen SegmentsGiven n vertical segments and queries of (west power, east power), find the total length of parts no observer sees through at most that many segments. | Hard9 | GeometrySorting+2 | No attempts yet | 2s | 256 MB | Judgeable |
| Random PointsGiven n points in general position, output 2^n times the expected number of vertices of the convex hull of a uniformly random subset, modulo 1e9+7. | Hard9 | GeometryCombinatorics+2 | No attempts yet | 5s | 512 MB | Judgeable |
| Coalescing ContinentsGiven K rectangles with total area 25 on a 20x20 grid, decide if they can be translated to tile a square, and find the minimum total moves. | Hard10 | Brute forceMath+2 | No attempts yet | 1s | 128 MB | Judgeable |
| CubesCount the orbits of general-purpose chip placements on cube faces under face rotations and cube rearrangement, given a fixed pattern of encoding chips. | Hard10 | CombinatoricsMath+2 | No attempts yet | 1s | 128 MB | Judgeable |