XVIII Open Olympiad in Informatics - Final Stage, Day 2 (Unrated, Online Mirror, IOI rules)

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
1940 XVIII Open Olympiad in Informatics - Final Stage, Day 2 (Unrated, Online Mirror, IOI rules) FINISHED False 18000 27204863 March 9, 2024, 9:05 a.m.

Problems

Solved$
Index
Name
Type
Tags
Community Tag
Rating
( 35 ) C Burenka and Pether PROGRAMMING *special data structures dfs and similar divide and conquer ds graphs sortings trees

B''...

Tutorials

Submissions

Submission Id
Author(s)
Index
Submitted
Verdict
Language
Test Set
Tests Passed
Time taken (ms)
Memory Consumed (bytes)
Tags
Rating
250426614 rainboy C March 9, 2024, 8:07 p.m. OK C++17 (GCC 9-64) TESTS 245 2761 163737600
250444197 chappy1 C March 10, 2024, 12:51 a.m. OK C++20 (GCC 11-64) TESTS 245 1777 31744000
250359058 jiangly C March 9, 2024, 1:44 p.m. OK C++20 (GCC 11-64) TESTS 245 1777 31744000
250347982 Adam_GS C March 9, 2024, 12:19 p.m. OK C++20 (GCC 11-64) TESTS 245 2636 18022400
250347997 Adam_GS C March 9, 2024, 12:20 p.m. OK C++20 (GCC 11-64) TESTS 245 2948 18022400
250444151 chappy1 C March 10, 2024, 12:50 a.m. OK C++20 (GCC 13-64) TESTS 245 1965 31846400
250358116 arvindf232 C March 9, 2024, 1:37 p.m. OK Kotlin 1.9 TESTS 245 2245 74342400

remove filters

Back to search problems