| # | When | Who | Problem | Lang | Verdict | Time | Memory |
|---|---|---|---|---|---|---|---|
| 389823115 | Sep/08/2026 05:39 |
|
E - Encoded Shortest Paths | Unknown | Runtime error | 0 ms | 0 KB |
| 389823114 | Sep/08/2026 05:39 |
|
F - First and Second Minimum | Unknown | Accepted | 0 ms | 0 KB |
| 389823113 | Sep/08/2026 05:39 |
|
F - First and Second Minimum | Unknown | Accepted | 0 ms | 0 KB |
| 389823112 | Sep/08/2026 05:39 |
|
F - First and Second Minimum | Unknown | Runtime error | 0 ms | 0 KB |
| 389823111 | Sep/08/2026 05:39 |
|
F - First and Second Minimum | Unknown | Wrong answer | 0 ms | 0 KB |
| 389823110 | Sep/08/2026 05:39 |
|
J - Jumbled Block Hierarchy | Unknown | Wrong answer | 0 ms | 0 KB |
| 389823109 | Sep/08/2026 05:39 |
|
E - Encoded Shortest Paths | Unknown | Wrong answer | 0 ms | 0 KB |
| 389823108 | Sep/08/2026 05:39 |
|
C - Constructing Box Projections | Unknown | Wrong answer | 0 ms | 0 KB |
| 389823107 | Sep/08/2026 05:39 |
|
E - Encoded Shortest Paths | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 389823106 | Sep/08/2026 05:39 |
|
H - Human-Readable Number | Unknown | Wrong answer | 0 ms | 0 KB |
| 389823105 | Sep/08/2026 05:39 |
|
E - Encoded Shortest Paths | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 389823104 | Sep/08/2026 05:39 |
|
G - Game of Passing Cards | Unknown | Wrong answer | 0 ms | 0 KB |
| 389823103 | Sep/08/2026 05:39 |
|
B - Box Projections | Unknown | Wrong answer | 0 ms | 0 KB |
| 389823102 | Sep/08/2026 05:39 |
|
C - Constructing Box Projections | Unknown | Wrong answer | 0 ms | 0 KB |
| 389823101 | Sep/08/2026 05:39 |
|
F - First and Second Minimum | Unknown | Runtime error | 0 ms | 0 KB |
| 389823100 | Sep/08/2026 05:39 |
|
E - Encoded Shortest Paths | Unknown | Rejected | 0 ms | 0 KB |
| 389823099 | Sep/08/2026 05:39 |
|
F - First and Second Minimum | Unknown | Runtime error | 0 ms | 0 KB |
| 389823098 | Sep/08/2026 05:39 |
|
A - Assigning Distinct Integers | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 389823097 | Sep/08/2026 05:39 |
|
I - Interprocess Sum and Scatter | Unknown | Runtime error | 0 ms | 0 KB |
| 389823096 | Sep/08/2026 05:39 |
|
K - Keep the Fairness | Unknown | Accepted | 0 ms | 0 KB |
| 389823095 | Sep/08/2026 05:39 |
|
A - Assigning Distinct Integers | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 389823094 | Sep/08/2026 05:39 |
|
A - Assigning Distinct Integers | Unknown | Wrong answer | 0 ms | 0 KB |
| 389823093 | Sep/08/2026 05:39 |
|
C - Constructing Box Projections | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 389823092 | Sep/08/2026 05:39 |
|
F - First and Second Minimum | Unknown | Wrong answer | 0 ms | 0 KB |
| 389823091 | Sep/08/2026 05:39 |
|
D - Dynamic Connectivity Across Graphs | Unknown | Wrong answer | 0 ms | 0 KB |
| 389823090 | Sep/08/2026 05:39 |
|
A - Assigning Distinct Integers | Unknown | Compilation error | 0 ms | 0 KB |
| 389823089 | Sep/08/2026 05:39 |
|
A - Assigning Distinct Integers | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 389823088 | Sep/08/2026 05:39 |
|
E - Encoded Shortest Paths | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 389823087 | Sep/08/2026 05:39 |
|
K - Keep the Fairness | Unknown | Runtime error | 0 ms | 0 KB |
| 389823086 | Sep/08/2026 05:39 |
|
K - Keep the Fairness | Unknown | Rejected | 0 ms | 0 KB |
| 389823085 | Sep/08/2026 05:39 |
|
F - First and Second Minimum | Unknown | Wrong answer | 0 ms | 0 KB |
| 389823084 | Sep/08/2026 05:39 |
|
F - First and Second Minimum | Unknown | Compilation error | 0 ms | 0 KB |
| 389823083 | Sep/08/2026 05:39 |
|
A - Assigning Distinct Integers | Unknown | Wrong answer | 0 ms | 0 KB |
| 389823082 | Sep/08/2026 05:39 |
|
C - Constructing Box Projections | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 389823081 | Sep/08/2026 05:39 |
|
A - Assigning Distinct Integers | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 389823080 | Sep/08/2026 05:39 |
|
F - First and Second Minimum | Unknown | Wrong answer | 0 ms | 0 KB |
| 389823079 | Sep/08/2026 05:39 |
|
F - First and Second Minimum | Unknown | Runtime error | 0 ms | 0 KB |
| 389823078 | Sep/08/2026 05:39 |
|
F - First and Second Minimum | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 389823077 | Sep/08/2026 05:39 |
|
L - Let's Go Yum Cha | Unknown | Wrong answer | 0 ms | 0 KB |
| 389823076 | Sep/08/2026 05:39 |
|
K - Keep the Fairness | Unknown | Runtime error | 0 ms | 0 KB |
| 389823075 | Sep/08/2026 05:39 |
|
E - Encoded Shortest Paths | Unknown | Accepted | 0 ms | 0 KB |
| 389823074 | Sep/08/2026 05:39 |
|
A - Assigning Distinct Integers | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 389823073 | Sep/08/2026 05:39 |
|
F - First and Second Minimum | Unknown | Wrong answer | 0 ms | 0 KB |
| 389823072 | Sep/08/2026 05:39 |
|
C - Constructing Box Projections | Unknown | Wrong answer | 0 ms | 0 KB |
| 389823071 | Sep/08/2026 05:39 |
|
L - Let's Go Yum Cha | Unknown | Accepted | 0 ms | 0 KB |
| 389823070 | Sep/08/2026 05:39 |
|
F - First and Second Minimum | Unknown | Wrong answer | 0 ms | 0 KB |
| 389823069 | Sep/08/2026 05:39 |
|
E - Encoded Shortest Paths | Unknown | Rejected | 0 ms | 0 KB |
| 389823068 | Sep/08/2026 05:39 |
|
D - Dynamic Connectivity Across Graphs | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 389823067 | Sep/08/2026 05:39 |
|
F - First and Second Minimum | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 389823066 | Sep/08/2026 05:39 |
|
C - Constructing Box Projections | Unknown | Time limit exceeded | 0 ms | 0 KB |

| Name |
|---|


