Dynamic programming ladder

Every judgeable DP problem, easiest first

Under construction

Still being built. Things may change

Total results6,386 problems

Peru
Hard8
Dynamic programming, Sliding window+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Colorful Tree
Hard8
Tree, Dynamic programming+2
No attempts yet
Time limit
2s
Memory limit
512 MB
Judgeable
Birthday Gift
Hard8
Dynamic programming, Matrix+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Fishing Game
Hard8
Dynamic programming, Combinatorics
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Chimichangas
Hard8
Math, Dynamic programming+1
No attempts yet
Time limit
0.35s
Memory limit
1024 MB
Judgeable
Sorting
Hard8
Combinatorics, Dynamic programming+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Fencing the Sheep
Hard8
Geometry, Sorting+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Making a Good Binary String
Hard8
Prefix sum, Dynamic programming+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Cat Exercise
Hard8
Tree, Dynamic programming+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Tractor Paths
Hard8
Graph, Shortest path+1
No attempts yet
Time limit
4s
Memory limit
1024 MB
Judgeable
Subtree Activation
Hard8
Tree, Dynamic programming+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Base Station Pruning
Hard8
Tree, Divide and conquer+1
No attempts yet
Time limit
4s
Memory limit
1024 MB
Judgeable
Meeting Room 2
Hard8
Dynamic programming, Intervals
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Russian Roulette (Hard)
Hard8
Dynamic programming, Probability+1
No attempts yet
Time limit
5s
Memory limit
1024 MB
Judgeable
Ultimate magic rectangles (Hard)
Hard8
Math, Combinatorics+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Counting Cases
Hard8
Number theory, Dynamic programming+2
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Zillionim
Hard8
Game theory, Math+1
No attempts yet
Time limit
50s
Memory limit
1024 MB
Judgeable
Hexacoin Jam
Hard8
Combinatorics, Dynamic programming+1
No attempts yet
Time limit
90s
Memory limit
1024 MB
Judgeable
Watching Cowflix
Hard8
Tree, Dynamic programming+1
No attempts yet
Time limit
3s
Memory limit
1024 MB
Judgeable
Piling Papers
Hard8
Dynamic programming, String
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Three People on a Tree
Hard8
Tree, Dynamic programming+1
No attempts yet
Time limit
4s
Memory limit
1024 MB
Judgeable
Purification Tanks
Hard8
Tree, DFS+2
No attempts yet
Time limit
3s
Memory limit
512 MB
Judgeable
Pareidolia
Hard8
Segment tree, Dynamic programming+1
No attempts yet
Time limit
4s
Memory limit
1024 MB
Judgeable
Monochrome Tree
Hard8
Tree, Dynamic programming
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Tsunami
Hard8
Dynamic programming, Segment tree+1
No attempts yet
Time limit
4s
Memory limit
1024 MB
Judgeable
Lucky Stars Management
Hard8
Tree, DFS+2
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Cooperation Game
Hard8
Dynamic programming, Greedy+1
No attempts yet
Time limit
3s
Memory limit
1024 MB
Judgeable
Shortest Path Query
Hard8
Shortest path, Dynamic programming+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Courses
Hard8
Dynamic programming, Combinatorics
No attempts yet
Time limit
15s
Memory limit
1024 MB
Judgeable
LCSLCSLCS
Hard8
Dynamic programming, String
No attempts yet
Time limit
10s
Memory limit
1024 MB
Judgeable
Record Parity
Hard8
Dynamic programming, Combinatorics+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
5
Hard8
Dynamic programming, Math
No attempts yet
Time limit
5s
Memory limit
555 MB
Judgeable
Classical Counting Problem
Hard8
Dynamic programming, Combinatorics+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Cyberland
Hard8
Shortest path, Dynamic programming+2
No attempts yet
Time limit
7s
Memory limit
1024 MB
Judgeable
Dominoes
Hard8
Stack, Dynamic programming+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Stone Taking Game
Hard8
Game theory, Graph+1
No attempts yet
Time limit
0.5s
Memory limit
256 MB
Judgeable
The Five Heroes' Swords
Hard8
Dynamic programming, Game theory+1
No attempts yet
Time limit
5s
Memory limit
1024 MB
Judgeable
Foolish Lock
Hard8
Dynamic programming, Segment tree+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
ChatNOI
Hard8
Graph, Hash map+1
No attempts yet
Time limit
4s
Memory limit
1024 MB
Judgeable
Instability
Hard8
Tree, Dynamic programming
No attempts yet
Time limit
1.5s
Memory limit
1024 MB
Judgeable
Trade Route
Hard8
Tree, DFS+1
No attempts yet
Time limit
4s
Memory limit
1024 MB
Judgeable
Records and anti-records
Hard8
Dynamic programming, Segment tree+1
No attempts yet
Time limit
3s
Memory limit
1024 MB
Judgeable
Fork
Hard8
Dynamic programming, Probability
No attempts yet
Time limit
0.15s
Memory limit
1024 MB
Judgeable
Dolls
Hard8
Dynamic programming, Sorting+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Artifacts
Hard8
Tree, Dynamic programming+2
No attempts yet
Time limit
1.5s
Memory limit
1024 MB
Judgeable
Pumpkin Placement
Hard8
Dynamic programming, Divide and conquer+2
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Encrypted Message
Hard8
String matching, Dynamic programming+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Raid on the Transporter
Hard8
Dynamic programming, Sorting+2
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Gigaskeletons
Hard8
Dynamic programming, Number theory+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Blowing Up the Windmill
Hard8
Dynamic programming, Greedy+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
x
Hard8
Tree, Dynamic programming+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Escape from the Building
Hard8
Dynamic programming, Greedy
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Hyeoncheol's Blind Date
Hard8
Dynamic programming, Probability+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Protective Barrier
Hard8
Dynamic programming, Bit manipulation+1
No attempts yet
Time limit
5s
Memory limit
1024 MB
Judgeable
Unified Network
Hard8
Dynamic programming, Graph+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Mail Delivery
Hard8
Dynamic programming, Tree+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Lumberjack Villages
Hard8
Tree, Dynamic programming
No attempts yet
Time limit
3s
Memory limit
1024 MB
Judgeable
Power of Magic Spells
Hard8
Dynamic programming, Bit manipulation+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Defenders of Asgard
Hard8
Tree, Dynamic programming+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Chariot Race
Hard8
Shortest path, Dynamic programming+2
No attempts yet
Time limit
8s
Memory limit
1024 MB
Judgeable
Squares and Lanterns
Hard8
Tree, Dynamic programming+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Spells
Hard8
Dynamic programming, String matching+1
No attempts yet
Time limit
3s
Memory limit
1024 MB
Judgeable
Jedi Queries
Hard8
Trie, Dynamic programming+1
No attempts yet
Time limit
3s
Memory limit
1024 MB
Judgeable
2048
Hard8
Dynamic programming, Matrix+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Lottery
Hard8
Dynamic programming, Segment tree+2
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Marathon
Hard8
Shortest path, Dynamic programming+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Scar Prepares an Attack
Hard8
Dynamic programming, String+2
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Fence
Hard8
Geometry, Dynamic programming
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Stones
Hard8
Bit manipulation, Dynamic programming+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Blind Flibs
Hard8
String, String matching+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Maxima
Hard8
Combinatorics, Matrix+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Transport Costs
Hard8
Tree, DFS+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Maximum sum of GCDs
Hard8
Dynamic programming, Number theory+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Logistics
Hard8
Tree, Dynamic programming+1
No attempts yet
Time limit
15s
Memory limit
1024 MB
Judgeable
School Idol Project GSHS
Hard8
Dynamic programming, Stack+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Vault Robbery
Hard8
Tree, Dynamic programming+1
No attempts yet
Time limit
3s
Memory limit
1024 MB
Judgeable
Gold Digging
Hard8
Dynamic programming, Probability+1
No attempts yet
Time limit
4s
Memory limit
1024 MB
Judgeable
Regular Expression Edit Distance
Hard8
Dynamic programming, Recursion+1
No attempts yet
Time limit
5s
Memory limit
1024 MB
Judgeable
Reflected Copy Tree
Hard8
Tree, Dynamic programming+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Bracket Dance
Hard8
Dynamic programming, Greedy+1
No attempts yet
Time limit
3s
Memory limit
1024 MB
Judgeable
BX Bet
Hard8
Game theory, Trie+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Feeding Geese
Hard8
Dynamic programming, Segment tree+2
No attempts yet
Time limit
5s
Memory limit
1024 MB
Judgeable
Zeus
Hard8
Graph, Shortest path+1
No attempts yet
Time limit
12s
Memory limit
1024 MB
Judgeable
Gadget Construction
Hard8
Geometry, Dynamic programming+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Introversion
Hard8
Dynamic programming, Combinatorics+1
No attempts yet
Time limit
3s
Memory limit
1024 MB
Judgeable
Distance Permutation
Hard8
Combinatorics, Dynamic programming+1
No attempts yet
Time limit
5s
Memory limit
1024 MB
Judgeable
Pool
Hard8
Probability, Dynamic programming+1
No attempts yet
Time limit
3s
Memory limit
1024 MB
Judgeable
Vegetables
Hard8
Dynamic programming, Divide and conquer+2
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Challenge NPC
Hard8
Tree, Dynamic programming+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Quadratic Integer Program
Hard8
Dynamic programming, Brute force+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Depth First Search
Hard8
Tree, DFS+2
No attempts yet
Time limit
6s
Memory limit
1024 MB
Judgeable
Why Hobawoo Was Late for School 6
Hard8
Dynamic programming, Bit manipulation
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Reality Show
Hard8
Dynamic programming, Bit manipulation
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Swaps in a Permutation
Hard8
Dynamic programming, Union-find+2
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Not So Distant Strings
Hard8
Dynamic programming, Combinatorics+2
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Yet Another Coin Problem
Hard8
Dynamic programming, Number theory
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
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

Title	Level	Topics	Solved	Time limit	Memory limit	Judge
PeruFor each prefix of beetles, find the minimum total glove effort needed to crush it, then output the base-23 weighted sum of those values modulo 1e9+7.	Hard8	Dynamic programmingSliding window+1	No attempts yet	1s	1024 MB	Judgeable
Colorful TreeCount the colorings of a rooted tree with k colors where each vertex takes one of its children's colors, and the children use between l_i and r_i colors.	Hard8	TreeDynamic programming+2	No attempts yet	2s	512 MB	Judgeable
Birthday GiftCount the decimal numbers with exactly a digits, no two adjacent digits equal, and remainder b mod 225, modulo 1e9+7.	Hard8	Dynamic programmingMatrix+1	No attempts yet	2s	1024 MB	Judgeable
Fishing GameCount the distinct ways three players can pass cards in Fishing until every card is discarded, given their hands after the first discard, modulo 1000000007.	Hard8	Dynamic programmingCombinatorics	No attempts yet	1s	1024 MB	Judgeable
ChimichangasCount the ordered sequences of exactly K calorie values from N types that sum to each queried meal, modulo 2999.	Hard8	MathDynamic programming+1	No attempts yet	0.35s	1024 MB	Judgeable
SortingCount permutations of N elements whose inversion count exceeds the minimum number of arbitrary swaps (N minus cycles), modulo 999017.	Hard8	CombinatoricsDynamic programming+1	No attempts yet	1s	1024 MB	Judgeable
Fencing the SheepGiven N sheep on an infinite grid, find the fewest unit fences that enclose all sheep in one connected pen, and the smallest pen area with that many fences.	Hard8	GeometrySorting+1	No attempts yet	1s	1024 MB	Judgeable
Making a Good Binary StringGiven a binary string, find the fewest character flips so that the shortest intervals covering all 0s and all 1s have equal length.	Hard8	Prefix sumDynamic programming+1	No attempts yet	2s	1024 MB	Judgeable
Cat ExercisePlace obstacles on a tree of towers to maximize the total number of moves a cat makes while jumping to the highest reachable tower each time.	Hard8	TreeDynamic programming+1	No attempts yet	2s	1024 MB	Judgeable
Tractor PathsGiven N intervals with sorted endpoints, answer queries for the shortest path length between two tractors and count special tractors on some shortest path.	Hard8	GraphShortest path+1	No attempts yet	4s	1024 MB	Judgeable
Subtree ActivationGiven a rooted tree, find the fewest toggles so that every subtree is exactly the active set at some moment, starting and ending with all ornaments off.	Hard8	TreeDynamic programming+1	No attempts yet	2s	1024 MB	Judgeable
Base Station PruningFor each interval of base numbers s to e, find the minimum total length of tree passages that keep those bases mutually reachable, using any bases in between.	Hard8	TreeDivide and conquer+1	No attempts yet	4s	1024 MB	Judgeable
Meeting Room 2Count the ways to cancel all but one meeting, one per day, so that the total room cost over the removal days is minimal, modulo 1,000,000,007.	Hard8	Dynamic programmingIntervals	No attempts yet	2s	1024 MB	Judgeable
Russian Roulette (Hard)Given n players, c chambers, and k passes per empty shot, find the starting seat with the best survival chance and its probability modulo 1000000009.	Hard8	Dynamic programmingProbability+1	No attempts yet	5s	1024 MB	Judgeable
Ultimate magic rectangles (Hard)Count the ways to fill a 3-row, c-column grid with nonnegative integers so every triplet on a line across all three rows sums to s, modulo 10^9 + 9.	Hard8	MathCombinatorics+1	No attempts yet	1s	1024 MB	Judgeable
Counting CasesGiven N rabbits that each pick a value from the set X, count the assignments whose product equals k for every k from 1 to K, modulo 1e9+7.	Hard8	Number theoryDynamic programming+2	No attempts yet	1s	1024 MB	Judgeable
ZillionimGiven a Zillionim position on 10^12 coins where each move removes 10^10 consecutive coins, decide whether you can beat a random-moving AI most of the time.	Hard8	Game theoryMath+1	No attempts yet	50s	1024 MB	Judgeable
Hexacoin JamGiven hexadecimal numbers and a range, find the probability that a random digit permutation followed by a random pair sum lands inside the range.	Hard8	CombinatoricsDynamic programming+1	No attempts yet	90s	1024 MB	Judgeable
Watching CowflixGiven a tree with marked nodes, find for each k from 1 to N the minimum total cost of disjoint connected components covering all marked nodes, where a component of size d costs d+k.	Hard8	TreeDynamic programming+1	No attempts yet	3s	1024 MB	Judgeable
Piling PapersFor each query range of digits, count the ways to add each digit to the top, the bottom, or skip it so the final number lies in [A, B], modulo 1e9+7.	Hard8	Dynamic programmingString	No attempts yet	2s	1024 MB	Judgeable
Three People on a TreeCount triples of people on three distinct vertices whose pairwise LCA D is not one of them and whose distances to D sum to K, modulo 998244353.	Hard8	TreeDynamic programming+1	No attempts yet	4s	1024 MB	Judgeable
Purification TanksFor each query, find the minimum purification cost to get water of grade K or lower at tank X, using only the source-to-X path of a tree.	Hard8	TreeDFS+2	No attempts yet	3s	512 MB	Judgeable
PareidoliaSum B(s) over all substrings of t, where B(s) is the most copies of "bessie" that can be picked as subsequences of s, after each single-character update.	Hard8	Segment treeDynamic programming+1	No attempts yet	4s	1024 MB	Judgeable
Monochrome TreeFor each k from 0 to n, find the fewest ancestor-descendant pairs of black vertices when exactly k vertices of a rooted tree are colored black.	Hard8	TreeDynamic programming	No attempts yet	2s	1024 MB	Judgeable
TsunamiGiven evacuation spots, obstacle segments with crossing costs, and nondecreasing sideways costs, find the minimum time to reach y=Y from each x from 1 to X.	Hard8	Dynamic programmingSegment tree+1	No attempts yet	4s	1024 MB	Judgeable
Lucky Stars ManagementGiven a company tree and expected fines E_i, decide whether the values are consistent and, if so, find Bill's minimum possible annual salary.	Hard8	TreeDFS+2	No attempts yet	2s	1024 MB	Judgeable
Cooperation GameGiven a line of class numbers, remove same-class pairs in some order to maximize the sum of their current position distances.	Hard8	Dynamic programmingGreedy+1	No attempts yet	3s	1024 MB	Judgeable
Shortest Path QueryGiven a DAG whose edges are black or white, answer queries for the shortest distance from vertex 1 to x when black edges cost a and white edges cost b.	Hard8	Shortest pathDynamic programming+1	No attempts yet	2s	1024 MB	Judgeable
CoursesCount the course sequences with total cost exactly t and total IQ change at least k, for each t from 1 to n, modulo 998244353.	Hard8	Dynamic programmingCombinatorics	No attempts yet	15s	1024 MB	Judgeable
LCSLCSLCSGiven strings A and B and repeat counts n and m (up to 10^15), find the LCS length of A repeated n times and B repeated m times.	Hard8	Dynamic programmingString	No attempts yet	10s	1024 MB	Judgeable
Record ParityGiven a permutation, find the sum of (-1)^len over all subsequences with exactly k records (left-to-right maxima), modulo 998244353.	Hard8	Dynamic programmingCombinatorics+1	No attempts yet	1s	1024 MB	Judgeable
5Given an array of non-negative integers with sum S and at least S/5 ones, count the pairs (k, T) where some subsequence of length k sums to T.	Hard8	Dynamic programmingMath	No attempts yet	5s	555 MB	Judgeable
Classical Counting ProblemCount the distinct sets of p problems that can end up as the top p after m judges each vote for v problems, modulo 998244353.	Hard8	Dynamic programmingCombinatorics+1	No attempts yet	2s	1024 MB	Judgeable
CyberlandFind the minimum time from country 0 to country H when some countries zero the passing time or halve it, with at most K halvings.	Hard8	Shortest pathDynamic programming+2	No attempts yet	7s	1024 MB	Judgeable
DominoesGiven n dominoes that fall left with heights l_i, find for each starting domino the area of the union of quarter circles that topple.	Hard8	StackDynamic programming+1	No attempts yet	2s	1024 MB	Judgeable
Stone Taking GameGiven a cycle whose edges hold stones, find for each i the fewest extra stones Jeonghu must add so he wins from at least i starting vertices.	Hard8	Game theoryGraph+1	No attempts yet	0.5s	256 MB	Judgeable
The Five Heroes' SwordsGiven five disjoint sets of possible attack powers, find the fewest hardness tests needed in the worst case to identify the strongest sword.	Hard8	Dynamic programmingGame theory+1	No attempts yet	5s	1024 MB	Judgeable
Foolish LockGiven a lowercase string with point updates, find the fewest single-letter steps needed to make the string non-decreasing, after each update.	Hard8	Dynamic programmingSegment tree+1	No attempts yet	2s	1024 MB	Judgeable
ChatNOIGiven a training text and a k-word prefix, append m words so that the minimum follow-count along the sentence is as large as possible.	Hard8	GraphHash map+1	No attempts yet	4s	1024 MB	Judgeable
InstabilityCut edges of a rooted tree so each piece is k-good for some k, minimizing the total of f(k) over all pieces.	Hard8	TreeDynamic programming	No attempts yet	1.5s	1024 MB	Judgeable
Trade RouteGiven a tree with a profit on each node, find the maximum-sum simple path that contains all listed countries in each query, or No if none exists.	Hard8	TreeDFS+1	No attempts yet	4s	1024 MB	Judgeable
Records and anti-recordsSplit a permutation into two non-empty subsequences to maximize the records in the first plus the anti-records in the second.	Hard8	Dynamic programmingSegment tree+1	No attempts yet	3s	1024 MB	Judgeable
ForkGiven P, N, L, and R, find the minimum expected number of key presses to finish typing a fixed N-character string into two random shells.	Hard8	Dynamic programmingProbability	No attempts yet	0.15s	1024 MB	Judgeable
DollsAfter each doll is added, find the largest stack where every doll is at least 2 bigger than the doll inside it.	Hard8	Dynamic programmingSorting+1	No attempts yet	1s	1024 MB	Judgeable
ArtifactsFind the minimum walk on a weighted tree that visits sites holding all k artifact kinds, where the start and end points cost nothing.	Hard8	TreeDynamic programming+2	No attempts yet	1.5s	1024 MB	Judgeable
Pumpkin PlacementPick fence positions, always including the first and last, to maximize total gap satisfaction minus the chosen discontentment costs.	Hard8	Dynamic programmingDivide and conquer+2	No attempts yet	2s	1024 MB	Judgeable
Encrypted MessageSplit the string t into words so that t is w1 to wn followed by wn to w1, with the maximum possible number of words, then print them.	Hard8	String matchingDynamic programming+1	No attempts yet	1s	1024 MB	Judgeable
Raid on the TransporterFind the longest line of members with nondecreasing strength and speed where each speed step is at most x, then pick one extra member's strength and speed to make it longer.	Hard8	Dynamic programmingSorting+2	No attempts yet	1s	1024 MB	Judgeable
GigaskeletonsSplit n skeletons with bone counts up to 2e5 into LCM-wide groups so the sum of each group's LCM is minimal, then print the groups.	Hard8	Dynamic programmingNumber theory+1	No attempts yet	1s	1024 MB	Judgeable
Blowing Up the WindmillEach component can be disabled once stability is at least a_i, and it shifts stability by b_i. Find the lowest reachable stability and an order of components that reaches it.	Hard8	Dynamic programmingGreedy+1	No attempts yet	1s	1024 MB	Judgeable
xCount the connected vertex subsets of a tree that contain at least one vertex of each of the m skill colors, modulo 998244353.	Hard8	TreeDynamic programming+1	No attempts yet	2s	1024 MB	Judgeable
Escape from the BuildingFind the minimum total energy the robber spends on chip uses while climbing an n-floor building to reach the roof before the police.	Hard8	Dynamic programmingGreedy	No attempts yet	2s	1024 MB	Judgeable
Hyeoncheol's Blind DateSplit n consecutive laundry items into baskets to minimize the expected washing time, where a basket of total weight g takes g^2 and each extra basket adds c.	Hard8	Dynamic programmingProbability+1	No attempts yet	1s	1024 MB	Judgeable
Protective BarrierFor each attempt, find the spell order that maximizes the sum of range maxima over q given intervals, with n up to 30 and m up to 1000.	Hard8	Dynamic programmingBit manipulation+1	No attempts yet	5s	1024 MB	Judgeable
Unified NetworkGiven a connected edge cactus of cities, assign one of three transmitter types to each city so adjacent cities differ, using as few type-three transmitters as possible.	Hard8	Dynamic programmingGraph+1	No attempts yet	2s	1024 MB	Judgeable
Mail DeliveryCount the DFS visiting orders from the capital where every parcel's source city is visited before its destination city, modulo 1e9+7.	Hard8	Dynamic programmingTree+1	No attempts yet	2s	1024 MB	Judgeable
Lumberjack VillagesChoose governor villages in a rooted tree, then assign shipyards and lumber suppliers in each governed subtree to maximize the total ships built.	Hard8	TreeDynamic programming	No attempts yet	3s	1024 MB	Judgeable
Power of Magic SpellsGiven wizard powers and up to 4 minutes with allowed ranges, choose an optional kill segment each minute to minimize the summed surviving power.	Hard8	Dynamic programmingBit manipulation+1	No attempts yet	2s	1024 MB	Judgeable
Defenders of AsgardOrder each warrior's subordinates in a rooted tree (at most 7 children each) so the resulting row has the fewest inversions, and print that minimum.	Hard8	TreeDynamic programming+1	No attempts yet	2s	1024 MB	Judgeable
Chariot RaceFind the minimum time for a closed route that visits the checkpoints v1 to vk in order, where each turn at an intersection takes time based on the angle.	Hard8	Shortest pathDynamic programming+2	No attempts yet	8s	1024 MB	Judgeable
Squares and LanternsGiven a tree where each square has a lantern range, find which squares can serve as a center where every leaf-to-center path has the same lit-lantern total while all squares meet their minimums.	Hard8	TreeDynamic programming+1	No attempts yet	2s	1024 MB	Judgeable
SpellsFind the fewest concatenation and multiplication steps, using the given spells, that build string t, or report -1 if impossible.	Hard8	Dynamic programmingString matching+1	No attempts yet	3s	1024 MB	Judgeable
Jedi QueriesGiven n numbers and queries with ? wildcards, sum over every filled-in subquery how many numbers are at least that subquery.	Hard8	TrieDynamic programming+1	No attempts yet	3s	1024 MB	Judgeable
2048Count the 16-color h by w grids where no two side-adjacent cells share a color, modulo 1,000,000,007, for h up to 6 and w up to 10^18.	Hard8	Dynamic programmingMatrix+1	No attempts yet	2s	1024 MB	Judgeable
LotteryCount arrays of n integers in [1, k] where each given range maximum query returns its specified value, modulo 1e9+7.	Hard8	Dynamic programmingSegment tree+2	No attempts yet	2s	1024 MB	Judgeable
MarathonFor each student j from 1 to K, find the shortest walk from checkpoint 1 to N that visits exactly j checkpoints, then sum the lengths modulo 998244353.	Hard8	Shortest pathDynamic programming+1	No attempts yet	2s	1024 MB	Judgeable
Scar Prepares an AttackCount the ways to pick a nonempty subsequence of each hyena's genotype so that each chosen birth genotype is stronger than the next, modulo 1e9+7.	Hard8	Dynamic programmingString+2	No attempts yet	2s	1024 MB	Judgeable
FenceGiven a convex polygon and one interior post, find a maximum-area polygon whose vertices are these posts, with no other post strictly inside it.	Hard8	GeometryDynamic programming	No attempts yet	2s	1024 MB	Judgeable
StonesCount the sets of distinct stone segments, each with binary value at most k, whose flips turn an all-white row into the binary number n, modulo 1e9+7.	Hard8	Bit manipulationDynamic programming+1	No attempts yet	2s	1024 MB	Judgeable
Blind FlibsGiven a binary word w, find for each k from 1 to \|w\| the maximum predictive power of a k-state blind automaton that predicts the endlessly repeated string w*.	Hard8	StringString matching+1	No attempts yet	2s	1024 MB	Judgeable
MaximaCount permutations of 1 to n with exactly k maxima, where n is up to 10^15 and the answer is taken modulo 239.	Hard8	CombinatoricsMatrix+1	No attempts yet	2s	1024 MB	Judgeable
Transport CostsGiven a tree of N cities and K marked cities, find the contest city minimizing the sum of squared distances to the marked cities.	Hard8	TreeDFS+1	No attempts yet	1s	1024 MB	Judgeable
Maximum sum of GCDsSplit a fixed sequence of pile sizes into contiguous shelves of at least D piles each (or empty) to maximize the sum of each shelf's GCD.	Hard8	Dynamic programmingNumber theory+1	No attempts yet	1s	1024 MB	Judgeable
LogisticsFor each store, count the valid production sequences from factory 1 that end at the store's factory with a level in its range, modulo 1e9+7.	Hard8	TreeDynamic programming+1	No attempts yet	15s	1024 MB	Judgeable
School Idol Project GSHSSplit N students into consecutive groups of at most M students so that the sum of (max minus min) over all groups is maximized, and print one optimal split.	Hard8	Dynamic programmingStack+1	No attempts yet	1s	1024 MB	Judgeable
Vault RobberyFind the maximum loot on a route that ends at building E, moving only to visible buildings and never robbing two consecutive visited buildings, as values and E change over Q updates.	Hard8	TreeDynamic programming+1	No attempts yet	3s	1024 MB	Judgeable
Gold DiggingGiven pits with a breakdown chance, an extraction rate, and gold amounts, find the best expected gold when one machine is assigned to one pit per day.	Hard8	Dynamic programmingProbability+1	No attempts yet	4s	1024 MB	Judgeable
Regular Expression Edit DistanceGiven two regular expressions over a and b, find the minimum edit distance between any string matched by the first and any string matched by the second.	Hard8	Dynamic programmingRecursion+1	No attempts yet	5s	1024 MB	Judgeable
Reflected Copy TreeGiven a tree with N nodes, reflected-copy it K times and print the sum of all pairwise distances modulo 10^9+7.	Hard8	TreeDynamic programming+1	No attempts yet	1s	1024 MB	Judgeable
Bracket DancePick 2K brackets from the string, keeping their order, so they form a correct bracket sequence with the largest total beauty, for each K from 1 to N/2.	Hard8	Dynamic programmingGreedy+1	No attempts yet	3s	1024 MB	Judgeable
BX BetTwo players alternately add a chosen earlier opponent number to their own, digit-wise mod 10, and the task is to find the winner from both notebooks.	Hard8	Game theoryTrie+1	No attempts yet	2s	1024 MB	Judgeable
Feeding GeeseChoose which geese to feed, given each goose's waiting window and speed level, to maximize the total cuteness of the fed geese.	Hard8	Dynamic programmingSegment tree+2	No attempts yet	5s	1024 MB	Judgeable
ZeusGiven a connected weighted graph with treewidth at most 2, compute the sum of shortest-path distances over all pairs of vertices.	Hard8	GraphShortest path+1	No attempts yet	12s	1024 MB	Judgeable
Gadget ConstructionCount subsets of at least 4 cogs whose convex hull alternates colors around its vertices, with interior cogs of any color, modulo 1e9+7.	Hard8	GeometryDynamic programming+1	No attempts yet	1s	1024 MB	Judgeable
IntroversionGiven a row of 2n slots with some dishes fixed, count the ways to fill the empty slots so each type appears twice and no two equal types are adjacent, modulo 1e9+7.	Hard8	Dynamic programmingCombinatorics+1	No attempts yet	3s	1024 MB	Judgeable
Distance PermutationGiven K, count the permutations of 1 to N that the walk can produce, where the first element lies between L and R.	Hard8	CombinatoricsDynamic programming+1	No attempts yet	5s	1024 MB	Judgeable
PoolFind the probability that the largest all-safe rectangle touching the bottom of an N by 1001 grid is exactly K cells, given safe probability x/y.	Hard8	ProbabilityDynamic programming+1	No attempts yet	3s	1024 MB	Judgeable
VegetablesFor each query p, find the maximum profit over p days when at most m units can be sold per day from vegetables that spoil.	Hard8	Dynamic programmingDivide and conquer+2	No attempts yet	1s	1024 MB	Judgeable
Challenge NPCGiven rooted trees G and H with \|H\| <= \|G\| <= \|H\| + k, decide whether deleting nodes of G (never the root) can leave a connected tree isomorphic to H.	Hard8	TreeDynamic programming+1	No attempts yet	2s	1024 MB	Judgeable
Quadratic Integer ProgramFor each query of weights, find the maximum-weight integer sequence that stays within given intervals and pairwise difference limits, and print that weight.	Hard8	Dynamic programmingBrute force+1	No attempts yet	2s	1024 MB	Judgeable
Depth First SearchCount subsets of the m extra edges so that tree T, plus the chosen edges, is a DFS tree from one of the k special vertices.	Hard8	TreeDFS+2	No attempts yet	6s	1024 MB	Judgeable
Why Hobawoo Was Late for School 6Shrink an array of N non-negative integers to exactly M elements using four XOR-merge spells, maximizing the sum of the final elements.	Hard8	Dynamic programmingBit manipulation	No attempts yet	1s	1024 MB	Judgeable
Reality ShowPick a subset of candidates that obeys the record rule, then maximize the on-stage fight revenue minus the recruitment costs.	Hard8	Dynamic programmingBit manipulation	No attempts yet	2s	1024 MB	Judgeable
Swaps in a PermutationGiven a permutation and a set of allowed position swaps, find the maximum LIS length reachable by applying any number of these swaps.	Hard8	Dynamic programmingUnion-find+2	No attempts yet	1s	1024 MB	Judgeable
Not So Distant StringsGiven a digit string s and k, output the k-th length-n digit string when all strings are sorted by digit distance to s, then lexicographically.	Hard8	Dynamic programmingCombinatorics+2	No attempts yet	1s	1024 MB	Judgeable
Yet Another Coin ProblemGiven N coin types with counts and values, decide whether some choice of coins sums to exactly X, and print the number of each coin type used if so.	Hard8	Dynamic programmingNumber theory	No attempts yet	2s	1024 MB	Judgeable
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