Tasks
| Task Name | Time Limit | Memory Limit | |
|---|---|---|---|
| A | Don't Detect Cycle | 2 sec | 1024 MiB |
| B | Self Checkout | 2 sec | 1024 MiB |
| C | Segment Tree | 6 sec | 1024 MiB |
| D | A xor B plus C | 8 sec | 1024 MiB |
| E | ReTravel | 2 sec | 1024 MiB |
| F | Origami Warp | 3 sec | 1024 MiB |
| G | Diverge and Converge | 2 sec | 1024 MiB |
| H | Two Convex Sets | 4 sec | 2048 MiB |
| I | Near Pair | 2 sec | 1024 MiB |
| J | Grid Construction | 2 sec | 1024 MiB |
| K | Sum is One | 2 sec | 1024 MiB |
| L | Long Sequence Inversion 2 | 2 sec | 1024 MiB |
| M | Cartesian Trees | 3 sec | 1024 MiB |