| # | When | Who | Problem | Lang | Verdict | Time | Memory |
|---|---|---|---|---|---|---|---|
| 389823065 | Sep/08/2026 05:39 |
|
D - Dynamic Connectivity Across Graphs | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 389823064 | Sep/08/2026 05:39 |
|
F - First and Second Minimum | Unknown | Runtime error | 0 ms | 0 KB |
| 389823063 | Sep/08/2026 05:39 |
|
F - First and Second Minimum | Unknown | Wrong answer | 0 ms | 0 KB |
| 389823062 | Sep/08/2026 05:39 |
|
D - Dynamic Connectivity Across Graphs | Unknown | Wrong answer | 0 ms | 0 KB |
| 389823061 | Sep/08/2026 05:39 |
|
E - Encoded Shortest Paths | Unknown | Runtime error | 0 ms | 0 KB |
| 389823060 | Sep/08/2026 05:39 |
|
F - First and Second Minimum | Unknown | Accepted | 0 ms | 0 KB |
| 389823059 | Sep/08/2026 05:39 |
|
K - Keep the Fairness | Unknown | Rejected | 0 ms | 0 KB |
| 389823058 | Sep/08/2026 05:39 |
|
H - Human-Readable Number | Unknown | Wrong answer | 0 ms | 0 KB |
| 389823057 | Sep/08/2026 05:39 |
|
C - Constructing Box Projections | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 389823056 | Sep/08/2026 05:39 |
|
C - Constructing Box Projections | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 389823055 | Sep/08/2026 05:39 |
|
K - Keep the Fairness | Unknown | Wrong answer | 0 ms | 0 KB |
| 389823054 | Sep/08/2026 05:39 |
|
A - Assigning Distinct Integers | Unknown | Compilation error | 0 ms | 0 KB |
| 389823053 | Sep/08/2026 05:39 |
|
K - Keep the Fairness | Unknown | Runtime error | 0 ms | 0 KB |
| 389823052 | Sep/08/2026 05:39 |
|
L - Let's Go Yum Cha | Unknown | Wrong answer | 0 ms | 0 KB |
| 389823051 | Sep/08/2026 05:39 |
|
E - Encoded Shortest Paths | Unknown | Runtime error | 0 ms | 0 KB |
| 389823050 | Sep/08/2026 05:39 |
|
C - Constructing Box Projections | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 389823049 | Sep/08/2026 05:39 |
|
A - Assigning Distinct Integers | Unknown | Compilation error | 0 ms | 0 KB |
| 389823048 | Sep/08/2026 05:39 |
|
K - Keep the Fairness | Unknown | Rejected | 0 ms | 0 KB |
| 389823047 | Sep/08/2026 05:39 |
|
D - Dynamic Connectivity Across Graphs | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 389823046 | Sep/08/2026 05:39 |
|
K - Keep the Fairness | Unknown | Runtime error | 0 ms | 0 KB |
| 389823045 | Sep/08/2026 05:39 |
|
C - Constructing Box Projections | Unknown | Wrong answer | 0 ms | 0 KB |
| 389823044 | Sep/08/2026 05:39 |
|
E - Encoded Shortest Paths | Unknown | Runtime error | 0 ms | 0 KB |
| 389823043 | Sep/08/2026 05:39 |
|
E - Encoded Shortest Paths | Unknown | Wrong answer | 0 ms | 0 KB |
| 389823042 | Sep/08/2026 05:39 |
|
A - Assigning Distinct Integers | Unknown | Wrong answer | 0 ms | 0 KB |
| 389823041 | Sep/08/2026 05:39 |
|
D - Dynamic Connectivity Across Graphs | Unknown | Wrong answer | 0 ms | 0 KB |
| 389823040 | Sep/08/2026 05:39 |
|
C - Constructing Box Projections | Unknown | Wrong answer | 0 ms | 0 KB |
| 389823039 | Sep/08/2026 05:39 |
|
D - Dynamic Connectivity Across Graphs | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 389823038 | Sep/08/2026 05:39 |
|
C - Constructing Box Projections | Unknown | Wrong answer | 0 ms | 0 KB |
| 389823037 | Sep/08/2026 05:39 |
|
E - Encoded Shortest Paths | Unknown | Rejected | 0 ms | 0 KB |
| 389823036 | Sep/08/2026 05:39 |
|
E - Encoded Shortest Paths | Unknown | Accepted | 0 ms | 0 KB |
| 389823035 | Sep/08/2026 05:39 |
|
H - Human-Readable Number | Unknown | Compilation error | 0 ms | 0 KB |
| 389823034 | Sep/08/2026 05:39 |
|
F - First and Second Minimum | Unknown | Runtime error | 0 ms | 0 KB |
| 389823033 | Sep/08/2026 05:39 |
|
K - Keep the Fairness | Unknown | Runtime error | 0 ms | 0 KB |
| 389823032 | Sep/08/2026 05:39 |
|
J - Jumbled Block Hierarchy | Unknown | Wrong answer | 0 ms | 0 KB |
| 389823031 | Sep/08/2026 05:39 |
|
K - Keep the Fairness | Unknown | Runtime error | 0 ms | 0 KB |
| 389823030 | Sep/08/2026 05:39 |
|
A - Assigning Distinct Integers | Unknown | Wrong answer | 0 ms | 0 KB |
| 389823029 | Sep/08/2026 05:39 |
|
E - Encoded Shortest Paths | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 389823028 | Sep/08/2026 05:39 |
|
D - Dynamic Connectivity Across Graphs | Unknown | Wrong answer | 0 ms | 0 KB |
| 389823027 | Sep/08/2026 05:39 |
|
F - First and Second Minimum | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 389823026 | Sep/08/2026 05:39 |
|
A - Assigning Distinct Integers | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 389823025 | Sep/08/2026 05:39 |
|
K - Keep the Fairness | Unknown | Accepted | 0 ms | 0 KB |
| 389823024 | Sep/08/2026 05:39 |
|
F - First and Second Minimum | Unknown | Runtime error | 0 ms | 0 KB |
| 389823023 | Sep/08/2026 05:39 |
|
J - Jumbled Block Hierarchy | Unknown | Compilation error | 0 ms | 0 KB |
| 389823022 | Sep/08/2026 05:39 |
|
E - Encoded Shortest Paths | Unknown | Runtime error | 0 ms | 0 KB |
| 389823021 | Sep/08/2026 05:39 |
|
E - Encoded Shortest Paths | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 389823020 | Sep/08/2026 05:39 |
|
F - First and Second Minimum | Unknown | Runtime error | 0 ms | 0 KB |
| 389823019 | Sep/08/2026 05:39 |
|
E - Encoded Shortest Paths | Unknown | Wrong answer | 0 ms | 0 KB |
| 389823018 | Sep/08/2026 05:39 |
|
A - Assigning Distinct Integers | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 389823017 | Sep/08/2026 05:39 |
|
A - Assigning Distinct Integers | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 389823016 | Sep/08/2026 05:39 |
|
F - First and Second Minimum | Unknown | Wrong answer | 0 ms | 0 KB |

| Name |
|---|


