Solutions are presented as using the least memory and the fastest execution time. It also takes the top 10 most recent solutions from each language. If you want to limit to a specific index, click the "Solved" button and go to that problem.
ContestId |
Name |
Phase |
Frozen |
Duration (Seconds) |
Relative Time |
Start Time |
|---|---|---|---|---|---|---|
| 2062 | Ethflow Round 1 (Codeforces Round 1001, Div. 1 + Div. 2) | FINISHED | False | 9000 | 2301890 | Jan. 26, 2025, 2:35 p.m. |
Solved$ |
Index |
Name |
Type |
Tags |
Community Tag |
Rating |
|---|---|---|---|---|---|---|
| ( 2678 ) | D | Balanced Tree | PROGRAMMING | dfs and similar dp greedy trees |
B''... |
Submission Id |
Author(s) |
Index |
Submitted |
Verdict |
Language |
Test Set |
Tests Passed |
Time taken (ms) |
Memory Consumed (bytes) |
Tags |
Rating |
|---|---|---|---|---|---|---|---|---|---|---|---|
| 303144021 | _Equinox | D | Jan. 26, 2025, 6:57 p.m. | OK | C# 10 | TESTS | 30 | 1109 | 51712000 |
Back to search problems