Helvetic Coding Contest 2024 online mirror (teams allowed, unrated)

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
1970 Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) FINISHED False 16200 22373663 May 4, 2024, 7:05 a.m.

Problems

Solved$
Index
Name
Type
Tags
Community Tag
Rating
( 516 ) B3 Exact Neighbours (Hard) PROGRAMMING constructive algorithms 2300

B"After some recent attacks on Hogwarts Castle by the Death Eaters, the Order of the Phoenix has decided to station n members in Hogsmead Village. The houses will be situated on a picturesque n x n square field. Each wizard will have their own house, and every house will belong to some wizard. Each house will take up the space of one square. However, as you might know wizards are very superstitious. During the weekends, each wizard i will want to visit the house that is exactly a_{i} (0 <= q a_{i} <= q n) away from their own house. The roads in the village are built horizontally and vertically, so the distance between points (x_{i}, y_{i}) and (x_{j}, y_{j}) on the n x n field is |x_{i} - x_{j}| + |y_{i} - y_{j}| . The wizards know and trust each other, so one wizard can visit another wizard's house when the second wizard is away. The houses to be built will be big enough for all n wizards to simultaneously visit any house. Apart from that, each wizard is mandated to have a view of the Hogwarts Castle in the north and the Forbidden Forest in the south, so the house of no other wizard should block the view. In terms of the village, it means that in each column of the n x n field, there can be at most one house, i.e. if the i -th house has coordinates (x_{i}, y_{i}) , then x_{i} neq x_{j} for all i neq j . The Order of the Phoenix doesn't yet know if it is possible to place n houses in such a way that will satisfy the visit and view requirements of all n wizards, so they are asking for your help in designing such a plan. If it is possible to have a correct placement, where for the i -th wizard there is a house that is a_{i} away from it and the house of the i -th wizard is the only house in their column, output YES, the position of houses for each wizard, and to the house of which wizard should each wizard go during the weekends. If "...

Tutorials

Helvetic Coding Contest 2024 Editorial

Submissions

Submission Id
Author(s)
Index
Submitted
Verdict
Language
Test Set
Tests Passed
Time taken (ms)
Memory Consumed (bytes)
Tags
Rating
259507110 rizynvu B3 May 4, 2024, 12:23 p.m. OK C++14 (GCC 6-32) TESTS 30 187 4096000 2300
262102219 include_c B3 May 22, 2024, 7 a.m. OK C++14 (GCC 6-32) TESTS 30 202 3993600 2300
262074781 2023_hr B3 May 22, 2024, 1:54 a.m. OK C++14 (GCC 6-32) TESTS 30 202 3993600 2300
262102289 include_c B3 May 22, 2024, 7 a.m. OK C++14 (GCC 6-32) TESTS 30 203 3993600 2300
259512629 Flamire B3 May 4, 2024, 1:15 p.m. OK C++14 (GCC 6-32) TESTS 30 218 4096000 2300
261202322 sell_gram_wind B3 May 16, 2024, 1:23 p.m. OK C++14 (GCC 6-32) TESTS 30 218 6451200 2300
260711844 duyiblue B3 May 12, 2024, 8:24 p.m. OK C++14 (GCC 6-32) TESTS 30 546 6451200 2300
261290269 Eduard_X B3 May 17, 2024, 7:02 a.m. OK C++14 (GCC 6-32) TESTS 30 624 3993600 2300
259788896 janY_ B3 May 6, 2024, 6:02 p.m. OK C++17 (GCC 7-32) TESTS 30 171 2764800 2300
261957574 Ste B3 May 21, 2024, 3:40 a.m. OK C++17 (GCC 7-32) TESTS 30 171 3481600 2300
259501235 zjy2008 B3 May 4, 2024, 11:34 a.m. OK C++17 (GCC 7-32) TESTS 30 171 3993600 2300
262334524 Magikarp4000 B3 May 24, 2024, 4:53 a.m. OK C++17 (GCC 7-32) TESTS 30 171 4096000 2300
262277279 zhou_yidie B3 May 23, 2024, 3:03 p.m. OK C++17 (GCC 7-32) TESTS 30 171 4812800 2300
260933553 Gaomer B3 May 14, 2024, 1:30 p.m. OK C++17 (GCC 7-32) TESTS 30 171 5632000 2300
259616142 chappy1 B3 May 5, 2024, 10:07 a.m. OK C++17 (GCC 7-32) TESTS 30 186 614400 2300
259665360 Prostoegor239 B3 May 5, 2024, 5:36 p.m. OK C++17 (GCC 7-32) TESTS 30 186 2764800 2300
261532912 mnbvcxz123_long_dick B3 May 18, 2024, 12:58 p.m. OK C++17 (GCC 7-32) TESTS 30 186 5632000 2300
259511207 Kerim.K B3 May 4, 2024, 1:02 p.m. OK C++17 (GCC 7-32) TESTS 30 187 4812800 2300
263155755 xiojoy B3 May 29, 2024, 2:26 p.m. OK C++20 (GCC 13-64) TESTS 30 109 1126400 2300
259566854 enslaved B3 May 4, 2024, 10:54 p.m. OK C++20 (GCC 13-64) TESTS 30 109 4403200 2300
259627687 maspy B3 May 5, 2024, 11:51 a.m. OK C++20 (GCC 13-64) TESTS 30 109 13414400 2300
259700544 TMM233 B3 May 6, 2024, 3:31 a.m. OK C++20 (GCC 13-64) TESTS 30 124 307200 2300
260717590 36champ B3 May 12, 2024, 10:10 p.m. OK C++20 (GCC 13-64) TESTS 30 124 1945600 2300
259571141 YaKei B3 May 5, 2024, 12:45 a.m. OK C++20 (GCC 13-64) TESTS 30 124 4915200 2300
262397268 rxlfd314 B3 May 24, 2024, 2:09 p.m. OK C++20 (GCC 13-64) TESTS 30 139 307200 2300
262870470 rtckyw_ B3 May 27, 2024, 11:20 a.m. OK C++20 (GCC 13-64) TESTS 30 139 7577600 2300
261297187 xiaolanshu B3 May 17, 2024, 8:08 a.m. OK C++20 (GCC 13-64) TESTS 30 140 307200 2300
260854328 EthanKim8683 B3 May 13, 2024, 8:28 p.m. OK C++20 (GCC 13-64) TESTS 30 140 307200 2300
259698730 dzhi B3 May 6, 2024, 2:51 a.m. OK Java 21 TESTS 30 546 22323200 2300
259996023 timiss B3 May 8, 2024, 12:14 p.m. OK Java 21 TESTS 30 608 22835200 2300
259988107 timissprathyusha B3 May 8, 2024, 11:12 a.m. OK Java 8 TESTS 30 1249 138854400 2300
259506353 formidablechief27 B3 May 4, 2024, 12:16 p.m. OK Java 8 TESTS 30 1265 138854400 2300
260715304 strashila B3 May 12, 2024, 9:24 p.m. OK PyPy 3-64 TESTS 30 608 37888000 2300
260540134 aha66 B3 May 11, 2024, 1:07 p.m. OK PyPy 3-64 TESTS 30 1015 48128000 2300
262862605 2210080018 B3 May 27, 2024, 10:14 a.m. OK Python 3 TESTS 30 1140 53248000 2300
260683514 mikkk B3 May 12, 2024, 3:17 p.m. OK Rust 2021 TESTS 30 140 18534400 2300

remove filters

Back to search problems