European Championship 2025 - Online Mirror (Unrated, ICPC Rules, Teams Preferred)

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
2068 European Championship 2025 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) FINISHED False 18000 35580284 March 2, 2025, 10:35 a.m.

Problems

Solved
Index
Name
Type
Tags
Community Tag
Rating
( 142 ) B Urban Planning PROGRAMMING constructive algorithms

You are responsible for planning a new city! The city will be represented by a rectangular grid, where each cell is either a park or a built-up area. The residents will naturally want to go for walks in the city parks. In particular, a rectangular walk is a rectangle consisting of the grid cells, which is at least 2 cells long both horizontally and vertically, such that all cells on the boundary of the rectangle are parks. Note that the cells inside the rectangle can be arbitrary. Your favourite number is (k). To leave a long-lasting signature, you want to design the city in such a way that it has exactly (k) rectangular walks. The input contains a single integer (k) ((0 \le k \le 4.194\cdot 10^{12})). On the first line, print two integers (h) and (w) ((1 \le h, w \le 2025)), the height and width of the grid. On the next (h) lines, print a string with (w) characters each, with each character being # , denoting a park, or . , denoting a built-up area. It is guaranteed that for any value of (k) within the given limits, there exists a solution with height and width within the given limits. Any city within the given limits and with exactly (k) rectangular walks will be accepted. In the sample , here are the five possible rectangular walks:

Tutorials

140239

Submissions

Submission Id
Author(s)
Index
Submitted
Verdict
Language
Test Set
Tests Passed
Time taken (ms)
Memory Consumed (bytes)
Tags
Rating
308724482 Sparkle_Twilight B March 3, 2025, 12:15 a.m. OK C++17 (GCC 7-32) TESTS 74 78 614400
308698533 ay1357 B March 2, 2025, 6:48 p.m. OK C++17 (GCC 7-32) TESTS 74 93 614400
308663582 YeahPotato umbrella-leaf cdxcdxcdxcdx B March 2, 2025, 2:01 p.m. OK C++17 (GCC 7-32) TESTS 74 265 25088000
308669587 chaeyihwan Numbering platter B March 2, 2025, 2:46 p.m. OK C++17 (GCC 7-32) TESTS 74 546 33996800
308647529 Kude B March 2, 2025, 12:04 p.m. OK C++20 (GCC 13-64) TESTS 74 77 921600
308662747 kostia244 KostasKostil VladProg B March 2, 2025, 1:56 p.m. OK C++20 (GCC 13-64) TESTS 74 93 102400
308670343 tourist B March 2, 2025, 2:52 p.m. OK C++20 (GCC 13-64) TESTS 74 93 921600
308663307 Irmuun.Ch B March 2, 2025, 1:59 p.m. OK C++20 (GCC 13-64) TESTS 74 124 921600
308657786 Agreb B March 2, 2025, 1:21 p.m. OK C++20 (GCC 13-64) TESTS 74 139 32972800
308653551 jiangly B March 2, 2025, 12:51 p.m. OK C++23 (GCC 14-64, msys2) TESTS 74 78 1024000
308675290 potato167 Nachia Rubikun B March 2, 2025, 3:30 p.m. OK C++23 (GCC 14-64, msys2) TESTS 74 93 1024000
308726446 maspy B March 3, 2025, 12:55 a.m. OK C++23 (GCC 14-64, msys2) TESTS 74 93 14336000
308665101 Kevin114514 jqdai0815 B March 2, 2025, 2:12 p.m. OK C++23 (GCC 14-64, msys2) TESTS 74 109 19865600
308660578 StarSilk B March 2, 2025, 1:41 p.m. OK C++23 (GCC 14-64, msys2) TESTS 74 139 16486400
308651294 244mhq antontrygubO_o B March 2, 2025, 12:34 p.m. OK C++23 (GCC 14-64, msys2) TESTS 74 171 102400
308645988 LeoPro fastmath turmax B March 2, 2025, 11:53 a.m. OK C++23 (GCC 14-64, msys2) TESTS 74 249 69939200

remove filters

Back to search problems