Pinely Round 2 (Div. 1 + Div. 2)

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
1863 Pinely Round 2 (Div. 1 + Div. 2) FINISHED False 10800 43773863 Aug. 30, 2023, 2:35 p.m.

Problems

Solved$
Index
Name
Type
Tags
Community Tag
Rating
( 92 ) H Goldberg Machine 3 PROGRAMMING dp trees

B''...

Tutorials

Submissions

Submission Id
Author(s)
Index
Submitted
Verdict
Language
Test Set
Tests Passed
Time taken (ms)
Memory Consumed (bytes)
Tags
Rating
221221722 PolymathFaisal H Aug. 31, 2023, 5:12 a.m. OK GNU C++17 TESTS 33 1107 409600000
221188380 QAQAutoMaton H Aug. 30, 2023, 7:02 p.m. OK GNU C++17 (64) TESTS 33 998 699699200
221187887 amiya H Aug. 30, 2023, 6:56 p.m. OK GNU C++17 (64) TESTS 33 1824 101888000
221214363 jiangly H Aug. 31, 2023, 3:09 a.m. OK GNU C++20 (64) TESTS 33 2947 58572800
221218426 BuddhaBarFans H Aug. 31, 2023, 4:16 a.m. OK GNU C++20 (64) TESTS 33 6193 712499200
221182970 jiangly H Aug. 30, 2023, 6:15 p.m. OK GNU C++20 (64) TESTS 33 6676 712499200

remove filters

Back to search problems