Tasks
Task Name | Time Limit | Memory Limit | |
---|---|---|---|
A | Exponential Plant | 2 sec | 1024 MiB |
B | Anyway Takahashi | 2 sec | 1024 MiB |
C | Slimes | 2 sec | 1024 MiB |
D | Minimize Ordering | 2 sec | 1024 MiB |
E | Ladder Takahashi | 2 sec | 1024 MiB |
F | Matrix Reducing | 2 sec | 1024 MiB |
G | Election Quick Report | 2 sec | 1024 MiB |
H | LEQ | 2 sec | 1024 MiB |
I | Well-defined Path Queries on a Namori | 3 sec | 1024 MiB |