Problems
Pick a problem and write your solution in the built-in editor. The judge runs it against real test cases while you watch, and the wider archive is open to read whenever you like.
Total results505 problems
| Title | Level | Topics | Solved | Time limit | Memory limit | Judge |
|---|---|---|---|---|---|---|
| Construction ProjectPlace at most H airports among N towns and connect all towns with axis-parallel roads that avoid M rectangular obstacles, minimizing airport cost times count plus total road length. | Hard9 | Minimum spanning treeGeometry+2 | No attempts yet | 5s | 256 MB | Judgeable |
| Dance CircleCount, modulo 1e9+7, the binary assignments to n children around a circle matching n parity constraints, each covering a contiguous arc centered at some child. | Hard9 | MathPrefix sum+2 | No attempts yet | 2s | 512 MB | Judgeable |
| Easy WinAfter each edge insertion, find the maximum total weight of a subset of edges such that no non-empty edge-disjoint union of cycles in it has Nim value (xor of stone counts) equal to zero. | Hard9 | Game theoryUnion-find+2 | No attempts yet | 1.5s | 512 MB | Judgeable |
| Connected Spanning SubgraphGiven a connected undirected graph, count the non-empty edge subsets whose chosen edges form a connected spanning subgraph, and print the count modulo 2. | Hard9 | GraphCombinatorics+2 | No attempts yet | 1s | 512 MB | Judgeable |
| Tree and Queries 20Maintain a dynamic forest with link/cut and weighted edges, supporting toggling a vertex weight and querying the minimum weighted sum of tree distances from any vertex, with encrypted vertex indices. | Hard10 | TreeSegment tree+1 | No attempts yet | 5s | 512 MB | Judgeable |