Dynamic programming ladder

Every judgeable DP problem, easiest first

Under construction

Still being built. Things may change

Total results6,390 problems

Don't Dodge the Money
Hard9
Greedy, Sorting+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Lava Jump 2
Hard9
Dynamic programming, Divide and conquer+1
No attempts yet
Time limit
2s
Memory limit
512 MB
Judgeable
Fun with Stones
Hard9
Combinatorics, Bit manipulation+2
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Arbitration
Hard9
Dynamic programming, Combinatorics+1
No attempts yet
Time limit
10s
Memory limit
1024 MB
Judgeable
Big Numbers
Hard9
Tree, Dynamic programming+2
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Khalin Graph
Hard9
Dynamic programming, Tree+2
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Sequence and Queries 42
Hard9
Dynamic programming, Divide and conquer+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Polygons
Hard9
Number theory, Geometry+2
No attempts yet
Time limit
10s
Memory limit
1024 MB
Judgeable
Landing Raid
Hard9
Divide and conquer, Combinatorics+1
No attempts yet
Time limit
6s
Memory limit
1024 MB
Judgeable
Fibonacci Products
Hard9
Dynamic programming, String+1
No attempts yet
Time limit
20s
Memory limit
1024 MB
Judgeable
Tekstówka
Hard9
Dynamic programming, String+1
No attempts yet
Time limit
8s
Memory limit
1024 MB
Judgeable
Desant 2
Hard9
Dynamic programming, Divide and conquer+1
No attempts yet
Time limit
42s
Memory limit
1024 MB
Judgeable
Independent Sets
Hard9
Combinatorics, Tree+2
No attempts yet
Time limit
45s
Memory limit
1024 MB
Judgeable
Great Thermion Collider
Hard9
Dynamic programming, Segment tree+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Harsh Winter
Hard9
Dynamic programming, Segment tree+1
No attempts yet
Time limit
22s
Memory limit
1024 MB
Judgeable
IQ Game
Hard9
Probability, Combinatorics+2
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Fish Game
Hard9
Simulation, Sorting+2
No attempts yet
Time limit
3s
Memory limit
1024 MB
Judgeable
Indecisive Nikolaj
Hard9
Game theory, Dynamic programming+2
No attempts yet
Time limit
3s
Memory limit
1024 MB
Judgeable
Sports Day
Hard9
Game theory, Dynamic programming+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Outer Ring Road 2
Hard9
Graph, Tree+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Typing Contest
Hard9
Dynamic programming, Bit manipulation+1
No attempts yet
Time limit
2.5s
Memory limit
1024 MB
Judgeable
Mana Collection
Hard9
Dynamic programming, Bit manipulation+2
No attempts yet
Time limit
5s
Memory limit
1024 MB
Judgeable
Festivals in JOI Kingdom 2
Hard9
Dynamic programming, Combinatorics+1
No attempts yet
Time limit
6s
Memory limit
1024 MB
Judgeable
Forever Young
Hard9
Dynamic programming, Combinatorics+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Matching on Tree Distance Graph
Hard9
Dynamic programming, Tree+1
No attempts yet
Time limit
5s
Memory limit
952 MB
Judgeable
Japanese Lottery
Hard9
Dynamic programming, Segment tree+1
No attempts yet
Time limit
4s
Memory limit
1024 MB
Judgeable
Active Preparation for the Battle
Hard9
Dynamic programming, Divide and conquer+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
The Dog, the Traitor, and the Cables
Hard9
Graph, BFS+2
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Help Prapor
Hard9
Combinatorics, Math+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Black and White
Hard9
Graph, Dynamic programming+2
No attempts yet
Time limit
5s
Memory limit
1024 MB
Judgeable
Pandora's Box
Hard9
Dynamic programming, Hash map+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
A Walk Through Brooklyn
Hard9
Graph, Dynamic programming+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Candelabra
Hard9
Divide and conquer, Tree+2
No attempts yet
Time limit
5s
Memory limit
1024 MB
Judgeable
Kevin's Player
Hard9
Dynamic programming, Greedy+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Evacuation
Hard9
Tree, Dynamic programming+2
No attempts yet
Time limit
3s
Memory limit
1024 MB
Judgeable
Jenga
Hard9
Game theory, Dynamic programming+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Two Captains
Hard9
Dynamic programming, Simulation+1
No attempts yet
Time limit
3s
Memory limit
1024 MB
Judgeable
Fibonacci Digit Count
Hard9
Math, Dynamic programming+2
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Truck Driver
Hard9
Tree, Dynamic programming+1
No attempts yet
Time limit
4.5s
Memory limit
1024 MB
Judgeable
Soccer Stadium
Hard9
Matrix, Dynamic programming+1
No attempts yet
Time limit
3.5s
Memory limit
1024 MB
Judgeable
Mineral Collection
Hard9
Sorting, Greedy+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Segment Union
Hard9
Sorting, Dynamic programming+1
No attempts yet
Time limit
5s
Memory limit
1024 MB
Judgeable
HLD
Hard9
Tree, Dynamic programming+1
No attempts yet
Time limit
5s
Memory limit
1024 MB
Judgeable
Best parentheses
Hard9
Dynamic programming, Divide and conquer+2
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Count
Hard9
Tree, Divide and conquer+1
No attempts yet
Time limit
6s
Memory limit
2048 MB
Judgeable
Butterfly and Telephone Poles (Hard)
Hard9
Dynamic programming, Segment tree+1
No attempts yet
Time limit
4.5s
Memory limit
1024 MB
Judgeable
Osmanthus Tree
Hard9
Dynamic programming, Tree+1
No attempts yet
Time limit
0.5s
Memory limit
1024 MB
Judgeable
Why Hobanwoo Was Late for School 8
Hard9
Dynamic programming, Geometry+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Double Palindrome
Hard9
String, String matching+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Cartesian
Hard9
Binary search, Dynamic programming+1
No attempts yet
Time limit
10s
Memory limit
1024 MB
Judgeable
M. S. I. S.
Hard9
Dynamic programming, Graph+1
No attempts yet
Time limit
0.5s
Memory limit
2048 MB
Judgeable
Organizing Bags in Mabinogi
Hard9
Segment tree, Divide and conquer+1
No attempts yet
Time limit
4s
Memory limit
1024 MB
Judgeable
Wiring Engineering
Hard9
Dynamic programming, Divide and conquer+1
No attempts yet
Time limit
8s
Memory limit
1024 MB
Judgeable
LIS Counting
Hard9
Dynamic programming, Combinatorics+2
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Paimon's Tree
Hard9
Dynamic programming, Tree+1
No attempts yet
Time limit
4s
Memory limit
1024 MB
Judgeable
Crystalfly
Hard9
Dynamic programming, Tree+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Cloud Retainer's Game
Hard9
Dynamic programming, Segment tree+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Sorted Fractal Sequence
Hard9
Dynamic programming, Combinatorics+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Matrix Fraud
Hard9
Dynamic programming, Prefix sum+1
No attempts yet
Time limit
1s
Memory limit
2048 MB
Judgeable
Island
Hard9
Graph, Dynamic programming+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Lepeze
Hard9
Combinatorics, Tree+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Ladybug
Hard9
Dynamic programming, Matrix+1
No attempts yet
Time limit
2s
Memory limit
512 MB
Judgeable
Meow
Hard9
Tree, Dynamic programming+2
No attempts yet
Time limit
0.5s
Memory limit
1024 MB
Judgeable
Dormitory Parcel Delivery
Hard9
Dynamic programming, Divide and conquer+1
No attempts yet
Time limit
1s
Memory limit
1024 MB
Judgeable
Grid Game
Hard9
Game theory, Bit manipulation+2
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
\prod_{i=1}^N(R_i-L_i+1) Trees
Hard9
Tree, Dynamic programming+2
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Tree
Hard9
Tree, Dynamic programming+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Jump
Hard9
Tree, Divide and conquer+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
LIS On Tree
Hard9
Tree, Dynamic programming+2
No attempts yet
Time limit
4s
Memory limit
1024 MB
Judgeable
Tree Generators
Hard9
Tree, Dynamic programming+1
No attempts yet
Time limit
2s
Memory limit
2048 MB
Judgeable
Expected Beauty
Hard9
Dynamic programming, Probability+1
No attempts yet
Time limit
1s
Memory limit
2048 MB
Judgeable
Grid Game 3-angle
Hard9
Game theory, Math+1
No attempts yet
Time limit
1s
Memory limit
2048 MB
Judgeable
X Aura
Hard9
Graph, Shortest path+1
No attempts yet
Time limit
1s
Memory limit
2048 MB
Judgeable
Hardcore String Counting
Hard9
String matching, Dynamic programming+1
No attempts yet
Time limit
8s
Memory limit
2048 MB
Judgeable
Too Many Edges
Hard9
Graph, Dynamic programming+1
No attempts yet
Time limit
15s
Memory limit
2048 MB
Judgeable
01tree
Hard9
Tree, Dynamic programming+1
No attempts yet
Time limit
1s
Memory limit
2048 MB
Judgeable
Colored Slime Balls
Hard9
Dynamic programming, Intervals
No attempts yet
Time limit
2s
Memory limit
2048 MB
Judgeable
Sugar Sweet II
Hard9
Probability, Dynamic programming+1
No attempts yet
Time limit
2s
Memory limit
2048 MB
Judgeable
Median Heap
Hard9
Tree, Dynamic programming+1
No attempts yet
Time limit
4s
Memory limit
2048 MB
Judgeable
Logo
Hard10
Dynamic programming, Bit manipulation+2
No attempts yet
Time limit
1s
Memory limit
128 MB
Judgeable
Hyperrectangle
Hard10
Math, Divide and conquer+2
No attempts yet
Time limit
2s
Memory limit
512 MB
Judgeable
Salty Fish
Hard10
Tree, Dynamic programming
No attempts yet
Time limit
3s
Memory limit
512 MB
Judgeable
Dense Subgraph
Hard10
Tree, Binary search+2
No attempts yet
Time limit
3s
Memory limit
512 MB
Judgeable
Mysterious … Host
Hard10
Combinatorics, Math+2
No attempts yet
Time limit
2s
Memory limit
256 MB
Judgeable
Magic Locks
Hard10
Matrix, Graph+2
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Joint Training
Hard10
Graph, Dynamic programming+1
No attempts yet
Time limit
3s
Memory limit
1024 MB
Judgeable
Prof. Pang's sequence
Hard10
Divide and conquer, Array+2
No attempts yet
Time limit
3s
Memory limit
1024 MB
Judgeable
Antichamber
Hard10
Union-find, Simulation+1
No attempts yet
Time limit
5s
Memory limit
1024 MB
Judgeable
Contest Strategy
Hard10
Dynamic programming, Divide and conquer+1
No attempts yet
Time limit
2s
Memory limit
1024 MB
Judgeable
Edges and Divisors
Hard10
Graph, Dynamic programming+1
No attempts yet
Time limit
1s
Memory limit
2048 MB
Judgeable

Title	Level	Topics	Solved	Time limit	Memory limit	Judge
Don't Dodge the MoneyFind the minimum total key-press effort for Green to collect every coin falling on a grid, where left/right moves and jumps each have their own cost.	Hard9	GreedySorting+1	No attempts yet	1s	1024 MB	Judgeable
Lava Jump 2Count the ordered jump sequences, where each jump is at least twice the previous distance, that leave exactly one platform, after the initial setup and after each position change.	Hard9	Dynamic programmingDivide and conquer+1	No attempts yet	2s	512 MB	Judgeable
Fun with StonesGiven three pile ranges, find the probability Alice wins Nim with random pile sizes, modulo 1e9+7.	Hard9	CombinatoricsBit manipulation+2	No attempts yet	1s	1024 MB	Judgeable
ArbitrationCount the ways to assign votes from 1 to k to the n-1 horizontal and m-1 vertical judges so every cell's signed sum matches the target grid, modulo 10^9+7.	Hard9	Dynamic programmingCombinatorics+1	No attempts yet	10s	1024 MB	Judgeable
Big NumbersGiven a rooted tree whose edge lengths are powers of 2, find the maximum total length of a trip from the root, modulo 998244353.	Hard9	TreeDynamic programming+2	No attempts yet	2s	1024 MB	Judgeable
Khalin GraphGiven a Halin graph through its base tree, count edge subsets where every connected component is a single vertex or a tree on 3 vertices, modulo 998244353.	Hard9	Dynamic programmingTree+2	No attempts yet	2s	1024 MB	Judgeable
Sequence and Queries 42Given a permutation A of length N, answer Q queries, each asking for the length of the longest increasing subsequence of A[l..r].	Hard9	Dynamic programmingDivide and conquer+1	No attempts yet	2s	1024 MB	Judgeable
PolygonsCount convex polygons on an X by Y lattice grid whose sides have no interior lattice points and integer length at most K, modulo 2^32.	Hard9	Number theoryGeometry+2	No attempts yet	10s	1024 MB	Judgeable
Landing RaidChoose k of n soldiers so the chosen subsequence of permutation a has the fewest inversions, then count the optimal choices for each k.	Hard9	Divide and conquerCombinatorics+1	No attempts yet	6s	1024 MB	Judgeable
Fibonacci ProductsGiven two positive integers in Zeckendorf form, print their product in the same Fibonacci representation. Total input length is up to 10^6 bits.	Hard9	Dynamic programmingString+1	No attempts yet	20s	1024 MB	Judgeable
TekstówkaGiven strings s and t, answer q queries, each asking for the LCS length of a substring of s and a substring of t.	Hard9	Dynamic programmingString+1	No attempts yet	8s	1024 MB	Judgeable
Desant 2Given an array and k, answer range queries by finding the maximum sum of non-overlapping length-k blocks chosen inside each query range.	Hard9	Dynamic programmingDivide and conquer+1	No attempts yet	42s	1024 MB	Judgeable
Independent SetsCount unlabeled c-colored trees whose maximum independent set size is between l and r, modulo 998244353.	Hard9	CombinatoricsTree+2	No attempts yet	45s	1024 MB	Judgeable
Great Thermion ColliderCount the ways to turn each blue thermion into red or green so that the chain can react down to one thermion, and report this count after each point update.	Hard9	Dynamic programmingSegment tree+1	No attempts yet	2s	1024 MB	Judgeable
Harsh WinterStations break and get repaired each day; find the least time for a plow starting at a given point to clear the whole road of length l.	Hard9	Dynamic programmingSegment tree+1	No attempts yet	22s	1024 MB	Judgeable
IQ GameGiven k remaining envelopes on a circle of n sectors, find the expected number of rounds until the Hyperblitz envelope is opened, modulo 998244353.	Hard9	ProbabilityCombinatorics+2	No attempts yet	2s	1024 MB	Judgeable
Fish GameGiven fish moving left across a grid, find the maximum points a fish can eat while avoiding larger fish, over all starting rows.	Hard9	SimulationSorting+2	No attempts yet	3s	1024 MB	Judgeable
Indecisive NikolajEach starting cell of an N by M grid is a minimax game between alternating moves, and the task sums the resulting utilities over all cells modulo 998244353.	Hard9	Game theoryDynamic programming+2	No attempts yet	3s	1024 MB	Judgeable
Sports DayGiven four teams of 15 soldiers with skills in three events, decide whether team A has a lineup that wins the overall title against every placement of the other teams.	Hard9	Game theoryDynamic programming+1	No attempts yet	1s	1024 MB	Judgeable
Outer Ring Road 2Choose roads of minimum total weight so that every odd-length simple cycle in the tree-plus-ring graph contains at least one chosen road.	Hard9	GraphTree+1	No attempts yet	2s	1024 MB	Judgeable
Typing ContestGiven a 15-letter string and each contestant's press, left, and right costs, find the minimum typing time when the keys can be placed in any order on one row.	Hard9	Dynamic programmingBit manipulation+1	No attempts yet	2.5s	1024 MB	Judgeable
Mana CollectionGiven a directed graph of mana pools with collection rates, find the most mana collectable in s seconds while ending at pool e, for each query.	Hard9	Dynamic programmingBit manipulation+2	No attempts yet	5s	1024 MB	Judgeable
Festivals in JOI Kingdom 2Count the pairs of sequences a and b of N intervals using each value from 1 to 2N once, where greedy selection by start time is not optimal, modulo prime P.	Hard9	Dynamic programmingCombinatorics+1	No attempts yet	6s	1024 MB	Judgeable
Forever YoungCount the ways to turn non-increasing array A into B in exactly k unit steps, where every intermediate array must also stay non-increasing.	Hard9	Dynamic programmingCombinatorics+1	No attempts yet	2s	1024 MB	Judgeable
Matching on Tree Distance GraphGiven a weighted tree, find the maximum total weight of a matching of size k in the complete graph where edge weights are tree distances, for every k.	Hard9	Dynamic programmingTree+1	No attempts yet	5s	952 MB	Judgeable
Japanese LotteryAfter each toggle of a horizontal bar in an Amida-kuji grid, find the fewest bars to remove so that every start leg reaches its matching prize.	Hard9	Dynamic programmingSegment tree+1	No attempts yet	4s	1024 MB	Judgeable
Active Preparation for the BattleGiven n people with strength p and alert cost c, for each query x find the minimum total alert cost needed to reach total strength at least x, or -1 if impossible.	Hard9	Dynamic programmingDivide and conquer+1	No attempts yet	2s	1024 MB	Judgeable
The Dog, the Traitor, and the CablesFind the maximum number of cable segments a dog can bite on a shortest path from (1,1) to each queried cell in a grid with cables.	Hard9	GraphBFS+2	No attempts yet	2s	1024 MB	Judgeable
Help PraporGiven an odd-length array of distinct integers, sum the maximum-weight perfect matching cost over all permutations, modulo 998244353.	Hard9	CombinatoricsMath+1	No attempts yet	1s	1024 MB	Judgeable
Black and WhiteCount the spanning trees of a wheel-shaped graph for each k, where k is the number of trees' roads controlled by the White gang.	Hard9	GraphDynamic programming+2	No attempts yet	5s	1024 MB	Judgeable
Pandora's BoxGiven n mountain heights, find the fewest segment operations on equal-height endpoints that make the heights nondecreasing, and list the segments in order.	Hard9	Dynamic programmingHash map+1	No attempts yet	2s	1024 MB	Judgeable
A Walk Through BrooklynPick a walk from the north edge to the south edge along house boundaries that splits the grid area into two parts with the smallest difference.	Hard9	GraphDynamic programming+1	No attempts yet	2s	1024 MB	Judgeable
CandelabraGiven a tree of n vertices labeled with letters a to t, find the longest path subsequence with no palindromic substring of length 2 or more.	Hard9	Divide and conquerTree+2	No attempts yet	5s	1024 MB	Judgeable
Kevin's PlayerGiven songs with joy-valued liked segments and a speed-up factor v, find the minimum listening time needed to gather joy F.	Hard9	Dynamic programmingGreedy+1	No attempts yet	2s	1024 MB	Judgeable
EvacuationEach room has one person who must reach a leaf exit before the detonator on each corridor fires. Find the maximum number who escape.	Hard9	TreeDynamic programming+2	No attempts yet	3s	1024 MB	Judgeable
JengaTwo players take turns moving blocks in a Jenga tower, and whoever leaves an unstable layer below the top one loses. The task asks who wins with optimal play.	Hard9	Game theoryDynamic programming+1	No attempts yet	2s	1024 MB	Judgeable
Two CaptainsGiven two command plans over n cannons, find the fewest rum commands to insert so no cannon ever holds crew from both captains.	Hard9	Dynamic programmingSimulation+1	No attempts yet	3s	1024 MB	Judgeable
Fibonacci Digit CountCount occurrences of the substring "11" within the first N characters of the infinite string formed by writing 1, 2, 3, ... in Fibonacci (Zeckendorf) representation.	Hard9	MathDynamic programming+2	No attempts yet	2s	1024 MB	Judgeable
Truck DriverGiven a weighted tree with delivery counts per city that change over Q updates, find the maximum round-trip delivery time from city 0 after each update.	Hard9	TreeDynamic programming+1	No attempts yet	4.5s	1024 MB	Judgeable
Soccer StadiumGiven an N by N grid with trees, find the largest set of empty cells where any two cells connect within two straight row or column moves inside the set.	Hard9	MatrixDynamic programming+1	No attempts yet	3.5s	1024 MB	Judgeable
Mineral CollectionGiven minerals on a ray from position 0, answer for each query whether two named minerals can share one gem in a minimum-energy collection plan.	Hard9	SortingGreedy+1	No attempts yet	1s	1024 MB	Judgeable
Segment UnionGiven centers x_i and radii a_i, sum the union length of the intervals [x_i - r, x_i + r] over all ways to assign the radii to the centers, modulo 1e9+7.	Hard9	SortingDynamic programming+1	No attempts yet	5s	1024 MB	Judgeable
HLDAfter each update adds k copies of a tree path, print the fewest light edges achievable when each vertex keeps at most one heavy child edge.	Hard9	TreeDynamic programming+1	No attempts yet	5s	1024 MB	Judgeable
Best parenthesesChoose a subsequence of parentheses that forms a balanced string, maximizing the sum of the chosen c values.	Hard9	Dynamic programmingDivide and conquer+2	No attempts yet	2s	1024 MB	Judgeable
CountGiven a rooted tree and queries (u, d), build the edge set induced by vertices within distance d of u using at most M calls to R and C.	Hard9	TreeDivide and conquer+1	No attempts yet	6s	2048 MB	Judgeable
Butterfly and Telephone Poles (Hard)Pole heights change over time. For each query at start pole p, find the valid wire chain with the largest total length and print its squared cost.	Hard9	Dynamic programmingSegment tree+1	No attempts yet	4.5s	1024 MB	Judgeable
Osmanthus TreeCount trees on n+m vertices that keep the LCAs of the given tree T on vertices 1 to n and keep each pairwise LCA label within max(i, j) + k, modulo 1e9+7.	Hard9	Dynamic programmingTree+1	No attempts yet	0.5s	1024 MB	Judgeable
Why Hobanwoo Was Late for School 8Find the minimum total time to reach planet N from the origin, where a move to planet e costs a_e if the start lies on the hull of planets 0 to e, otherwise b_e.	Hard9	Dynamic programmingGeometry+1	No attempts yet	2s	1024 MB	Judgeable
Double PalindromeCounts substrings of s that split into two equal-length halves, where each half is a palindrome, with n up to 500000.	Hard9	StringString matching+1	No attempts yet	2s	1024 MB	Judgeable
CartesianGiven n points, pick k disjoint pairs so the common intersection of their bounding rectangles is a square; find the largest possible side length.	Hard9	Binary searchDynamic programming+1	No attempts yet	10s	1024 MB	Judgeable
M. S. I. S.Given a 2 by n matrix, reorder its columns to maximize the sum of the best increasing subsequence sums in the two rows.	Hard9	Dynamic programmingGraph+1	No attempts yet	0.5s	2048 MB	Judgeable
Organizing Bags in MabinogiAfter each record, find the maximum total value of non-overlapping items (sizes 1x1 to 2x2, no rotation) that fit in the current bag.	Hard9	Segment treeDivide and conquer+1	No attempts yet	4s	1024 MB	Judgeable
Wiring EngineeringGiven a weight matrix and building and tower install costs, answer many range queries for the maximum profit of non-crossing wires within chosen index ranges.	Hard9	Dynamic programmingDivide and conquer+1	No attempts yet	8s	1024 MB	Judgeable
LIS CountingGiven N, M, and a prime P, count permutations of length N*M with LIS N and LDS M, broken down by the value at each position, modulo P.	Hard9	Dynamic programmingCombinatorics+2	No attempts yet	2s	1024 MB	Judgeable
Paimon's TreeChoose a starting vertex and a growth order so the i-th added edge gets weight a_i, then maximize the diameter of the resulting weighted tree.	Hard9	Dynamic programmingTree+1	No attempts yet	4s	1024 MB	Judgeable
CrystalflyGiven a tree where each vertex has flies and a 1 to 3 second disappearance timer, find the most flies Paimon can catch starting from vertex 1.	Hard9	Dynamic programmingTree+1	No attempts yet	2s	1024 MB	Judgeable
Cloud Retainer's GameRemove some wooden boards so a pinball bouncing between y=0 and y=H collects as many coins as possible, and report the maximum count.	Hard9	Dynamic programmingSegment tree+1	No attempts yet	2s	1024 MB	Judgeable
Sorted Fractal SequenceCount non-decreasing sequences of length N where a[a[i]] equals a[i] for every i, with K fixed entries, modulo M.	Hard9	Dynamic programmingCombinatorics+1	No attempts yet	1s	1024 MB	Judgeable
Matrix FraudFind the fewest cell toggles that make every row a contiguous block of 1s, every column contain a 1, and both row endpoints never move left.	Hard9	Dynamic programmingPrefix sum+1	No attempts yet	1s	2048 MB	Judgeable
IslandGiven an N-gon with non-crossing diagonals, find the fewest incenter insertions so the graph contains two edge-disjoint spanning trees.	Hard9	GraphDynamic programming+1	No attempts yet	1s	1024 MB	Judgeable
LepezeUnder flip operations on a polygon triangulation, report the fewest flips needed to reach the fan at vertex x and how many shortest flip sequences exist.	Hard9	CombinatoricsTree+1	No attempts yet	2s	1024 MB	Judgeable
LadybugCount the distinguishable escape routes from cell (I, 1) to the exit in each row, where two routes match if they visit the same cells and have the same first-visit rows per column.	Hard9	Dynamic programmingMatrix+1	No attempts yet	2s	512 MB	Judgeable
MeowCount chains of nodes with values 1 through L where each node is an ancestor of the next, under point value updates, and output the weighted sum of answers over all queries.	Hard9	TreeDynamic programming+2	No attempts yet	0.5s	1024 MB	Judgeable
Dormitory Parcel DeliveryFind the minimum time to start at the storage room, deliver every parcel, and return, when carried weight slows the walking speed to 1/(1+W).	Hard9	Dynamic programmingDivide and conquer+1	No attempts yet	1s	1024 MB	Judgeable
Grid GameTwo players alternate moving along right and down paths on a grid of XOR-modified values, and the task is to decide which player wins with optimal play.	Hard9	Game theoryBit manipulation+2	No attempts yet	2s	1024 MB	Judgeable
\prod_{i=1}^N(R_i-L_i+1) TreesGiven a rooted tree with per-vertex caps and subtree sum lower bounds, sum the minimum weighted cost over all cost vectors in given ranges, modulo 998244353.	Hard9	TreeDynamic programming+2	No attempts yet	2s	1024 MB	Judgeable
TreeGiven a rooted weighted tree, find the minimum total of \|C[i]\| times W[i] so that every subtree coefficient sum lies between L and R.	Hard9	TreeDynamic programming+1	No attempts yet	2s	1024 MB	Judgeable
JumpGiven building heights, sum the minimum total squared-height-difference cost over all pairs of buildings that can reach each other by visible jumps, modulo 1000000007.	Hard9	TreeDivide and conquer+1	No attempts yet	2s	1024 MB	Judgeable
LIS On TreeGiven a tree where node x_i receives value i in order, report after each update the longest increasing subsequence over any path's nonblank values.	Hard9	TreeDynamic programming+2	No attempts yet	4s	1024 MB	Judgeable
Tree GeneratorsGiven two expressions that build trees by joining subtrees with a random edge, count the distinct trees both expressions can generate, modulo 998244353.	Hard9	TreeDynamic programming+1	No attempts yet	2s	2048 MB	Judgeable
Expected BeautyEach A_i is uniform in [L_i, R_i]. Find the expected maximum score squared when deleting one of two adjacent equal elements adds its value to the score, mod 998244353.	Hard9	Dynamic programmingProbability+1	No attempts yet	1s	2048 MB	Judgeable
Grid Game 3-angleGiven stones on a triangular grid of up to 1e9 rows, decide whether the first player wins the game where each move removes up to K stones and adds up to K stones to cells below.	Hard9	Game theoryMath+1	No attempts yet	1s	2048 MB	Judgeable
X AuraGiven a grid of digit heights and an odd exponent X, answer queries for the minimum total penalty of moving between two cells, where each step costs (h1-h2)^X, or report INVALID if the cost can go unbounded below.	Hard9	GraphShortest path+1	No attempts yet	1s	2048 MB	Judgeable
Hardcore String CountingCount strings of length m over 26 letters where s first appears as a substring at the very end, modulo 998244353, with n up to 1e5 and m up to 1e9.	Hard9	String matchingDynamic programming+1	No attempts yet	8s	2048 MB	Judgeable
Too Many EdgesGiven a DAG G' that contains up to 200 extra edges beyond the original DAG G, find the longest path in G by querying which edges belong to G within a limited query budget.	Hard9	GraphDynamic programming+1	No attempts yet	15s	2048 MB	Judgeable
01treeGiven a tree of 0/1 node values with partial start and end states, sum the minimum flip counts over all consistent state pairs, modulo 1e9+7.	Hard9	TreeDynamic programming+1	No attempts yet	1s	2048 MB	Judgeable
Colored Slime BallsFind the maximum net profit from selling every slime ball in a row, paying w per mass increase, where same-colored neighbors merge when the ball between them is sold.	Hard9	Dynamic programmingIntervals	No attempts yet	2s	2048 MB	Judgeable
Sugar Sweet IIEach child gains w_i when event i fires with fewer sugar than child b_i, events in random order; output each child's expected final sugar mod 1e9+7.	Hard9	ProbabilityDynamic programming+1	No attempts yet	2s	2048 MB	Judgeable
Median HeapGiven a binary tree with node values and change costs, find the minimum cost to make the median-swap process output each query value m at the root.	Hard9	TreeDynamic programming+1	No attempts yet	4s	2048 MB	Judgeable
LogoGiven up to five polyomino patch shapes (each a subset of a 3x3 grid, flippable and rotatable) and up to three grid designs up to 55x5, decide if each design can be tiled exactly by non-overlapping patches and find the minimum patch count, or report NIE.	Hard10	Dynamic programmingBit manipulation+2	No attempts yet	1s	128 MB	Judgeable
HyperrectangleCompute d!V for the volume of a box with side lengths li where sum xi <= s via characteristic polynomials and Lenstra inclusion of capped orthants.	Hard10	MathDivide and conquer+2	No attempts yet	2s	512 MB	Judgeable
Salty FishPick which cameras to lock so that the apples on nodes seen only by locked cameras, minus the locking costs, is maximized.	Hard10	TreeDynamic programming	No attempts yet	3s	512 MB	Judgeable
Dense SubgraphCount vertex subsets L of a degree-at-most-5 tree whose beauty, the maximum density over connected subsets of size at least two, is at most x.	Hard10	TreeBinary search+2	No attempts yet	3s	512 MB	Judgeable
Mysterious … HostFor each n up to N, find the minimum number of permutations needed so that every permutation of order n shares its answers to all consecutive-segment queries with one of them, modulo a prime P.	Hard10	CombinatoricsMath+2	No attempts yet	2s	256 MB	Judgeable
Magic LocksFor each grid of letters, find the maximum number of vertex-disjoint simple cycles inside same-letter cells and count the ways to achieve it, capped at 10^18.	Hard10	MatrixGraph+2	No attempts yet	2s	1024 MB	Judgeable
Joint TrainingGiven N units with bus costs and dissatisfaction updates, check each lineup's validity, find the max feasible session cost, and count distinct costs per unit.	Hard10	GraphDynamic programming+1	No attempts yet	3s	1024 MB	Judgeable
Prof. Pang's sequenceFor each query [l, r], count the subarrays a_i..a_j inside it whose number of distinct values is odd.	Hard10	Divide and conquerArray+2	No attempts yet	3s	1024 MB	Judgeable
AntichamberMaintain a black-cell grid under repaints that delete split-off pieces and fill holes, answering component size and same-component queries online.	Hard10	Union-findSimulation+1	No attempts yet	5s	1024 MB	Judgeable
Contest StrategyGiven three chains of subtasks with points and solve times, find the maximum total score achievable within time T when each problem's subtasks must be solved in order.	Hard10	Dynamic programmingDivide and conquer+1	No attempts yet	2s	1024 MB	Judgeable
Edges and DivisorsGiven a weighted DAG and weights a_1 to a_(n-1), choose a chain of paths whose lengths are multiples of i+1 in round i, maximizing the weighted average score.	Hard10	GraphDynamic programming+1	No attempts yet	1s	2048 MB	Judgeable