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 results3,689 problems
| Title | Level | Topics | Solved | Time limit | Memory limit | Judge |
|---|---|---|---|---|---|---|
| Run, RunFind the maximum distance covered in N minutes of running and forced resting under a fatigue cap M, using dynamic programming over run-rest blocks. | Medium6 | Dynamic programmingPrefix sum+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Garden PruningFind the minimum number of edge cuts needed to prune a tree down to exactly m vertices while keeping it connected. | Medium6 | Dynamic programmingTree+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Strange KeyboardGiven a string on a cursor-based keyboard, find the minimum Left/Right/Enter presses needed to print every character in alphabetical order. | Medium6 | Dynamic programmingGreedy+2 | No attempts yet | 2s | 128 MB | Judgeable |
| Making a RectangleGiven up to 16 sticks, choose four disjoint groups forming two equal-length pairs of sides to maximize the rectangle's area, or return -1 if impossible. | Medium6 | Bit manipulationDynamic programming+2 | No attempts yet | 2s | 256 MB | Judgeable |
| Painting RoofsGiven a tree of houses and M paint costs, assign a color to every house minimizing total cost so that adjacent houses have different colors. | Medium6 | Dynamic programmingTree+2 | No attempts yet | 2s | 128 MB | Judgeable |
| Turning Off the LightsGiven a row of L bulbs and a fixed T-slot switch device that can be pressed at any aligned position any number of times, find the minimum number of bulbs left on. | Medium6 | Dynamic programmingBit manipulation+2 | No attempts yet | 2s | 128 MB | Judgeable |
| Partitioning for Fun and ProfitGiven m, n and k, output the k-th lexicographically smallest partition of m into n non-decreasing positive parts. | Medium6 | CombinatoricsDynamic programming+2 | No attempts yet | 2s | 128 MB | Judgeable |
| HarvestFind the maximum weighted profit from repeatedly harvesting a plant from either end of a row, where each harvest's value is multiplied by its pick order. | Medium6 | Dynamic programmingArray+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Counting Full Binary TreesCount full binary trees with exactly n nodes and height exactly k, modulo 9901, using a height-bounded DP and subtraction trick. | Medium6 | Dynamic programmingTree+2 | No attempts yet | 2s | 128 MB | Judgeable |
| Word GameGiven a string and a dictionary of words, find the minimum number of characters to delete from the string so the rest is a concatenation of dictionary words in order. | Medium6 | Dynamic programmingString matching+2 | No attempts yet | 2s | 128 MB | Judgeable |
| Rock-Paper-ScissorsCompute, as a reduced fraction, the probability that Hangseung reaches K round wins before Dongju in at most N rounds of rock-paper-scissors with ties possible. | Medium6 | Dynamic programmingProbability+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Dice Battle GameGiven a defender count, simulate probabilistic dice battles to find the minimum starting attacker count achieving at least 50% win probability. | Medium6 | Dynamic programmingProbability+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Greedy PandaFind the longest strictly increasing path through adjacent cells in an n x n grid using memoized DFS. | Medium6 | DFSDynamic programming+1 | No attempts yet | 2s | 256 MB | Judgeable |
| Critical PathOn a DAG, find the longest path length from source to target, then count edges that lie on at least one such longest path. | Medium6 | Dynamic programmingTopological sort+1 | No attempts yet | 2s | 512 MB | Judgeable |
| Excellent VillagesGiven a tree with village populations, choose a maximum-weight independent dominating set (no two chosen villages adjacent, every unchosen village adjacent to a chosen one). | Medium6 | Dynamic programmingTree+1 | No attempts yet | 2s | 128 MB | Judgeable |
| RaceGiven n checkpoints with scores that must be visited in increasing index order from and back to the origin, find the maximum score achievable within a runner's distance budget, for multiple runners. | Medium6 | Dynamic programmingGeometry+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Longest Arithmetic ProgressionGiven up to 2000 nonnegative integers, find the maximum size subset that can be reordered into an arithmetic progression. | Medium6 | Dynamic programmingSorting+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Largest L ShapeGiven a binary grid, find the maximum-area L-shape (union of two rectangles sharing a lower-left corner, wider base and taller top) made entirely of 1-cells. | Medium6 | Dynamic programmingMatrix+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Unsweet CookieChoose up to K starting points for length-D intervals over a timeline to cover the maximum number of given points. | Medium6 | GreedyBinary search+1 | No attempts yet | 2s | 512 MB | Judgeable |
| Atomic EnergyGiven a forest built from energy-state vertices connected by edges whose weight equals a proton energy, pick an independent set of vertices maximizing the sum of values (weighted maximum independent set on a forest). | Medium6 | Dynamic programmingTree+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Multiplication GameDetermine, given a real number X and up to 6 multiplier cards at most 0.9, which player forces X below or equal to 1 first under optimal play. | Medium6 | Game theoryMath+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Card GameGiven 9 piles of 4 cards, compute the probability that repeatedly removing a uniformly random matching-rank pair of top cards clears all cards. | Medium6 | ProbabilityDynamic programming+1 | No attempts yet | 2s | 128 MB | Judgeable |
| ElevatorChoose elevator stop floors in a 31-story building to minimize the last employee's arrival time, given elevator move/stop costs and stair costs. | Medium6 | Dynamic programmingGreedy+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Water Pipe ConstructionSelect a subset of pipes with lengths summing exactly to D that maximizes the minimum capacity among chosen pipes. | Medium6 | Dynamic programmingGreedy+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Palindrome PartitionGiven a lowercase string up to length 2000, find the minimum number of palindromic substrings it can be partitioned into. | Medium6 | Dynamic programmingString | No attempts yet | 2s | 128 MB | Judgeable |
| CiphertextGiven up to 40 positive integers and a target K, find a subset (as a bitstring) whose sum equals K, exploiting the small total sum with meet-in-the-middle or subset-sum search. | Medium6 | Dynamic programmingBit manipulation+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Number of MultisetsGiven multiplicities of values from 1 to T among A numbers, count multisets of size K for S≤K≤B modulo 1,000,000. | Medium6 | Dynamic programmingCombinatorics+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Shortest Uncommon SubsequenceGiven two strings, compute the length of the shortest subsequence of A that is not a subsequence of B. | Medium6 | Dynamic programmingString | No attempts yet | 2s | 128 MB | Judgeable |
| Stacking DiceGiven N dice with fixed opposite-face pairs, choose orientations so that stacked dice match top-to-bottom faces and maximize the sum of one vertical column of side numbers. | Medium6 | Dynamic programmingSimulation+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Robot NavigationGiven an N x M grid, find the maximum sum path from top-left to bottom-right moving only left, right, or down without revisiting cells. | Medium6 | Dynamic programmingMatrix+1 | No attempts yet | 1s | 512 MB | Judgeable |
| Palindrome PathsCount length-L walks on an N x N grid with 8-directional moves whose visited digit sequence forms a palindrome. | Medium6 | Dynamic programmingMatrix+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Reasonable PathsGiven a weighted undirected graph, count paths from vertex 1 to vertex 2 where each step moves to a vertex strictly closer to vertex 2 by shortest-path distance. | Medium6 | Shortest pathGraph+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Molecule DecompositionFind the minimum number of edge cuts on a tree needed to isolate a connected subtree of exactly M nodes. | Medium6 | TreeDynamic programming+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Find the K-th Pinary NumberGiven K up to 10^18, output the K-th smallest binary string with no leading zero and no two consecutive 1s, treated as a number by value order. | Medium6 | Dynamic programmingCombinatorics+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Divide IntervalsSelect exactly M non overlapping, non adjacent intervals from an array of up to 100 integers to maximize the total sum. | Medium6 | Dynamic programmingArray | No attempts yet | 2s | 128 MB | Judgeable |
| GPS EncodingGiven a letter permutation encoding numbers 0-25, find the shortest way to encode a digit string as letters using single digits or valid two-digit pairs, breaking ties by lexicographically largest result. | Medium6 | Dynamic programmingGreedy+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Making a TriangleGiven up to 40 sticks, partition all of them into three groups whose summed lengths form a triangle, maximizing the triangle's area via Heron's formula. | Medium6 | Dynamic programmingCombinatorics+1 | No attempts yet | 2s | 128 MB | Judgeable |
| ChopsticksGiven N chopstick lengths, pick 3K of them and group into K triples to minimize the sum of squared differences between the two smallest lengths in each triple. | Medium6 | Dynamic programmingSorting+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Mole CatchingGiven N moles with positions and appearance times, find the maximum number Jeongeun can catch by moving at speed at most S from origin at time 0. | Medium6 | Dynamic programmingSorting+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Safe Drop TestGiven N floors and K identical safes, compute the minimum number of drops needed in the worst case to find the critical breaking floor. | Medium6 | Dynamic programmingBinary search+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Death NoteGiven word lengths that must be placed in order into fixed-width rows with single spaces between words, minimize the sum of squared leftover cells for all rows except the last. | Medium6 | Dynamic programmingGreedy | No attempts yet | 2s | 128 MB | Judgeable |
| Monodigital ExpressionCompute, for repeated digit K and concatenations plus arithmetic operators, the minimum number of K digits needed to build each queried integer (or report NO if it exceeds 8). | Medium6 | Dynamic programmingMath+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Base StationsGiven points off a line, place axis-aligned squares centered on the x-axis to cover all points while minimizing the total side length sum. | Medium6 | Dynamic programmingSorting+2 | No attempts yet | 2s | 128 MB | Judgeable |
| Seat ArrangementCount the ways to seat N-1 ticket holders into N seats, given one free seat, so that each person sits in their own, adjacent, or the free seat. | Medium6 | Dynamic programmingCombinatorics+1 | No attempts yet | 2s | 128 MB | Judgeable |
| GeneFind the maximum-length subsequence of a DNA string that can be built by the given nested and concatenated matching-pair grammar (like balanced parentheses with a/t and g/c pairs). | Medium6 | Dynamic programmingString | No attempts yet | 2s | 128 MB | Judgeable |
| String ReconstructionCount length-L strings over an alphabet such that every length-k substring belongs to a given allowed set, solved via automaton/DP over overlaps. | Medium6 | Dynamic programmingString+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Word ChainGiven up to 16 vowel-only words, chain them by matching first and last letters without repeats to maximize the total length used. | Medium6 | Bit manipulationDynamic programming+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Minimum Edit Distance 2Compute the minimum number of insert, delete, replace, and adjacent-swap operations to transform string X into string Y. | Medium6 | Dynamic programmingString | No attempts yet | 2s | 128 MB | Judgeable |
| Team Running SelectionSelect a subset of students whose heights sum exactly to H while maximizing the minimum running speed among chosen members. | Medium6 | Dynamic programmingBinary search+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Phone Number MnemonicsFind the minimum number of dictionary words whose digit encodings concatenate to exactly match a given phone number, using the letter to digit telephone mapping. | Medium6 | Dynamic programmingString matching+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Survival and EscapeChoose for each time-ordered box whether to eat it for HP or stack it for height, to survive as long as possible while reaching stack height D as early as possible. | Medium6 | Dynamic programmingGreedy+1 | No attempts yet | 1s | 128 MB | Judgeable |
| FarmerGiven a budget Q of cypress trees selectable from cyclic gardens and linear furrows, maximize total olive trees gained where a full garden gives n olives but a partial selection from a garden or any furrow segment gives one less than the count chosen. | Medium6 | Dynamic programmingGreedy | No attempts yet | 2s | 128 MB | Judgeable |
| Making Numbers EqualGiven a line of n numbers, compute the minimum number of block-increment operations (merging equal adjacent runs) needed to make all elements equal. | Medium6 | Dynamic programmingArray+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Distances Between Leaf VerticesGiven consecutive-leaf distances of an inorder-numbered binary tree, compute the distance between two arbitrary leaves using a sparse-table style max-range query derived from LCA depth relations. | Medium6 | TreeSegment tree+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Collecting ItemsCount monotone right/up paths from bottom-left to top-right on a grid that must pass through every item cell and avoid obstacle cells. | Medium6 | CombinatoricsDynamic programming+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Sua's Candy BasketsGiven baskets on a line each decaying one candy per time unit, find the maximum total candy collectible starting from position 0 with optimal movement order. | Medium6 | Dynamic programmingGreedy+1 | No attempts yet | 1s | 512 MB | Judgeable |
| Piggy BanksGiven N, choose the order of incrementing two counters from (1,1) to (N,N) so that concatenating the pair as a number gives a prime as often as possible, and output the maximum count. | Medium6 | Dynamic programmingMath+1 | No attempts yet | 1s | 128 MB | Judgeable |
| 2012 End of the WorldGiven N, P, V, find the minimum total time to reduce N members to one opinion via recursively splitting into groups that each meet at cost k*P+V. | Medium6 | MathDynamic programming+1 | No attempts yet | 1s | 128 MB | Judgeable |
| BulbsGiven N colored bulbs where changing one bulb also flips its contiguous same-colored neighbors, find the minimum number of changes to make all bulbs one color (classic zuma-like merging interval DP). | Medium6 | Dynamic programmingArray | No attempts yet | 1s | 128 MB | Judgeable |
| Grid GameGiven an M×N grid of black and white stones, compute the minimum number of monochromatic-region flood-fill flips needed to make the whole grid one color. | Medium6 | BFSGraph+1 | No attempts yet | 2s | 256 MB | Judgeable |
| Pebble Game of ChanceCount the sequences of N wheel spins whose cumulative pebble cost never exceeds K, modulo 42043. | Medium6 | Dynamic programmingMath+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Rescuing the PrincessCount round trips from Yusi Island to Hooper Island and back on a line, using each island's directional-strength springboard at most once except the start, modulo 1000. | Medium6 | Dynamic programmingArray+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Exhibition HallOrder stacked paintings of equal width but different heights front to back to maximize the total price of paintings whose exposed visible height is at least S. | Medium6 | GreedySorting+1 | No attempts yet | 1s | 256 MB | Judgeable |
| Rotating Dining TableGiven three ordered dish requests on a rotating table shared by father, mother, and Hyeon at fixed offsets, find the minimum total rotation steps to satisfy all sequences. | Medium6 | Dynamic programmingSimulation+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Food ChainGiven N intervals, find the longest chain where each interval strictly contains the next (with ties allowed on one endpoint), essentially a longest chain problem solvable via sorting and LIS-style binary search. | Medium6 | Binary searchSorting+1 | No attempts yet | 1s | 256 MB | Judgeable |
| Social Network ServiceGiven a friendship tree, find the minimum dominating set size so every non-selected person has all neighbors selected. | Medium6 | TreeDynamic programming+1 | No attempts yet | 3s | 256 MB | Judgeable |
| Switches and BulbsGiven two orderings of numbers 1..N, find the longest set of wires that pairwise don't cross, which reduces to longest increasing subsequence with reconstruction. | Medium6 | Dynamic programmingBinary search+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Board GameGiven a colored card sequence and a colored graph, find a walk starting at village 1 that uses cards in order to maximize color matches with traversed roads. | Medium6 | Dynamic programmingGraph+1 | No attempts yet | 1s | 128 MB | Judgeable |
| DNA SimilarityFind substrings of two DNA sequences that maximize a local sequence-alignment score with custom match and mismatch/gap penalties, and output the score and substrings. | Medium6 | Dynamic programmingString | No attempts yet | 1s | 128 MB | Judgeable |
| Small LocomotivesChoose three disjoint consecutive-car segments (each up to a fixed length) from a train to maximize total passengers carried. | Medium6 | Dynamic programmingPrefix sum+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Police CarsAssign a sequence of incidents to one of two police cars moving along Manhattan-distance shortest paths so that total travel distance is minimized, and output the assignment. | Medium6 | Dynamic programmingGreedy+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Car Race MaintenanceGiven a maximum travel range and per-station maintenance times, select a minimum-cost subset of stations so consecutive gaps never exceed the range, and output the chosen stations. | Medium6 | Dynamic programmingGreedy+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Build the Tallest TowerSelect and order bricks with strictly increasing area and weight from bottom to top to maximize total height, then output the chosen brick indices top to bottom. | Medium6 | Dynamic programmingSorting+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Maximum Cycle Value of 1Given n and k, count permutations of 1..n whose cycle containing element 1 has maximum element exactly k. | Medium6 | CombinatoricsMath+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Recursive Palindrome PartitionsCount recursive palindrome partitions of N, where a partition is valid if it is a palindrome and both halves are recursively valid. | Medium6 | Dynamic programmingRecursion+2 | No attempts yet | 1s | 128 MB | Judgeable |
| Tile FillingCount the number of ways to tile a 4×N board with 2×1 dominoes for multiple queries, bounded so the answer fits in a 32-bit integer. | Medium6 | Dynamic programmingMath+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Press to UnlockCount the number of ordered sequences of disjoint nonempty subsets (a set partition of any subset of buttons into an ordered sequence of blocks) for given B up to 11. | Medium6 | CombinatoricsMath+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Childhood Toy BoxesCount subsets of N boxes (as bitmasks over M<=20 toy types) whose union covers all M types, modulo 1e9+7. | Medium6 | Bit manipulationDynamic programming+2 | No attempts yet | 2s | 128 MB | Judgeable |
| DNA DiscoveryGiven a binary string, find the minimum number of single-character flips or whole-prefix flips needed to turn every character into A. | Medium6 | GreedyDynamic programming+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Conveyor BeltGiven worker base times and car complexities on a pipelined assembly line, compute the minimum total completion time respecting sequential handoff constraints. | Medium6 | Dynamic programmingGreedy+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Counting Pipe InstallationsCount the ways to lay a single connected pipe path with six pipe shapes from the top-left entry to the bottom-right exit through a grid with blocked cells, modulo 10007. | Medium6 | Dynamic programmingMatrix+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Difficulty-Based Problem SelectionCount ways to pick exactly one problem per difficulty level 1..N given fixed-difficulty and flexible dual-difficulty problem pools, modulo 1e9+7. | Medium6 | Dynamic programmingCombinatorics+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Nikola's JumpsFind the minimum-cost path to square N where forward jumps grow by 1 each time and backward jumps match the last forward jump length. | Medium6 | Dynamic programmingGraph+1 | No attempts yet | 1s | 128 MB | Judgeable |
| BirthdayGiven N intervals, find and print the longest chain of distinct intervals where each contains the next one. | Medium6 | Dynamic programmingSorting+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Digit Sum in an IntervalCount integers in [A,B] with a given digit sum and output the smallest such integer, for bounds up to 10^15. | Medium6 | Dynamic programmingMath+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Valid Bracket StringsCount ways to replace question marks in a bracket string with one of three bracket types so it becomes a valid nested bracket sequence, output last five digits. | Medium6 | Dynamic programmingString | No attempts yet | 1s | 128 MB | Judgeable |
| ConfusionCount permutations of 1..N with exactly C inversions, modulo 1e9+7, using DP with prefix sums for the given constraints. | Medium6 | Dynamic programmingPrefix sum+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Counting Bicycle Race RoutesCount directed paths from village 1 to village 2 in a graph, printing the last 9 digits or 'inf' if a reachable cycle makes the count infinite. | Medium6 | Topological sortDynamic programming+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Agent Mission AssignmentGiven an N x N matrix of success percentages, assign one mission per agent to maximize the product of chosen probabilities, essentially an assignment problem with a product (log-sum) objective. | Medium6 | Dynamic programmingBit manipulation+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Number of PlusesCount all plus-shaped patterns of odd size at least 3 in an N x N binary matrix, where every cell outside the cross must be 0. | Medium6 | Dynamic programmingMatrix+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Dot Matrix PrinterGiven a string, find the minimum number of SET/NEXT/WRITE printer commands needed to output it, where NEXT temporarily overrides the next WRITE. | Medium6 | Dynamic programmingString+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Apples and BananasFind a monotone down/right/diagonal path in an RxC grid to maximize apples below plus bananas above it, with R,C up to 1500. | Medium6 | Dynamic programmingMatrix+1 | No attempts yet | 1s | 256 MB | Judgeable |
| Hangman GameGiven a hidden word, find the order to select each distinct letter starting from A on a circular alphabet dial that minimizes total LEFT/RIGHT/OK button presses. | Medium6 | Dynamic programmingGreedy+2 | No attempts yet | 1s | 128 MB | Judgeable |
| Word DivisionCount the number of ways to split a long word (up to length 300,000) into consecutive substrings all belonging to a dictionary of up to 4000 short words, modulo 1337377. | Medium6 | Dynamic programmingString matching+2 | No attempts yet | 1s | 128 MB | Judgeable |
| Minimum Trailing Zeros PathFind a path from top-left to bottom-right of an N×N grid, avoiding zero cells, that minimizes trailing zeros in the product of visited cells. | Medium6 | Dynamic programmingMatrix+1 | No attempts yet | 1s | 128 MB | Judgeable |
| HugoGiven N tree positions with scheduled apple-fall times, find the maximum number of apples a character starting at the middle square (moving at most one square per second) can catch. | Medium6 | Dynamic programmingGreedy+1 | No attempts yet | 2s | 128 MB | Judgeable |
| Two Subsequences 2Given two strings A and B of length up to 2000, find the shortest string that is a subsequence of A but not a subsequence of B. | Medium6 | Dynamic programmingString+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Mirko's Newspaper TimeGiven jobs with start times and durations that Mirko must greedily choose among on tie-starts while never queuing missed jobs, maximize total idle (newspaper) minutes over the shift via optimal choice, essentially a DP over time with tie-breaking. | Medium6 | Dynamic programmingGreedy+1 | No attempts yet | 1s | 128 MB | Judgeable |
| ShelvesGiven required shelf positions in a grid, choose one ladder placement height per column to minimize the total summed climbing height covering each object from its column or adjacent columns. | Medium6 | Dynamic programmingGreedy+1 | No attempts yet | 1s | 128 MB | Judgeable |
| Arranging CardsGiven C≤4 colors with N cards each in a hand sequence, find the minimum number of single-card moves to reach some arrangement where colors form contiguous ascending-value blocks in any color order. | Medium6 | Dynamic programmingCombinatorics+1 | No attempts yet | 1s | 128 MB | Judgeable |