| # | When | Who | Problem | Lang | Verdict | Time | Memory |
|---|---|---|---|---|---|---|---|
| 368526387 | Mar/28/2026 17:56 | advaybagaria | E - Minimum Path Cover | C++17 (GCC 7-32) | Skipped | 0 ms | 0 KB |
| 368525776 | Mar/28/2026 17:56 | advaybagaria | D - AND-array | C++17 (GCC 7-32) | Skipped | 0 ms | 0 KB |
| 368525253 | Mar/28/2026 17:55 | advaybagaria | C2 - Equal Multisets (Hard Version) | C++17 (GCC 7-32) | Skipped | 0 ms | 0 KB |
| 368523649 | Mar/28/2026 17:54 | advaybagaria | C1 - Equal Multisets (Easy Version) | C++17 (GCC 7-32) | Skipped | 0 ms | 0 KB |
| 368522580 | Mar/28/2026 17:52 | advaybagaria | B - Mickey Mouse Constructive | C++17 (GCC 7-32) | Skipped | 0 ms | 0 KB |
| 368519347 | Mar/28/2026 17:49 | advaybagaria | A - Antimedian Deletion | C++17 (GCC 7-32) | Skipped | 0 ms | 0 KB |
| 368506680 | Mar/28/2026 16:53 | advaybagaria | H - Devils of Pestilence | C++17 (GCC 7-32) | Accepted | 234 ms | 2500 KB |
| 368343437 | Mar/27/2026 09:27 | advaybagaria | F - Broken Line Operation | Python 3 | Partial result: 0 points | 437 ms | 32700 KB |
| 368286918 | Mar/26/2026 19:23 | advaybagaria | O - Optimal GCD Split | Python 3 | Accepted | 250 ms | 36700 KB |