Dynamic programming ladder

Every judgeable DP problem, easiest first

Under construction

Still being built. Things may change

Total results6,390 problems

Zip-line
Hard8
Dynamic programming, Binary search+1
No attempts yet
Time limit
3s
Memory limit
1024 MB
Judgeable
Speedy Turtle
Hard8
Dynamic programming, Bit manipulation+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Chapaev on a Tree
Hard8
Tree, Game theory+2
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Hanyang Cherry Picking Contest
Hard8
Tree, Game theory+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Movable Type Graph
Hard8
Graph, Shortest path+1
No attempts yet
Time limit
1.5s
Memory limit
1024 MB
Judgeable
Pay2Win
Hard8
Dynamic programming, Segment tree+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Galaxy Quest
Hard8
Shortest path, Dynamic programming+1
No attempts yet
Time limit
5s
Memory limit
1024 MB
Judgeable
Rank Promotion
Hard8
Prefix sum, Dynamic programming+1
No attempts yet
Time limit
3s
Memory limit
1024 MB
Judgeable
Task Assignment to Two Employees
Hard8
Graph, Dynamic programming
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Do It Yourself?
Hard8
Tree, Dynamic programming
No attempts yet
Time limit
10s
Memory limit
1024 MB
Judgeable
Sequence and Queries 44
Hard8
Segment tree, Dynamic programming
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Drying Laundry
Hard8
Dynamic programming, Sorting+1
No attempts yet
Time limit
3s
Memory limit
1024 MB
Judgeable
Labelled Paths
Hard8
Dynamic programming, Topological sort+2
No attempts yet
Time limit
15s
Memory limit
1024 MB
Judgeable
Coloring Cards 2
Hard8
Combinatorics, Dynamic programming+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Train Scheduling
Hard8
Sorting, Dynamic programming+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Taking Photos
Hard8
Tree, Dynamic programming+2
No attempts yet
Time limit
8s
Memory limit
1024 MB
Judgeable
Hash Function
Hard8
Bit manipulation, Math+1
No attempts yet
Time limit
3s
Memory limit
1024 MB
Judgeable
Number Theory
Hard8
Number theory, Math+1
No attempts yet
Time limit
7s
Memory limit
1024 MB
Judgeable
Permutation Pattern
Hard8
Dynamic programming, Recursion
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
AC Automaton
Hard8
Tree, Segment tree+1
No attempts yet
Time limit
13s
Memory limit
1024 MB
Judgeable
Tax
Hard8
Graph, Shortest path+2
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
to Pay Respects
Hard8
Dynamic programming, Binary search+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Werewolves
Hard8
Tree, Divide and conquer+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Many LCS
Hard8
Combinatorics, Dynamic programming+1
No attempts yet
Time limit
4s
Memory limit
1024 MB
Judgeable
Median
Hard8
Divide and conquer, Dynamic programming+1
No attempts yet
Time limit
5s
Memory limit
1024 MB
Judgeable
Bipartite Barricade
Hard8
Bit manipulation, Dynamic programming+1
No attempts yet
Time limit
2.5s
Memory limit
1024 MB
Judgeable
Opening Offices
Hard8
Tree, Dynamic programming+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Macaron Kama
Hard8
Dynamic programming, Greedy+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Random Road
Hard8
Dynamic programming, Tree+2
No attempts yet
Time limit
3s
Memory limit
1024 MB
Judgeable
Books
Hard8
Bit manipulation, Dynamic programming
No attempts yet
Time limit
6s
Memory limit
1024 MB
Judgeable
In the cube
Hard8
Dynamic programming, Bit manipulation+1
No attempts yet
Time limit
3s
Memory limit
1024 MB
Judgeable
IQ Test
Hard8
Dynamic programming, Segment tree
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
XOr
Hard8
Bit manipulation, Greedy+2
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
ABC String
Hard8
String, Greedy+1
No attempts yet
Time limit
1s
Memory limit
2048 MB
Judgeable
Range Editing
Hard8
Dynamic programming, Intervals
No attempts yet
Time limit
4s
Memory limit
2048 MB
Judgeable
Merging Cells
Hard8
Dynamic programming, Divide and conquer+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Cowmpetency
Hard8
Dynamic programming, Combinatorics+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Garden 2
Hard8
Dynamic programming, Matrix+1
No attempts yet
Time limit
4s
Memory limit
1024 MB
Judgeable
Eggplant Field Path
Hard8
Dynamic programming, Combinatorics+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Infection Simulation
Hard8
Intervals, Graph+2
No attempts yet
Time limit
1.5s
Memory limit
1024 MB
Judgeable
Moorbles
Hard8
Dynamic programming, Game theory+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Special Dropkick 2
Hard8
Dynamic programming, Greedy+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Pirate Code
Hard8
Dynamic programming, Combinatorics+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Coins
Hard8
Game theory, Combinatorics+1
No attempts yet
Time limit
25s
Memory limit
1024 MB
Judgeable
Escape Route 2
Hard8
Dynamic programming, Binary search+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Fair Distribution
Hard8
Dynamic programming, Number theory+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
The Phoenix That Topples the School
Hard8
Dynamic programming, Stack+2
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
V.I.P.
Hard8
Graph, Dynamic programming+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Discount Event
Hard8
Tree, Dynamic programming+1
No attempts yet
Time limit
4s
Memory limit
1024 MB
Judgeable
Bfs
Hard8
Dynamic programming, Segment tree+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Revenge
Hard8
Dynamic programming, Divide and conquer+2
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Champernowne Substring
Hard8
Dynamic programming, String+2
No attempts yet
Time limit
10s
Memory limit
2048 MB
Judgeable
Binary Tree
Hard8
Tree, Dynamic programming+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Tiles
Hard8
Dynamic programming, Geometry
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Minequake
Hard8
Tree, Dynamic programming+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Sequence
Hard8
Dynamic programming, Shortest path+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Chessboard
Hard8
Combinatorics, Dynamic programming+1
No attempts yet
Time limit
2s
Memory limit
512 MB
Judgeable
Heat Stroke
Hard8
Segment tree, Dynamic programming+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
City Hall
Hard8
Shortest path, Graph+2
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Ninja Delivery
Hard8
Tree, Divide and conquer+2
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Han Yo-won's Infiltration
Hard8
Greedy, Dynamic programming+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Erased ETT
Hard8
Dynamic programming, Tree+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Events Are Approaching (Hard)
Hard8
Dynamic programming, Intervals+1
No attempts yet
Time limit
4s
Memory limit
1024 MB
Judgeable
Union of Segments
Hard8
Dynamic programming, Sorting+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
What Happens When All the Branches Fall From a Tree?
Hard8
Tree, Game theory+2
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Zigzag Histogram Partition
Hard8
Dynamic programming, Segment tree+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Nile
Hard8
Dynamic programming, Sorting+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Hieroglyphs
Hard8
Dynamic programming, Greedy+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Mosaic
Hard8
Dynamic programming, Prefix sum+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Red and Blue Dots 2
Hard8
Dynamic programming, Geometry+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
정다각형을 만들어요
Hard8
Dynamic programming, Tree+2
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Life
Hard8
Dynamic programming, Greedy
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Bingo for the Win!
Hard8
Probability, Combinatorics+2
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Lexicopolis
Hard8
Graph, Dynamic programming+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Aquarelle
Hard8
Dynamic programming, Intervals+1
No attempts yet
Time limit
0.4s
Memory limit
1024 MB
Judgeable
Balatro
Hard8
Dynamic programming, Sorting+2
No attempts yet
Time limit
12s
Memory limit
1024 MB
Judgeable
Job Scheduling
Hard8
Intervals, Dynamic programming+2
No attempts yet
Time limit
4s
Memory limit
1024 MB
Judgeable
Double Deck
Hard8
Dynamic programming, Bit manipulation+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Eradication Sort
Hard8
Dynamic programming, Segment tree+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Panel Optimization (Easy)
Hard8
Graph, Dynamic programming+1
No attempts yet
Time limit
4s
Memory limit
1024 MB
Judgeable
Gahui and Music
Hard8
Dynamic programming, Prefix sum+1
No attempts yet
Time limit
1s
Memory limit
512 MB
Judgeable
Fences Make Good Neighbors
Hard8
Dynamic programming, Geometry
No attempts yet
Time limit
4s
Memory limit
2048 MB
Judgeable
Add One Zero-Weight Edge to Minimize the Sum of Root Distances
Hard8
Tree, DFS+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Blistavost
Hard8
Dynamic programming, Intervals+1
No attempts yet
Time limit
4s
Memory limit
1024 MB
Judgeable
K Subway Stations
Hard8
Tree, Binary search+2
No attempts yet
Time limit
1.5s
Memory limit
1024 MB
Judgeable
Binary Search
Hard8
Graph, Dynamic programming+1
No attempts yet
Time limit
4s
Memory limit
1024 MB
Judgeable
Accumulator Apex
Hard8
Greedy, Dynamic programming+1
No attempts yet
Time limit
3s
Memory limit
2048 MB
Judgeable
East 2 Will Not Come to This Match! 9
Hard8
Combinatorics, Dynamic programming+1
No attempts yet
Time limit
5s
Memory limit
1024 MB
Judgeable
Interstellar Intervals
Hard8
Dynamic programming, String matching
No attempts yet
Time limit
2s
Memory limit
2048 MB
Judgeable
Robot Upgrades
Hard8
Dynamic programming, Combinatorics+1
No attempts yet
Time limit
1s
Memory limit
2048 MB
Judgeable
Independent Set (Max)
Hard8
Tree, Dynamic programming+1
No attempts yet
Time limit
1s
Memory limit
2048 MB
Judgeable
Primal Collection
Hard8
Combinatorics, Tree+1
No attempts yet
Time limit
1s
Memory limit
2048 MB
Judgeable
Narrower Passageway
Hard8
Stack, Probability+2
No attempts yet
Time limit
1s
Memory limit
2048 MB
Judgeable
Heraclosures
Hard8
Dynamic programming, Graph+1
No attempts yet
Time limit
5.5s
Memory limit
2048 MB
Judgeable
Flowers
Hard8
Game theory, Tree+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Adrian the Wonder Child
Hard8
Tree, Dynamic programming+1
No attempts yet
Time limit
2s
Memory limit
2048 MB
Judgeable
Even-dominant Numbers
Hard8
Dynamic programming, Math
No attempts yet
Time limit
3s
Memory limit
2048 MB
Judgeable
Segments Removal
Hard8
Dynamic programming, Segment tree+1
No attempts yet
Time limit
4s
Memory limit
2048 MB
Judgeable
Series Sum
Hard8
Math, Combinatorics+1
No attempts yet
Time limit
2s
Memory limit
2048 MB
Judgeable
Maximize the Minimum
Hard8
Binary search, Dynamic programming+1
No attempts yet
Time limit
4s
Memory limit
2048 MB
Judgeable

Title	Level	Topics	Solved	Time limit	Memory limit	Judge
Zip-lineFor each assumption that one tree has a new height, find the longest strictly increasing subsequence of the trees after that single change.	Hard8	Dynamic programmingBinary search+1	No attempts yet	3s	1024 MB	Judgeable
Speedy TurtleFor each card, count the triples (a, b, c) where a down-right path from a to c exists after all cells of B are blocked, and that path does not pass through b.	Hard8	Dynamic programmingBit manipulation+1	No attempts yet	1s	1024 MB	Judgeable
Chapaev on a TreeFor each vertex as Root, count the games on its descendants where Marina moves first and flicks checkers toward the root, then report how many she wins.	Hard8	TreeGame theory+2	No attempts yet	2s	1024 MB	Judgeable
Hanyang Cherry Picking ContestTwo players alternately take tree vertices by moving to a child of the last taken vertex, and the task is to find the winner under optimal play.	Hard8	TreeGame theory+1	No attempts yet	1s	1024 MB	Judgeable
Movable Type GraphFind the shortest path from vertex 1 to vertex 2 in graph T, where each graph can embed earlier graphs as sub-blocks with chosen entry and exit vertices.	Hard8	GraphShortest path+1	No attempts yet	1.5s	1024 MB	Judgeable
Pay2WinGiven K zone-swap patterns repeated until a boss with H health is defeated, find the start zone that maximizes the minimum skip cost needed to win.	Hard8	Dynamic programmingSegment tree+1	No attempts yet	1s	1024 MB	Judgeable
Galaxy QuestFor each query, find the least fuel needed to fly from planet 1 to a target planet within a time limit, where each highway's fuel cost depends on how long the trip takes.	Hard8	Shortest pathDynamic programming+1	No attempts yet	5s	1024 MB	Judgeable
Rank PromotionGiven n quiz results as Y or N, compute the final rank when a rank rises after any window of at least c quizzes with correct ratio at least p/q, starting from the current rank.	Hard8	Prefix sumDynamic programming+1	No attempts yet	3s	1024 MB	Judgeable
Task Assignment to Two EmployeesAssign each of n tasks to one of two employees and pick the order so that total profit, where skill points grow with each completed task, is maximized.	Hard8	GraphDynamic programming	No attempts yet	2s	1024 MB	Judgeable
Do It Yourself?Each task can be done by its owner or any of the owner's bosses. Find the minimum sum of f_i times (tasks done by i) squared over all employees.	Hard8	TreeDynamic programming	No attempts yet	10s	1024 MB	Judgeable
Sequence and Queries 44For each query m k, find the longest subsequence of the first m elements whose longest increasing subsequence has length at most k.	Hard8	Segment treeDynamic programming	No attempts yet	1s	1024 MB	Judgeable
Drying LaundryEach sheet either hangs on one line (slow time) or spans both lines (fast time). For each line length, find the minimal time to dry all sheets, or report -1.	Hard8	Dynamic programmingSorting+1	No attempts yet	3s	1024 MB	Judgeable
Labelled PathsGiven a DAG whose edge labels are substrings of one string A, find the lexicographically smallest path label from s to every vertex.	Hard8	Dynamic programmingTopological sort+2	No attempts yet	15s	1024 MB	Judgeable
Coloring Cards 2Given the colors of the first row of an N by N grid, sum the number of white patterns over all valid colorings where diagonals match and every row has the same white count.	Hard8	CombinatoricsDynamic programming+1	No attempts yet	1s	1024 MB	Judgeable
Train SchedulingSchedule N trains from two stations on one shared track so opposite-direction trains never overlap, minimizing the total delay past each train's earliest departure.	Hard8	SortingDynamic programming+1	No attempts yet	2s	1024 MB	Judgeable
Taking PhotosPick a closed walk through a tree from room 1 that crosses each corridor twice, so each friend's interval covers both of their rooms; minimize the total interval length.	Hard8	TreeDynamic programming+2	No attempts yet	8s	1024 MB	Judgeable
Hash FunctionGiven n and H, find a 2n-bit number A such that the XOR-and-modular hash h_n(A) equals H.	Hard8	Bit manipulationMath+1	No attempts yet	3s	1024 MB	Judgeable
Number TheoryGiven a huge integer n, write it as an integer combination of repunits o_i (the number with i ones) so that the sum of i times \|x_i\| is minimized.	Hard8	Number theoryMath+1	No attempts yet	7s	1024 MB	Judgeable
Permutation PatternGiven a permutation of length n (n up to 50), count the non-empty subsequences that avoid the 231 pattern.	Hard8	Dynamic programmingRecursion	No attempts yet	2s	1024 MB	Judgeable
AC AutomatonTree nodes are A, C, or ?. After each point update, find the most ancestor-descendant pairs with an A above a C, filling each ? freely.	Hard8	TreeSegment tree+1	No attempts yet	13s	1024 MB	Judgeable
TaxGiven roads where the k-th use of a company's road costs k times that company's tax, find the cheapest shortest path from city 1 to each other city.	Hard8	GraphShortest path+2	No attempts yet	2s	1024 MB	Judgeable
to Pay RespectsGiven a boss fight with regeneration and poison spells, find the maximum total damage when at most K poison casts are allowed.	Hard8	Dynamic programmingBinary search+1	No attempts yet	1s	1024 MB	Judgeable
WerewolvesCount connected subgraphs of a colored tree in which one color makes up strictly more than half of the nodes, modulo 998244353.	Hard8	TreeDivide and conquer+1	No attempts yet	2s	1024 MB	Judgeable
Many LCSGiven K, construct two binary strings of length at most 8848 that have exactly K distinct longest common subsequences.	Hard8	CombinatoricsDynamic programming+1	No attempts yet	4s	1024 MB	Judgeable
MedianCount the ways to fill the unknown values in a sequence so that the recursive three-way magicThrees procedure returns the true median, modulo 10^9 + 7.	Hard8	Divide and conquerDynamic programming+1	No attempts yet	5s	1024 MB	Judgeable
Bipartite BarricadeCount the vertex subsets of a bipartite graph whose total weight is at least t and that some matching fully covers, with every subset vertex matched.	Hard8	Bit manipulationDynamic programming+1	No attempts yet	2.5s	1024 MB	Judgeable
Opening OfficesCount the ways to choose T office buildings on a grid so that the shortest closed tour is the same on the full grid and on the night spanning tree, modulo 1000000007.	Hard8	TreeDynamic programming+1	No attempts yet	1s	1024 MB	Judgeable
Macaron KamaPair each red shell with a blue shell from the same multiset so each macaron takes the larger size, and maximize the resulting digit string if it is a palindrome.	Hard8	Dynamic programmingGreedy+1	No attempts yet	1s	1024 MB	Judgeable
Random RoadGiven a tree with park beauties and randomly oriented one-way snake edges, find the expected beauty of a safe random walk from each starting park, modulo 1e9+7.	Hard8	Dynamic programmingTree+2	No attempts yet	3s	1024 MB	Judgeable
BooksFor each candidate pair of students, find every book set whose books the two students can jointly cover, splitting the books between them.	Hard8	Bit manipulationDynamic programming	No attempts yet	6s	1024 MB	Judgeable
In the cubePlace k tables on the 5001 by 5001 grid, away from the n stands, so the total of each table's distances to its c closest stands is minimal.	Hard8	Dynamic programmingBit manipulation+1	No attempts yet	3s	1024 MB	Judgeable
IQ TestGiven n questions whose options claim counts of earlier answers, find the maximum number of questions that can be answered correctly.	Hard8	Dynamic programmingSegment tree	No attempts yet	1s	1024 MB	Judgeable
XOrSplit an array into exactly m consecutive parts so the OR of the parts' XOR sums is as small as possible, and print that minimum.	Hard8	Bit manipulationGreedy+2	No attempts yet	1s	1024 MB	Judgeable
ABC StringPartition a string with equal counts of A, B, and C into the fewest subsequences, where each subsequence splits into consecutive triples that each contain one of every letter.	Hard8	StringGreedy+1	No attempts yet	1s	2048 MB	Judgeable
Range EditingGiven a row of n cells with target values (0 means empty), find the minimum number of range assign and range clear operations to reach them.	Hard8	Dynamic programmingIntervals	No attempts yet	4s	2048 MB	Judgeable
Merging CellsGiven N cells in a row with sizes, adjacent cells merge at random until one remains, and the task is to find the probability each original label ends as the winner modulo 1e9+7.	Hard8	Dynamic programmingDivide and conquer+1	No attempts yet	2s	1024 MB	Judgeable
CowmpetencyCount the score sequences of N cows, each score from 1 to C, that satisfy each pair where cow h is the first with a score above cows 1 through a, modulo 10^9+7.	Hard8	Dynamic programmingCombinatorics+1	No attempts yet	2s	1024 MB	Judgeable
Garden 2Given an N by N grid of R, Y, and B cells, find the largest diamond pattern where each concentric ring has one color and count its flowers.	Hard8	Dynamic programmingMatrix+1	No attempts yet	4s	1024 MB	Judgeable
Eggplant Field PathCount the distinct ways a monotone lattice path from (0,0) to (R,C) can split the planted branches into upper and lower sets without touching any branch.	Hard8	Dynamic programmingCombinatorics+1	No attempts yet	1s	1024 MB	Judgeable
Infection SimulationGiven N customer stay intervals, each query asks how many customers end up infected from a given patient zero when the infection resistance is X.	Hard8	IntervalsGraph+2	No attempts yet	1.5s	1024 MB	Judgeable
MoorblesGiven N marbles and M turns with K possible bets per turn, find the lexicographically smallest Even/Odd guess sequence that keeps Elsie from losing, or print -1.	Hard8	Dynamic programmingGame theory+1	No attempts yet	2s	1024 MB	Judgeable
Special Dropkick 2Given a corridor string with obstacles, push obstacles at most M times, then find the minimum seconds to walk from zone 0 to zone N, breaking obstacles for 2 seconds each.	Hard8	Dynamic programmingGreedy+1	No attempts yet	1s	1024 MB	Judgeable
Pirate CodeFor each length k up to n, sum the decoded values of all binary codes of length k under Fibonacci pirate splitting, modulo 10^9+7.	Hard8	Dynamic programmingCombinatorics+1	No attempts yet	2s	1024 MB	Judgeable
CoinsCount the ways to add stacks of blue and red coins so that the whole row is a second-player win, for each total stack count from k to n.	Hard8	Game theoryCombinatorics+1	No attempts yet	25s	1024 MB	Judgeable
Escape Route 2Given daily repeating flight schedules between consecutive cities, find the minimum travel time from city L to city R for each query.	Hard8	Dynamic programmingBinary search+1	No attempts yet	2s	1024 MB	Judgeable
Fair DistributionGiven N buildings with ground height G and residential floor height R, decide whether they can be split between two children so each child's total height is equal.	Hard8	Dynamic programmingNumber theory+1	No attempts yet	1s	1024 MB	Judgeable
The Phoenix That Topples the SchoolGiven bricks stacked on floors, find the most bricks that can fall after removing one brick, when unsupported bricks collapse floor by floor.	Hard8	Dynamic programmingStack+2	No attempts yet	2s	1024 MB	Judgeable
V.I.P.Count the paths over active edges whose vertex weights strictly increase, answering each edge-flip query modulo 10^9+7.	Hard8	GraphDynamic programming+1	No attempts yet	1s	1024 MB	Judgeable
Discount EventGiven a weighted tree, for each query (X, Y) set every edge on the X to Y path to cost 0 and output the largest distance between any two cities.	Hard8	TreeDynamic programming+1	No attempts yet	4s	1024 MB	Judgeable
BfsBoys push the tilt right and girls push it left, in an order that keeps the tilt within S. After each swap inside one group, decide whether a valid order still exists.	Hard8	Dynamic programmingSegment tree+1	No attempts yet	1s	1024 MB	Judgeable
RevengeEach edge in an index range can be crossed for its cost or skipped for its rejection cost; find the minimum cost from u to v for each query range.	Hard8	Dynamic programmingDivide and conquer+2	No attempts yet	1s	1024 MB	Judgeable
Champernowne SubstringFill each ? in the pattern with a digit to minimize the index where it first appears in the Champernowne string, printed mod 998244353.	Hard8	Dynamic programmingString+2	No attempts yet	10s	2048 MB	Judgeable
Binary TreeFor each tree T_i built by joining two earlier trees, sum the fewest subtrees needed to cover each contiguous leaf range exactly.	Hard8	TreeDynamic programming+1	No attempts yet	1s	1024 MB	Judgeable
TilesGiven a simple axis-aligned polygon, find the largest k at most M such that the part left of x = k can be covered by non-overlapping 2 by 2 tiles.	Hard8	Dynamic programmingGeometry	No attempts yet	2s	1024 MB	Judgeable
MinequakeGiven a tree of n halls, start anywhere and visit every hall, minimizing the sum of the arrival times at each hall.	Hard8	TreeDynamic programming+1	No attempts yet	2s	1024 MB	Judgeable
SequenceGiven a weight for each value from 1 to n, find for every v the minimum total weight of a good sequence that contains v.	Hard8	Dynamic programmingShortest path+1	No attempts yet	1s	1024 MB	Judgeable
ChessboardCount the pairs of non-meeting lattice paths from (1,1) to (N,M) on a board with K forbidden cells, where the first moves are fixed, modulo 1e9+7.	Hard8	CombinatoricsDynamic programming+1	No attempts yet	2s	512 MB	Judgeable
Heat StrokeGiven hospital capacities along a line and a sequence of patients on roads, find the maximum number of patients sent by helicopter when both nearby hospitals are full.	Hard8	Segment treeDynamic programming+1	No attempts yet	2s	1024 MB	Judgeable
City HallGiven a weighted graph where edge cost is the squared altitude difference, find the minimum path energy from S to T after raising or lowering one vertex's altitude freely.	Hard8	Shortest pathGraph+2	No attempts yet	2s	1024 MB	Judgeable
Ninja DeliveryPick hubs x and y on a tree to minimize the total weighted cost of Q requests, where each request goes from a to x, x to y, then y to b.	Hard8	TreeDivide and conquer+2	No attempts yet	1s	1024 MB	Judgeable
Han Yo-won's InfiltrationPick quiet, noisy, or teleport for each passage, with at most W noisy passes and T teleports, to find the minimum total time from building 1 to N+1.	Hard8	GreedyDynamic programming+1	No attempts yet	1s	1024 MB	Judgeable
Erased ETTCount the ways to replace each 0 with a vertex from 1 to n so the array becomes a valid DFS entry and exit sequence of a tree rooted at 1.	Hard8	Dynamic programmingTree+1	No attempts yet	1s	1024 MB	Judgeable
Events Are Approaching (Hard)Given N timed events that forbid positions strictly between A and B at each time T, find the minimum total distance Minjeong moves to dodge them all, or -1 if impossible.	Hard8	Dynamic programmingIntervals+1	No attempts yet	4s	1024 MB	Judgeable
Union of SegmentsGiven N segments with prices and lengths, answer Q queries: can a subset with total price A have a union length of exactly B?	Hard8	Dynamic programmingSorting+1	No attempts yet	1s	1024 MB	Judgeable
What Happens When All the Branches Fall From a Tree?Two players take turns removing a root-to-vertex path from a tree, and a Nim game on the removed stones decides each turn. The task is to find the winner.	Hard8	TreeGame theory+2	No attempts yet	1s	1024 MB	Judgeable
Zigzag Histogram PartitionSplit a histogram of N bars into contiguous pieces so that each piece's largest rectangle forms a zigzag sequence, maximizing the number of pieces.	Hard8	Dynamic programmingSegment tree+1	No attempts yet	1s	1024 MB	Judgeable
NileFor each query D, find the minimum cost to ship all artifacts when two artifacts share a boat only if their weights differ by at most D.	Hard8	Dynamic programmingSorting+1	No attempts yet	2s	1024 MB	Judgeable
HieroglyphsFind the universal common subsequence of two integer sequences A and B, or report that none exists.	Hard8	Dynamic programmingGreedy+1	No attempts yet	1s	1024 MB	Judgeable
MosaicGiven the top row and left column of an N by N grid filled by a NOR rule, answer Q queries counting black tiles in given subrectangles.	Hard8	Dynamic programmingPrefix sum+1	No attempts yet	1s	1024 MB	Judgeable
Red and Blue Dots 2Given N points on a circle, each red or blue, find the fewest crossing pairs among same-color chords that touch every point at least once.	Hard8	Dynamic programmingGeometry+1	No attempts yet	1s	1024 MB	Judgeable
정다각형을 만들어요Count vertex sets of size 2 or more in a tree where exactly one vertex is equidistant from every chosen vertex, modulo 10^9+7.	Hard8	Dynamic programmingTree+2	No attempts yet	2s	1024 MB	Judgeable
LifeFor each prefix of length n, find the minimum total of chosen values when each pick shifts all later A and B values by +U or -D.	Hard8	Dynamic programmingGreedy	No attempts yet	2s	1024 MB	Judgeable
Bingo for the Win!Given each player's bingo sheet and a uniformly random calling order, find the probability that each player is the last to finish under Speed Bingo rules.	Hard8	ProbabilityCombinatorics+2	No attempts yet	1s	1024 MB	Judgeable
LexicopolisFind the lexicographically smallest walk of exactly k edges from s to t, comparing edge magic numbers, and output its polynomial value modulo 1e9+7.	Hard8	GraphDynamic programming+1	No attempts yet	2s	1024 MB	Judgeable
AquarelleGiven color sets for N cells and an initial painted range l to r, decide if the rest can be painted so each new cell adds an unseen color.	Hard8	Dynamic programmingIntervals+1	No attempts yet	0.4s	1024 MB	Judgeable
BalatroPick a subsequence of add and multiply cards, using at most k multiply cards, to maximize the final score for each length up to n.	Hard8	Dynamic programmingSorting+2	No attempts yet	12s	1024 MB	Judgeable
Job SchedulingGiven N base jobs and Q queries that each add R jobs, find the maximum number of non-overlapping jobs after each query's additions.	Hard8	IntervalsDynamic programming+2	No attempts yet	4s	1024 MB	Judgeable
Double DeckFind the maximum number of matched pairs between two decks of N*K cards, where each mismatch discards the top card of one deck.	Hard8	Dynamic programmingBit manipulation+1	No attempts yet	2s	1024 MB	Judgeable
Eradication SortRemove climbers so the rest form a non-decreasing sequence, minimizing the sum of squared lengths of the gaps left behind.	Hard8	Dynamic programmingSegment tree+1	No attempts yet	2s	1024 MB	Judgeable
Panel Optimization (Easy)Given an N by N grid of voltages with adjustment costs, assign each cell a positive, zero, or negative sign to maximize the energy from adjacent pairs minus the adjustment costs.	Hard8	GraphDynamic programming+1	No attempts yet	4s	1024 MB	Judgeable
Gahui and MusicGiven n measures with satisfaction values and optional Segno or Dal Segno marks, find the maximum total satisfaction when at most two marks are placed and no part repeats three or more times.	Hard8	Dynamic programmingPrefix sum+1	No attempts yet	1s	512 MB	Judgeable
Fences Make Good NeighborsTriangulate a convex polygon so that exactly two fences separate the two brothers' parcels, avoiding fences through their houses, and minimize total fence length.	Hard8	Dynamic programmingGeometry	No attempts yet	4s	2048 MB	Judgeable
Add One Zero-Weight Edge to Minimize the Sum of Root DistancesGiven a weighted tree rooted at vertex 1, add one zero-weight edge to minimize the sum of root distances and print that minimum.	Hard8	TreeDFS+1	No attempts yet	2s	1024 MB	Judgeable
BlistavostFind the minimum time for a walker starting at position 0 on a line to touch every crystal in the requested ranges no earlier than each range's bedtime.	Hard8	Dynamic programmingIntervals+1	No attempts yet	4s	1024 MB	Judgeable
K Subway StationsGiven a weighted tree, choose a path of at most K nodes that minimizes the maximum distance from any node to the path.	Hard8	TreeBinary search+2	No attempts yet	1.5s	1024 MB	Judgeable
Binary SearchGiven an undirected graph with 0/1 labels on vertices, find the length of the shortest binary string that no walk can spell, or report infinity.	Hard8	GraphDynamic programming+1	No attempts yet	4s	1024 MB	Judgeable
Accumulator ApexGiven a starting value x and k lists, take elements from the front of each list and add them to x, keeping x non-negative, to maximize the final x.	Hard8	GreedyDynamic programming+1	No attempts yet	3s	2048 MB	Judgeable
East 2 Will Not Come to This Match! 9Count the ways to pick 14 of the N wall tiles, by position, that can form a dragon of one head and four bodies or seven distinct heads, modulo 998244353.	Hard8	CombinatoricsDynamic programming+1	No attempts yet	5s	1024 MB	Judgeable
Interstellar IntervalsCount the colorings of N points that match an R, B, X pattern, where each coloring is built from disjoint blocks of x red points followed by x blue points.	Hard8	Dynamic programmingString matching	No attempts yet	2s	2048 MB	Judgeable
Robot UpgradesCount the ways to set each of N parts to an upgrade level from 0 to M so that, for each i, at most A_i parts reach level i or higher, modulo 998244353.	Hard8	Dynamic programmingCombinatorics+1	No attempts yet	1s	2048 MB	Judgeable
Independent Set (Max)Given a tree, find the maximum of (set size) times (minimum edges connecting the set) over all non-empty sets of pairwise non-adjacent nodes.	Hard8	TreeDynamic programming+1	No attempts yet	1s	2048 MB	Judgeable
Primal CollectionCount the primal arrays over values 1 to N+1 (missing S) for which inserting S at position N+1 and sifting it up takes exactly K swaps.	Hard8	CombinatoricsTree+1	No attempts yet	1s	2048 MB	Judgeable
Narrower PassagewayEach column is fogged with probability 1/2; find the expected total strength, where each unfogged segment adds min of its two row maxima (0 if equal), modulo 998244353.	Hard8	StackProbability+2	No attempts yet	1s	2048 MB	Judgeable
HeraclosuresFunctions form a call DAG with base times and point updates; answer each query for total time T(i) and output the query-index-weighted sum mod 1e9+7.	Hard8	Dynamic programmingGraph+1	No attempts yet	5.5s	2048 MB	Judgeable
FlowersGiven a rooted tree of N pots with water needs A_i, decide whether the first player wins the watering game when both players play optimally.	Hard8	Game theoryTree+1	No attempts yet	1s	1024 MB	Judgeable
Adrian the Wonder ChildGiven a labeled tree, find the longest path that has at most k consecutive equal edge labels after flipping at most m edges.	Hard8	TreeDynamic programming+1	No attempts yet	2s	2048 MB	Judgeable
Even-dominant NumbersFor each query, count the integers x in [l, r] whose even digit count, together with the digits of floor(sqrt(x)), exceeds the odd digit count.	Hard8	Dynamic programmingMath	No attempts yet	3s	2048 MB	Judgeable
Segments RemovalRemove segments on points 1 to x to maximize total score, where each removal gains weight times its exclusively covered points and pays its penalty.	Hard8	Dynamic programmingSegment tree+1	No attempts yet	4s	2048 MB	Judgeable
Series SumGiven k and p, compute the infinite sum of C(n, k)^p / 2^n for n from k to infinity, modulo 998244353.	Hard8	MathCombinatorics+1	No attempts yet	2s	2048 MB	Judgeable
Maximize the MinimumGiven two arrays with per-element removal costs, find the largest possible minimum gap \|a_i - b_j\| across the remaining elements when total removal cost is at most s.	Hard8	Binary searchDynamic programming+1	No attempts yet	4s	2048 MB	Judgeable