問題
問題名 | 実行時間制限 | メモリ制限 | |
---|---|---|---|
A | LIS Keeping Swaps | 2 sec | 1024 MiB |
B | Movies | 4 sec | 1024 MiB |
C | Get Closer | 2 sec | 1024 MiB |
D | BFS-ordered Tree | 6 sec | 1024 MiB |
E | Functional Graph | 8 sec | 1024 MiB |
問題名 | 実行時間制限 | メモリ制限 | |
---|---|---|---|
A | LIS Keeping Swaps | 2 sec | 1024 MiB |
B | Movies | 4 sec | 1024 MiB |
C | Get Closer | 2 sec | 1024 MiB |
D | BFS-ordered Tree | 6 sec | 1024 MiB |
E | Functional Graph | 8 sec | 1024 MiB |