| # | When | Who | Problem | Lang | Verdict | Time | Memory |
|---|---|---|---|---|---|---|---|
| 319924483 | May/16/2025 19:39 | lzx2005# | C - Mex in the Grid | C++17 (GCC 7-32) | Accepted | 124 ms | 4000 KB |
| 319917615 | May/16/2025 19:00 | lzx2005# | C - Mex in the Grid | C++17 (GCC 7-32) | Wrong answer on test 1 | 30 ms | 4000 KB |
| 319914907 | May/16/2025 18:39 | lzx2005# | B - The Picky Cat | C++17 (GCC 7-32) | Accepted | 77 ms | 400 KB |
| 319913456 | May/16/2025 18:27 | lzx2005# | A - Dinner Time | C++17 (GCC 7-32) | Accepted | 62 ms | 0 KB |
| 283243545 | Sep/27/2024 18:40 | lzx2005 | D - Speedbreaker | C++17 (GCC 7-32) | Accepted | 796 ms | 4800 KB |
| 283223653 | Sep/27/2024 17:52 | lzx2005 | E - Tree Pruning | C++17 (GCC 7-32) | Accepted | 468 ms | 19600 KB |
| 283213665 | Sep/27/2024 17:29 | lzx2005 | C - Cards Partition | C++17 (GCC 7-32) | Accepted | 140 ms | 1600 KB |
| 283194463 | Sep/27/2024 16:53 | lzx2005 | B - All Pairs Segments | C++17 (GCC 7-32) | Accepted | 234 ms | 2700 KB |
| 283181122 | Sep/27/2024 16:37 | lzx2005 | A - Max Plus Size | C++17 (GCC 7-32) | Accepted | 93 ms | 100 KB |
| 282411304 | Sep/22/2024 05:09 | lzx2005 | H - Sakurako's Test | C++17 (GCC 7-32) | Accepted | 139 ms | 800 KB |
| 280132904 | Sep/07/2024 04:18 | lzx2005 | A - Magic Computer | C++17 (GCC 7-32) | Accepted | 46 ms | 100 KB |
| 279928625 | Sep/05/2024 14:24 | lzx2005 | J - X Equals Y | C++17 (GCC 7-32) | Accepted | 1624 ms | 0 KB |
| 279926085 | Sep/05/2024 14:01 | lzx2005 | J - X Equals Y | C++17 (GCC 7-32) | Wrong answer on test 2 | 46 ms | 0 KB |
| 279923276 | Sep/05/2024 13:33 | to chain or not to chain: lzx2005, Unique_Hanpi# | J - X Equals Y | C++17 (GCC 7-32) | Wrong answer on test 2 | 46 ms | 100 KB |
| 279915934 | Sep/05/2024 12:23 | to chain or not to chain: lzx2005, Unique_Hanpi# | L - Classic Problem | C++20 (GCC 13-64) | Wrong answer on test 2 | 1937 ms | 38000 KB |
| 279914646 | Sep/05/2024 12:12 | to chain or not to chain: lzx2005, Unique_Hanpi# | L - Classic Problem | C++20 (GCC 13-64) | Runtime error on test 2 | 437 ms | 24500 KB |
| 279914457 | Sep/05/2024 12:10 | to chain or not to chain: lzx2005, Unique_Hanpi# | L - Classic Problem | C++20 (GCC 13-64) | Runtime error on test 2 | 406 ms | 17600 KB |
| 279913679 | Sep/05/2024 12:03 | to chain or not to chain: lzx2005, Unique_Hanpi# | L - Classic Problem | C++20 (GCC 13-64) | Runtime error on test 2 | 452 ms | 17600 KB |
| 279909550 | Sep/05/2024 11:25 | to chain or not to chain: lzx2005, Unique_Hanpi# | M - Computational Geometry | C++20 (GCC 13-64) | Accepted | 452 ms | 416800 KB |
| 279905406 | Sep/05/2024 10:47 | to chain or not to chain: lzx2005, Unique_Hanpi# | F - Traveling in Cells | C++17 (GCC 7-32) | Accepted | 2515 ms | 161700 KB |
| 279895309 | Sep/05/2024 10:02 | to chain or not to chain: lzx2005, Unique_Hanpi# | E - New but Nostalgic Problem | C++20 (GCC 13-64) | Accepted | 249 ms | 111600 KB |
| 279895105 | Sep/05/2024 10:00 | to chain or not to chain: lzx2005, Unique_Hanpi# | E - New but Nostalgic Problem | C++20 (GCC 13-64) | Time limit exceeded on test 2 | 2000 ms | 111600 KB |
| 279894801 | Sep/05/2024 09:57 | to chain or not to chain: lzx2005, Unique_Hanpi# | D - New Houses | C++17 (GCC 7-32) | Accepted | 468 ms | 15700 KB |
| 279894484 | Sep/05/2024 09:54 | to chain or not to chain: lzx2005, Unique_Hanpi# | D - New Houses | C++17 (GCC 7-32) | Wrong answer on test 2 | 437 ms | 15700 KB |
| 279894445 | Sep/05/2024 09:54 | to chain or not to chain: lzx2005, Unique_Hanpi# | D - New Houses | C++17 (GCC 7-32) | Compilation error | 0 ms | 0 KB |
| 279893990 | Sep/05/2024 09:49 | to chain or not to chain: lzx2005, Unique_Hanpi# | D - New Houses | C++17 (GCC 7-32) | Wrong answer on test 2 | 452 ms | 7900 KB |
| 279892774 | Sep/05/2024 09:36 | to chain or not to chain: lzx2005, Unique_Hanpi# | D - New Houses | C++17 (GCC 7-32) | Wrong answer on test 2 | 452 ms | 7900 KB |
| 279892502 | Sep/05/2024 09:33 | to chain or not to chain: lzx2005, Unique_Hanpi# | D - New Houses | C++17 (GCC 7-32) | Wrong answer on test 2 | 468 ms | 7900 KB |
| 279892146 | Sep/05/2024 09:30 | to chain or not to chain: lzx2005, Unique_Hanpi# | B - Base Station Construction | C++20 (GCC 13-64) | Accepted | 1000 ms | 23400 KB |
| 279891709 | Sep/05/2024 09:25 | to chain or not to chain: lzx2005, Unique_Hanpi# | D - New Houses | C++17 (GCC 7-32) | Wrong answer on test 2 | 452 ms | 4000 KB |
| 279891510 | Sep/05/2024 09:23 | to chain or not to chain: lzx2005, Unique_Hanpi# | K - Peg Solitaire | C++20 (GCC 13-64) | Accepted | 46 ms | 0 KB |
| 279891242 | Sep/05/2024 09:20 | to chain or not to chain: lzx2005, Unique_Hanpi# | K - Peg Solitaire | C++20 (GCC 13-64) | Wrong answer on test 2 | 31 ms | 0 KB |
| 279891146 | Sep/05/2024 09:19 | to chain or not to chain: lzx2005, Unique_Hanpi# | K - Peg Solitaire | C++20 (GCC 13-64) | Runtime error on test 2 | 46 ms | 0 KB |
| 279890566 | Sep/05/2024 09:12 | to chain or not to chain: lzx2005, Unique_Hanpi# | D - New Houses | C++17 (GCC 7-32) | Wrong answer on test 2 | 484 ms | 3900 KB |
| 279889748 | Sep/05/2024 09:02 | to chain or not to chain: lzx2005, Unique_Hanpi# | I - Path Planning | C++20 (GCC 13-64) | Accepted | 1593 ms | 54600 KB |
| 279889414 | Sep/05/2024 08:58 | to chain or not to chain: lzx2005, Unique_Hanpi# | I - Path Planning | C++20 (GCC 13-64) | Wrong answer on test 2 | 202 ms | 23500 KB |
| 279888849 | Sep/05/2024 08:52 | to chain or not to chain: lzx2005, Unique_Hanpi# | C - Trading | C++17 (GCC 7-32) | Accepted | 328 ms | 800 KB |
| 279888064 | Sep/05/2024 08:41 | to chain or not to chain: lzx2005, Unique_Hanpi# | A - Programming Contest | C++17 (GCC 7-32) | Accepted | 46 ms | 100 KB |
| 279344507 | Sep/02/2024 17:48 | lzx2005 | E2 - Eliminating Balls With Merging (Hard Version) | C++17 (GCC 7-32) | Accepted | 171 ms | 6300 KB |
| 279339212 | Sep/02/2024 17:04 | lzx2005 | E1 - Eliminating Balls With Merging (Easy Version) | C++17 (GCC 7-32) | Accepted | 187 ms | 22200 KB |
| 279335145 | Sep/02/2024 16:29 | lzx2005 | D - Determine Winning Islands in Race | C++17 (GCC 7-32) | Accepted | 218 ms | 12600 KB |
| 279334959 | Sep/02/2024 16:27 | lzx2005 | D - Determine Winning Islands in Race | C++17 (GCC 7-32) | Wrong answer on test 7 | 265 ms | 6300 KB |
| 279328115 | Sep/02/2024 15:31 | lzx2005 | C - Perform Operations to Maximize Score | C++17 (GCC 7-32) | Accepted | 203 ms | 5500 KB |
| 279327589 | Sep/02/2024 15:27 | lzx2005 | C - Perform Operations to Maximize Score | C++17 (GCC 7-32) | Wrong answer on test 2 | 46 ms | 5500 KB |
| 279327118 | Sep/02/2024 15:23 | lzx2005 | C - Perform Operations to Maximize Score | C++17 (GCC 7-32) | Wrong answer on test 2 | 61 ms | 5500 KB |
| 279327006 | Sep/02/2024 15:22 | lzx2005 | C - Perform Operations to Maximize Score | C++17 (GCC 7-32) | Wrong answer on test 2 | 62 ms | 5500 KB |
| 279322288 | Sep/02/2024 14:37 | lzx2005 | B - Minimize Equal Sum Subarrays | C++17 (GCC 7-32) | Accepted | 124 ms | 800 KB |
| 279321922 | Sep/02/2024 14:34 | lzx2005 | A - Find K Distinct Points with Fixed Center | C++17 (GCC 7-32) | Accepted | 62 ms | 0 KB |
| 279006754 | Sep/01/2024 07:34 | lzx2005 | D - The Omnipotent Monster Killer | C++17 (GCC 7-32) | Wrong answer on test 3 | 437 ms | 16500 KB |
| 279006460 | Sep/01/2024 07:29 | lzx2005 | D - The Omnipotent Monster Killer | C++17 (GCC 7-32) | Wrong answer on test 3 | 452 ms | 16500 KB |

| Name |
|---|


