Dynamic programming ladder

Every judgeable DP problem, easiest first

Under construction

Still being built. Things may change

Total results6,390 problems

Drought
Hard8
Dynamic programming, Combinatorics+2
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Number of Words
Hard8
Dynamic programming, Combinatorics+2
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Block Arrangement
Hard8
Binary search, Greedy+2
No attempts yet
Time limit
4s
Memory limit
512 MB
Judgeable
Y
Hard8
Tree, DFS+2
No attempts yet
Time limit
1.5s
Memory limit
1024 MB
Judgeable
Palindrome Game
Hard8
Game theory, Dynamic programming+2
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Gambling Game
Hard8
Combinatorics, Probability+2
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Tomb Hater
Hard8
Dynamic programming, Graph+2
No attempts yet
Time limit
4s
Memory limit
1024 MB
Judgeable
Shortest Missing Subsequences
Hard8
String, Greedy+2
No attempts yet
Time limit
10s
Memory limit
1024 MB
Judgeable
Redistributing Gifts
Hard8
Dynamic programming, Bit manipulation+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Cactus Eater
Hard8
Graph, DFS+2
No attempts yet
Time limit
2s
Memory limit
512 MB
Judgeable
Game with Balls and Boxes
Hard8
Graph, Greedy+2
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Math String
Hard8
Dynamic programming, Math+2
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Box Packing
Hard8
Dynamic programming, Sorting+2
No attempts yet
Time limit
1s
Memory limit
256 MB
Judgeable
Fancy Arrays
Hard8
Dynamic programming, Number theory+2
No attempts yet
Time limit
2.5s
Memory limit
256 MB
Judgeable
Escaped from NEF
Hard8
Graph, DFS+2
No attempts yet
Time limit
2s
Memory limit
512 MB
Judgeable
Gross LCS
Hard8
Dynamic programming, Hash map+1
No attempts yet
Time limit
10s
Memory limit
16 MB
Judgeable
Lucky Tickets
Hard8
Dynamic programming, Number theory+2
No attempts yet
Time limit
2s
Memory limit
512 MB
Judgeable
Disbalance
Hard8
Probability, Dynamic programming+1
No attempts yet
Time limit
1s
Memory limit
512 MB
Judgeable
Gachapon
Hard8
Dynamic programming, Probability+1
No attempts yet
Time limit
5s
Memory limit
512 MB
Judgeable
Pancake-Flavored Cookie
Hard8
Dynamic programming, Simulation+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
A+B
Hard8
Dynamic programming, Combinatorics+1
No attempts yet
Time limit
1s
Memory limit
512 MB
Judgeable
Optical Communication Channels
Hard8
Tree, Dynamic programming+1
No attempts yet
Time limit
1s
Memory limit
512 MB
Judgeable
Forest Game
Hard8
Tree, Game theory+2
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Reconstruction Project
Hard8
Graph, Minimum spanning tree+1
No attempts yet
Time limit
5s
Memory limit
1024 MB
Judgeable
Reversible Compression
Hard8
Dynamic programming, String+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Genealogy of Puppets
Hard8
Dynamic programming, Tree+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
262144 Revisited
Hard8
Divide and conquer, Dynamic programming+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Up Down Subsequence
Hard8
Dynamic programming, Segment tree+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Pair Programming
Hard8
Dynamic programming, Combinatorics+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Punch Through
Hard8
Dynamic programming, Segment tree+1
No attempts yet
Time limit
5s
Memory limit
1024 MB
Judgeable
Flappy Bird
Hard8
Segment tree, Dynamic programming+1
No attempts yet
Time limit
4s
Memory limit
1024 MB
Judgeable
Histogram
Hard8
Stack, Dynamic programming+1
No attempts yet
Time limit
4s
Memory limit
1024 MB
Judgeable
Colorful Bracket Sequences
Hard8
Dynamic programming, String
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Gastronomic Event
Hard8
Tree, Dynamic programming+1
No attempts yet
Time limit
2s
Memory limit
2048 MB
Judgeable
Robot Game
Hard8
Bit manipulation, Dynamic programming+1
No attempts yet
Time limit
10s
Memory limit
1024 MB
Judgeable
Delicacy
Hard8
Matrix, Dynamic programming+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Destiny
Hard8
Tree, Dynamic programming+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Systematic salesman
Hard8
Divide and conquer, Dynamic programming+1
No attempts yet
Time limit
6s
Memory limit
256 MB
Judgeable
Cake Slices (Hard)
Hard8
Dynamic programming, Combinatorics+1
No attempts yet
Time limit
3s
Memory limit
1024 MB
Judgeable
Bi-ing Lottery Treekets
Hard8
Tree, Dynamic programming+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Joined Sessions
Hard8
Intervals, Greedy+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Permutation
Hard8
Greedy, Bit manipulation+1
No attempts yet
Time limit
1s
Memory limit
256 MB
Judgeable
I Herd You Like Ternary Operators
Hard8
String, Stack+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
The Flower of the Game
Hard8
Tree, Dynamic programming+1
No attempts yet
Time limit
6s
Memory limit
1024 MB
Judgeable
Fancy Stack
Hard8
Dynamic programming, Combinatorics+1
No attempts yet
Time limit
3s
Memory limit
512 MB
Judgeable
Job Lookup
Hard8
Dynamic programming, Tree+1
No attempts yet
Time limit
3s
Memory limit
512 MB
Judgeable
Split into Intervals
Hard8
Dynamic programming, Array
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Catfish Farm
Hard8
Dynamic programming, Segment tree
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Kingdom
Hard8
Dynamic programming, Binary search+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Tipover Transform
Hard8
Dynamic programming, Greedy+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Parking
Hard8
Dynamic programming, Bit manipulation+1
No attempts yet
Time limit
3s
Memory limit
1024 MB
Judgeable
Make an X (Hard)
Hard8
Dynamic programming, Segment tree+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Sorting Program
Hard8
Dynamic programming, Bit manipulation+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Cola Picking
Hard8
Dynamic programming, Matrix
No attempts yet
Time limit
3s
Memory limit
1024 MB
Judgeable
Counting Sequence
Hard8
Dynamic programming, Math+1
No attempts yet
Time limit
16s
Memory limit
1024 MB
Judgeable
Flower's Land
Hard8
Dynamic programming, Tree+1
No attempts yet
Time limit
8s
Memory limit
2048 MB
Judgeable
Matrix Multiplication Order 4
Hard8
Dynamic programming, Greedy
No attempts yet
Time limit
1s
Memory limit
512 MB
Judgeable
Ramen
Hard8
Dynamic programming, Greedy+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
One Path
Hard8
Tree, Dynamic programming
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Squirrel Game
Hard8
Game theory, Dynamic programming+1
No attempts yet
Time limit
3s
Memory limit
1024 MB
Judgeable
Two Paths
Hard8
Tree, Dynamic programming+1
No attempts yet
Time limit
5s
Memory limit
1024 MB
Judgeable
String Strange Sum
Hard8
String matching, String+1
No attempts yet
Time limit
4s
Memory limit
1024 MB
Judgeable
Triangular Cactus Paths
Hard8
Graph, Tree+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
K-Item Shopping Spree
Hard8
Math, Dynamic programming+1
No attempts yet
Time limit
10s
Memory limit
1024 MB
Judgeable
Prime Arrangement
Hard8
Combinatorics, Sorting+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Darkest Dungeon
Hard8
Tree, Dynamic programming+1
No attempts yet
Time limit
1.5s
Memory limit
1024 MB
Judgeable
Hug Me
Hard8
Dynamic programming, Divide and conquer+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
LCS 9
Hard8
Dynamic programming, String
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
GomGom and Tetris
Hard8
Game theory, Bit manipulation+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Card Game
Hard8
Game theory, Dynamic programming+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Empty Quadrilaterals
Hard8
Geometry, Dynamic programming+2
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
SubsetMex
Hard8
Greedy, Dynamic programming+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Lego Wall
Hard8
Combinatorics, Dynamic programming+1
No attempts yet
Time limit
3s
Memory limit
1024 MB
Judgeable
Take On Meme
Hard8
Tree, Geometry+1
No attempts yet
Time limit
4s
Memory limit
1024 MB
Judgeable
Unbroken Spirit 3
Hard8
Dynamic programming, Greedy+1
No attempts yet
Time limit
6s
Memory limit
1024 MB
Judgeable
Kalel, the Jumping Frog
Hard8
Dynamic programming, Matrix+1
No attempts yet
Time limit
18s
Memory limit
1024 MB
Judgeable
Reimu's Teleportation Practice
Hard8
Tree, Dynamic programming+1
No attempts yet
Time limit
6s
Memory limit
1024 MB
Judgeable
Game of Questions
Hard8
Dynamic programming, Bit manipulation+1
No attempts yet
Time limit
5s
Memory limit
1024 MB
Judgeable
AibohphobiA
Hard8
Graph, DFS+1
No attempts yet
Time limit
3s
Memory limit
1024 MB
Judgeable
Under Construction Forever
Hard8
Graph, Dynamic programming+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Gold Rush
Hard8
Divide and conquer, Dynamic programming+2
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Lampice
Hard8
Prefix sum, Dynamic programming+1
No attempts yet
Time limit
3s
Memory limit
1024 MB
Judgeable
Sequence and Queries 41
Hard8
Segment tree, Dynamic programming
No attempts yet
Time limit
5s
Memory limit
1024 MB
Judgeable
Tennis
Hard8
Dynamic programming, Math+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Maximum Absolute Value of the Product of Interval Sums
Hard8
Dynamic programming, Prefix sum+1
No attempts yet
Time limit
1s
Memory limit
256 MB
Judgeable
Alps Cable Car 2
Hard8
Dynamic programming, Geometry+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Sotteok-Sotteok 2
Hard8
Segment tree, Dynamic programming+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Exhibition
Hard8
Dynamic programming, Binary search+1
No attempts yet
Time limit
9s
Memory limit
1024 MB
Judgeable
Raises
Hard8
Dynamic programming, Greedy+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Bajtessi's Dribbling
Hard8
Dynamic programming, String+1
No attempts yet
Time limit
9s
Memory limit
1024 MB
Judgeable
Bracket Partitions
Hard8
Dynamic programming, Binary search+1
No attempts yet
Time limit
7s
Memory limit
1024 MB
Judgeable
Sabotage
Hard8
Tree, Binary search+2
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Necklaces
Hard8
Sorting, Binary search+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Breakdown
Hard8
Dynamic programming, Shortest path+2
No attempts yet
Time limit
3s
Memory limit
1024 MB
Judgeable
TwoFour
Hard8
Game theory, Dynamic programming+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Brue Marble
Hard8
Graph, Dynamic programming+1
No attempts yet
Time limit
3s
Memory limit
1024 MB
Judgeable
Procurement Optimization
Hard8
Tree, Dynamic programming+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
GPS Hack
Hard8
Shortest path, Dynamic programming+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
JOIG Tour
Hard8
Dynamic programming, Segment tree
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Stacking Cups
Hard8
Dynamic programming, Combinatorics
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable

Title	Level	Topics	Solved	Time limit	Memory limit	Judge
DroughtCount N-tuples of hunger levels within given upper bounds for which adjacent-pair feedings can make all cows equal, modulo 1e9+7.	Hard8	Dynamic programmingCombinatorics+2	No attempts yet	1s	1024 MB	Judgeable
Number of WordsGiven a run-length compressed string, count the number of distinct subsequences of the fully expanded string, modulo 998244353.	Hard8	Dynamic programmingCombinatorics+2	No attempts yet	1s	1024 MB	Judgeable
Block ArrangementGiven a sequence of N block heights, delete blocks so at least X remain and the largest gap between adjacent kept blocks is minimized; output that smallest possible maximum gap.	Hard8	Binary searchGreedy+2	No attempts yet	4s	512 MB	Judgeable
YFrom a given tree, delete any vertices to leave the largest subtree shaped like a Y: three leaf paths meeting at one center, with no vertex of degree 4 or more.	Hard8	TreeDFS+2	No attempts yet	1.5s	1024 MB	Judgeable
Palindrome GameWith a pile of N stones, players alternately remove a palindromic number of stones; determine whether the first player wins.	Hard8	Game theoryDynamic programming+2	No attempts yet	1s	1024 MB	Judgeable
Gambling GameGiven m, n, and p, compute the probability that a card's n disjoint pairs are all covered exactly on the p-th of m balls drawn without replacement, as a reduced fraction.	Hard8	CombinatoricsProbability+2	No attempts yet	1s	1024 MB	Judgeable
Tomb HaterFind a shortest north-to-south path on a grid that spells a concatenation of given words, moving only south, west, or east without revisiting tiles.	Hard8	Dynamic programmingGraph+2	No attempts yet	4s	1024 MB	Judgeable
Shortest Missing SubsequencesGiven a target string and queries over an alphabet, decide for each query whether it is a shortest string that is not a subsequence of the target.	Hard8	StringGreedy+2	No attempts yet	10s	1024 MB	Judgeable
Redistributing GiftsGiven each cow's preference permutation and breed strings, count the gift reassignments per string where every cow keeps her gift or gets a preferred one within her breed.	Hard8	Dynamic programmingBit manipulation+1	No attempts yet	2s	1024 MB	Judgeable
Cactus EaterGiven a cactus, find the expected total energy released when a random vertex is repeatedly eaten and each remaining component is processed, modulo 998244353.	Hard8	GraphDFS+2	No attempts yet	2s	512 MB	Judgeable
Game with Balls and BoxesBoxes hold a permutation of balls; over two rounds you may open boxes at per-round costs and freely permute balls among open boxes, and must reach the identity, minimizing total cost.	Hard8	GraphGreedy+2	No attempts yet	2s	1024 MB	Judgeable
Math StringSum the values of all length-N strings over digits 1-9 and the operators + and * that form valid expressions, modulo 998244353, with N up to 1e18.	Hard8	Dynamic programmingMath+2	No attempts yet	2s	1024 MB	Judgeable
Box PackingGiven n boxes as ordered pairs, select the most boxes that can be split into at most k chains, where each chain is nondecreasing in both coordinates.	Hard8	Dynamic programmingSorting+2	No attempts yet	1s	256 MB	Judgeable
Fancy ArraysCount length-n arrays whose elements all divide m and whose neighboring elements share a prime factor, modulo 1e9+7, for up to 150 queries.	Hard8	Dynamic programmingNumber theory+2	No attempts yet	2.5s	256 MB	Judgeable
Escaped from NEFGiven a directed graph whose underlying undirected graph is a cactus, count the ordered vertex pairs (x, y) where y is reachable from x.	Hard8	GraphDFS+2	No attempts yet	2s	512 MB	Judgeable
Gross LCSGiven sequences A and B, find the sum of LCS(A + x, B) over every integer shift x, where x is added to every element of A.	Hard8	Dynamic programmingHash map+1	No attempts yet	10s	16 MB	Judgeable
Lucky TicketsGiven n, s, and a prime q, find the sum of luckiness over all q-digit base-n tickets whose digit sum plus digit product is s mod n, modulo q.	Hard8	Dynamic programmingNumber theory+2	No attempts yet	2s	512 MB	Judgeable
DisbalanceEach minute one bacterium is picked at random to divide among n dishes; output the expected sum of the imbalance d over k minutes modulo 998244353.	Hard8	ProbabilityDynamic programming+1	No attempts yet	1s	512 MB	Judgeable
GachaponGiven item frequencies and per-level round counts, compute for each star count the expected number of such items in a legal top-level rolling, times its legality probability, modulo 998244353.	Hard8	Dynamic programmingProbability+1	No attempts yet	5s	512 MB	Judgeable
Pancake-Flavored CookieGiven a map with a lifting ability and a gauge, the task is to choose when to use the ability so the cookie collects the most jellies, with setters and per-time queries.	Hard8	Dynamic programmingSimulation+1	No attempts yet	1s	1024 MB	Judgeable
A+BCount the column permutations of three n-digit rows that make a+b=c hold with no leading zeros, modulo 10^9+7.	Hard8	Dynamic programmingCombinatorics+1	No attempts yet	1s	512 MB	Judgeable
Optical Communication ChannelsGiven a rooted tree where each node has at most k chosen edges, pick the maximum number of edges forming a degree-bounded subgraph, and among those the minimum total weight.	Hard8	TreeDynamic programming+1	No attempts yet	1s	512 MB	Judgeable
Forest GameCount the non-empty sets of trees where B wins the stone game, with each turn moving a stone 1 to K unused branches, modulo 998244353.	Hard8	TreeGame theory+2	No attempts yet	2s	1024 MB	Judgeable
Reconstruction ProjectGiven a connected graph with edge widths, find for each query X the minimum total width change so that a spanning tree has every edge equal to X.	Hard8	GraphMinimum spanning tree+1	No attempts yet	5s	1024 MB	Judgeable
Reversible CompressionFind the shortest code string whose decoding matches the given digits and still matches when the code is reversed. Ties go to the lexicographically smallest.	Hard8	Dynamic programmingString+1	No attempts yet	2s	1024 MB	Judgeable
Genealogy of PuppetsCount the ordered binary trees on n puppets that respect each puppet's child-count limits and require a later-released child under every parent with children, modulo 1e9+7.	Hard8	Dynamic programmingTree+1	No attempts yet	2s	1024 MB	Judgeable
262144 RevisitedMerge adjacent pairs into one more than the larger value, and sum the minimum final number over every contiguous subarray.	Hard8	Divide and conquerDynamic programming+1	No attempts yet	2s	1024 MB	Judgeable
Up Down SubsequenceGiven a permutation and a string of U and D letters, find the longest subsequence whose consecutive comparisons match the letters.	Hard8	Dynamic programmingSegment tree+1	No attempts yet	2s	1024 MB	Judgeable
Pair ProgrammingCount the distinct expressions formed by interleaving two programs of N instructions each, modulo 10^9+7.	Hard8	Dynamic programmingCombinatorics+1	No attempts yet	2s	1024 MB	Judgeable
Punch ThroughGiven N membranes in an N by M tunnel, find the minimum cost to pass through when teleporting costs A and passing a membrane costs B, for many (A, B) queries.	Hard8	Dynamic programmingSegment tree+1	No attempts yet	5s	1024 MB	Judgeable
Flappy BirdFind the maximum total weight of axis-parallel segments Anna can touch on a rightward flight that changes height once inside the box 0 to W by 0 to H.	Hard8	Segment treeDynamic programming+1	No attempts yet	4s	1024 MB	Judgeable
HistogramGiven a histogram of N bars, find the maximum total area of at most K non-overlapping rectangles for K = 1, 2, and 3.	Hard8	StackDynamic programming+1	No attempts yet	4s	1024 MB	Judgeable
Colorful Bracket SequencesCount the distinct colorful bracket subsequences of a colored bracket string, where adjacent and matched brackets must have different colors.	Hard8	Dynamic programmingString	No attempts yet	2s	1024 MB	Judgeable
Gastronomic EventAssign ratings 1 to n to the rooms of a tree so that the number of edge-following paths with increasing ratings is maximized, and print that maximum.	Hard8	TreeDynamic programming+1	No attempts yet	2s	2048 MB	Judgeable
Robot GameCount the input and output tape combinations for which some start square lets every robot finish its operations without exploding and produce its target tape.	Hard8	Bit manipulationDynamic programming+1	No attempts yet	10s	1024 MB	Judgeable
DelicacyFind the maximum happiness from a trip that starts and ends in city 1 on day T, where each city visit adds its value and timed festivals add bonuses, or report -1.	Hard8	MatrixDynamic programming+1	No attempts yet	2s	1024 MB	Judgeable
DestinyCount the 0/1 labelings of tree edges so that every ancestor-descendant pair in Q has at least one edge set to 1 on its path, modulo 998244353.	Hard8	TreeDynamic programming+1	No attempts yet	2s	1024 MB	Judgeable
Systematic salesmanFind the shortest path through all cities when the route must alternate left/right and lower/upper splits of the point set, and print the visiting order.	Hard8	Divide and conquerDynamic programming+1	No attempts yet	6s	256 MB	Judgeable
Cake Slices (Hard)Count the subsets of cake slices, where slice i is 1/c_i of a cake, whose total falls between 0.99 and 1.01 of a whole cake, modulo 10^9+7.	Hard8	Dynamic programmingCombinatorics+1	No attempts yet	3s	1024 MB	Judgeable
Bi-ing Lottery TreeketsCount the distinct winning tickets produced by dropping K numbered balls into a rooted binary tree of N nodes, modulo 1e9+7.	Hard8	TreeDynamic programming+1	No attempts yet	1s	1024 MB	Judgeable
Joined SessionsGiven n intervals, find the fewest merges of overlapping intervals that lower the minimum number of intervals needed to overlap every other interval, or report impossible.	Hard8	IntervalsGreedy+1	No attempts yet	2s	1024 MB	Judgeable
PermutationFor each query k, build a permutation of 0 to n-1 with a small n whose increasing subsequences, including the empty one, number exactly k.	Hard8	GreedyBit manipulation+1	No attempts yet	1s	256 MB	Judgeable
I Herd You Like Ternary OperatorsCount the distinct parse trees of a parenthesis-free ternary expression made of letters, ? and :, modulo 1,000,000,007.	Hard8	StringStack+1	No attempts yet	1s	1024 MB	Judgeable
The Flower of the GameGiven a weighted tree, find the longest path whose vertex weights strictly increase, and report that length again after each weight update query.	Hard8	TreeDynamic programming+1	No attempts yet	6s	1024 MB	Judgeable
Fancy StackCount the stacks that use all n blocks in a zigzag order where even positions strictly increase, modulo 998244353.	Hard8	Dynamic programmingCombinatorics+1	No attempts yet	3s	512 MB	Judgeable
Job LookupGiven a symmetric communication matrix, build a binary search tree on keys 1 to n that minimizes the total weighted distance between all pairs and print each node's parent.	Hard8	Dynamic programmingTree+1	No attempts yet	3s	512 MB	Judgeable
Split into IntervalsChoose exactly K non-overlapping contiguous intervals to maximize the sum of (max minus min) over each interval, for every K from 1 to R.	Hard8	Dynamic programmingArray	No attempts yet	1s	1024 MB	Judgeable
Catfish FarmChoose a fishing spot length for each column of an N by N grid to maximize the total weight of the catfish that can be caught.	Hard8	Dynamic programmingSegment tree	No attempts yet	1s	1024 MB	Judgeable
KingdomChoose K castles, including both endpoints on the x-axis, to maximize the area of their convex hull.	Hard8	Dynamic programmingBinary search+1	No attempts yet	1s	1024 MB	Judgeable
Tipover TransformGiven a row of cells with standing blocks of various heights, find the fewest 1 cm cube blocks needed so the hero can walk from cell 0 to cell N.	Hard8	Dynamic programmingGreedy+1	No attempts yet	1s	1024 MB	Judgeable
ParkingOn a grid with fixed fountains, mark the most free cells as parking so each spot reaches the top-left exit without being blocked by other spots.	Hard8	Dynamic programmingBit manipulation+1	No attempts yet	3s	1024 MB	Judgeable
Make an X (Hard)Given N pushpins, remove the fewest so the rest form an X around one center point, or print -1 if no X is possible.	Hard8	Dynamic programmingSegment tree+1	No attempts yet	1s	1024 MB	Judgeable
Sorting ProgramCount the input sequences of N integers in [1, M] that a given list of conditional swaps sorts into ascending order, modulo 998244353.	Hard8	Dynamic programmingBit manipulation+1	No attempts yet	2s	1024 MB	Judgeable
Cola PickingFind the maximum total cola two shortest paths can collect when they share no cells except the two houses at (1,1) and (N,N).	Hard8	Dynamic programmingMatrix	No attempts yet	3s	1024 MB	Judgeable
Counting SequenceCount sequences of positive integers with adjacent differences of 1 and sum n, weighting each by c raised to the number of descents, modulo 998244353.	Hard8	Dynamic programmingMath+1	No attempts yet	16s	1024 MB	Judgeable
Flower's LandFor each city z, find the largest flower total over a connected set of exactly k cities that includes z, where z is the root of the tree.	Hard8	Dynamic programmingTree+1	No attempts yet	8s	2048 MB	Judgeable
Matrix Multiplication Order 4Given N matrices whose row and column counts never increase, find the fewest multiplications needed to multiply them in their fixed order, with N up to 1,000,000.	Hard8	Dynamic programmingGreedy	No attempts yet	1s	512 MB	Judgeable
RamenGiven N noodle parts with signed deliciousness values, decide whether repeated prefix folds can shrink the noodle to length 1.	Hard8	Dynamic programmingGreedy+1	No attempts yet	1s	1024 MB	Judgeable
One PathFor each i from 0 to K, find the largest graph weight reachable after moving i tree edges, each reattached with its original weight.	Hard8	TreeDynamic programming	No attempts yet	1s	1024 MB	Judgeable
Squirrel GameTwinkle and Nova alternately place acorns on empty stones left of some squirrel, and the player with no legal move loses. Find the winner.	Hard8	Game theoryDynamic programming+1	No attempts yet	3s	1024 MB	Judgeable
Two PathsGiven a weighted tree and queries (u, v, A, B), find vertex-disjoint paths from u and from v that maximize A times the first path weight plus B times the second.	Hard8	TreeDynamic programming+1	No attempts yet	5s	1024 MB	Judgeable
String Strange SumGiven a lowercase string s, sum over all segments [l, r] with 2 <= l <= r <= \|s\| the longest suffix of s[1, l-1] that splits into prefixes of s[l, r].	Hard8	String matchingString+1	No attempts yet	4s	1024 MB	Judgeable
Triangular Cactus PathsCount simple paths of exact length k between s and f in a triangular cactus graph for each query, modulo 998244353.	Hard8	GraphTree+1	No attempts yet	2s	1024 MB	Judgeable
K-Item Shopping SpreeCount length-k sequences of item indices (repeats and order allowed) whose prices sum to each query target, modulo 997.	Hard8	MathDynamic programming+1	No attempts yet	10s	1024 MB	Judgeable
Prime ArrangementGiven RC distinct primes, count the ways to fill an R by C grid so that each row's product has a prescribed rank among all row products.	Hard8	CombinatoricsSorting+1	No attempts yet	1s	1024 MB	Judgeable
Darkest DungeonGiven a tree of N rooms and a limit of K passages, find a start room and a walk crossing at most K passages that visits the most distinct rooms.	Hard8	TreeDynamic programming+1	No attempts yet	1.5s	1024 MB	Judgeable
Hug MeGiven N points with distinct heights, find for each query point the most points a downward path can pass, where each step drops no more than it moves sideways.	Hard8	Dynamic programmingDivide and conquer+1	No attempts yet	2s	1024 MB	Judgeable
LCS 9Given strings A and B, sum the LCS lengths over every prefix of A paired with every substring of B.	Hard8	Dynamic programmingString	No attempts yet	2s	1024 MB	Judgeable
GomGom and TetrisTwo players alternately place Tetris pieces or 1x1 blocks on an N by M board to maximize their own score, and the task is to decide the winner with a 0.5 first-player penalty.	Hard8	Game theoryBit manipulation+1	No attempts yet	2s	1024 MB	Judgeable
Card GameAlice and Bob alternately pick a card on an N by M grid and remove its connected diagonal run by color. Determine whether the first player wins.	Hard8	Game theoryDynamic programming+1	No attempts yet	1s	1024 MB	Judgeable
Empty QuadrilateralsCount simple quadrilaterals on a point set with no three collinear whose interiors contain no other points, for up to 300 points.	Hard8	GeometryDynamic programming+2	No attempts yet	2s	1024 MB	Judgeable
SubsetMexGiven the counts f_i of each value below n in a multiset, find the fewest subset-and-mex operations needed to insert n.	Hard8	GreedyDynamic programming+1	No attempts yet	1s	1024 MB	Judgeable
Lego WallCount the connected, hole-free walls of width w and height h built from 1x1x1 and 2x1x1 bricks, modulo 1000000007.	Hard8	CombinatoricsDynamic programming+1	No attempts yet	3s	1024 MB	Judgeable
Take On MemeGiven a rooted vote tree where each child's (x, y) vector is added or subtracted at every node, find the largest squared length the root can reach.	Hard8	TreeGeometry+1	No attempts yet	4s	1024 MB	Judgeable
Unbroken Spirit 3For each k from 1 to N, find the maximum total length the thief can cut from the dragons when shooting at most one arrow per day through day k.	Hard8	Dynamic programmingGreedy+1	No attempts yet	6s	1024 MB	Judgeable
Kalel, the Jumping FrogCount the jump sequences that take Kalel from stone 1 to stone N with total energy at most K, modulo 1e9, for jumps of length up to 10.	Hard8	Dynamic programmingMatrix+1	No attempts yet	18s	1024 MB	Judgeable
Reimu's Teleportation PracticeGiven a tree where K nodes are priests who can teleport to any priest with equal chance, find the minimum expected moves from A to B.	Hard8	TreeDynamic programming+1	No attempts yet	6s	1024 MB	Judgeable
Game of QuestionsGiven n questions answered correctly or not by m participants, find the probability that participant 1 is the last one left after all questions are asked in a random order.	Hard8	Dynamic programmingBit manipulation+1	No attempts yet	5s	1024 MB	Judgeable
AibohphobiAFind the longest walk from (0, 0) to (M-1, N-1) that visits each query cell and has no palindromic substring, or report -1 or -2.	Hard8	GraphDFS+1	No attempts yet	3s	1024 MB	Judgeable
Under Construction ForeverGiven a connected graph of buildings with costs, find the fewest buildings left after leaf-absorbing reconstructions, the minimum cost for that count, and the number of ways modulo 1,000,000,007.	Hard8	GraphDynamic programming+1	No attempts yet	1s	1024 MB	Judgeable
Gold RushCount the distinct win-loss records possible in an n-player single-elimination bracket with best-of-k matches, modulo 1,000,003.	Hard8	Divide and conquerDynamic programming+2	No attempts yet	1s	1024 MB	Judgeable
LampiceCount axis-aligned rectangles with integer corners on an n by m terrace where, for each colour, both lamps are inside or both are outside.	Hard8	Prefix sumDynamic programming+1	No attempts yet	3s	1024 MB	Judgeable
Sequence and Queries 41Given an array, process range updates that set each A_i to max(A_i, x) and queries for the maximum subarray sum inside a range, floored at 0.	Hard8	Segment treeDynamic programming	No attempts yet	5s	1024 MB	Judgeable
TennisFind the sum of costs over all n-ball sequences whose weight sum mod w is at most x, where cost is the count of balls with weight at most y raised to the power k.	Hard8	Dynamic programmingMath+1	No attempts yet	1s	1024 MB	Judgeable
Maximum Absolute Value of the Product of Interval SumsGiven an integer array and at most K non-overlapping intervals, find the maximum absolute value of the product of the interval sums.	Hard8	Dynamic programmingPrefix sum+1	No attempts yet	1s	256 MB	Judgeable
Alps Cable Car 2Connect the peaks of N triangles from peak 1 to peak N using at most K wires, minimizing the sum of squared wire lengths.	Hard8	Dynamic programmingGeometry+1	No attempts yet	2s	1024 MB	Judgeable
Sotteok-Sotteok 2Remove some foods, then pick one vertical line so the foods it crosses, sorted by height, alternate sausage and rice cake with the maximum total length.	Hard8	Segment treeDynamic programming+1	No attempts yet	2s	1024 MB	Judgeable
ExhibitionPick Anna's or Bogusław's painting each week so exactly k are Anna's, minimizing the maximum subarray sum of the hung values.	Hard8	Dynamic programmingBinary search+1	No attempts yet	9s	1024 MB	Judgeable
RaisesSplit a sequence into k contiguous segments so that no strictly increasing sequence picks one element from each segment, or report that no such split exists.	Hard8	Dynamic programmingGreedy+1	No attempts yet	2s	1024 MB	Judgeable
Bajtessi's DribblingFor each pair of dribbles, count the distinct balanced, left-sided subsequences of their concatenation, modulo 1e9+7.	Hard8	Dynamic programmingString+1	No attempts yet	9s	1024 MB	Judgeable
Bracket PartitionsSplit a bracket string of length n into k contiguous parts so that the total number of correct bracket substrings across all parts is as small as possible.	Hard8	Dynamic programmingBinary search+1	No attempts yet	7s	1024 MB	Judgeable
SabotageGiven a boss-subordinate tree of n employees and a limit k, find the smallest morale x so that any saboteur's revolt involves at most k people.	Hard8	TreeBinary search+2	No attempts yet	2s	1024 MB	Judgeable
NecklacesGiven n beads with values, find the k-th subset ordered by total value, with ties broken by the lexicographic order of bead numbers.	Hard8	SortingBinary search+1	No attempts yet	2s	1024 MB	Judgeable
BreakdownGiven a complete directed graph with edges removed one at a time, report the shortest path from node 1 to node N using exactly K edges after each removal.	Hard8	Dynamic programmingShortest path+2	No attempts yet	3s	1024 MB	Judgeable
TwoFourGiven initial piles of 0 to 4 balls, find the winner of TwoFour under optimal play, where each two-ball pile belongs to whoever last moved it.	Hard8	Game theoryDynamic programming+1	No attempts yet	1s	1024 MB	Judgeable
Brue MarbleGiven a grid of arrows and timed point events, find the score after L moves from a start cell, applying events as they are added.	Hard8	GraphDynamic programming+1	No attempts yet	3s	1024 MB	Judgeable
Procurement OptimizationAssign counts to tree vertices so each subtree sum lies in its [l, r] range, minimizing the total cost of counts times prices.	Hard8	TreeDynamic programming+1	No attempts yet	1s	1024 MB	Judgeable
GPS HackCount the s-to-t routes with total time exactly L, where the hacked GPS may deviate from a shortest path at most once, modulo 1e9+7.	Hard8	Shortest pathDynamic programming+1	No attempts yet	1s	1024 MB	Judgeable
JOIG TourGiven paintings labeled J, O, I, G on a line, find for each query the shortest walk from S that visits a J, an O, an I, and a G painting in that order, then ends at T.	Hard8	Dynamic programmingSegment tree	No attempts yet	1s	1024 MB	Judgeable
Stacking CupsCount the valid stacks of exactly N red and blue cups, where each cup on top sits on two neighbors with at least one red, modulo prime P.	Hard8	Dynamic programmingCombinatorics	No attempts yet	2s	1024 MB	Judgeable