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 results901 problems
| Title | Level | Topics | Solved | Time limit | Memory limit | Judge |
|---|---|---|---|---|---|---|
| JumpGiven cities at integer grid points and portals that jump from one city to any city inside an axis-aligned rectangle at a given cost, find the shortest time from city 1 to every city. | Hard9 | Shortest pathGraph+2 | No attempts yet | 1s | 512 MB | Judgeable |