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 |
|---|---|---|---|---|---|---|
| 2172 | 2025 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) | FINISHED | False | 18000 | 13147823 | Nov. 16, 2025, 1:50 a.m. |
Solved |
Index |
Name |
Type |
Tags |
Community Tag |
Rating |
|---|---|---|---|---|---|---|
| ( 162 ) | N | New Kingdom | PROGRAMMING |
In the upcoming strategy game Island Cartographer: Penultimate Chapter (ICPC), players take the role of bridge engineers employed by the Imperial Cartography & Planning Council to design a new kingdom spread across an archipelago of (n) islands connected by a network of causeways. To achieve balance between stability and exploration, the council requires that the player's plan satisfy several strict rules. The first and fundamental requirement is that the kingdom must be simple and connected . That is, each causeway connects two different islands, no two causeways connect the same pair of islands, and for each pair of different islands, there exists a route between them using a sequence of causeways. After learning the ancient wisdom of the legendary tourist Euler, some visitors might be able to traverse every causeway exactly once in a single, seamless tour. If this is possible, then those visitors would not have enough time to enjoy their trips. To make them travel for longer, the council's second requirement is that exactly (k) islands have an odd number of causeways connected to them. Some causeways are considered vital to the kingdom. A causeway is vital if removing it would make travel between some pair of islands impossible. These causeways are important for local development, cultural identity, and tourism, but having too many of them could lead to traffic congestion. Therefore, the council's third and final requirement is that the kingdom must contain exactly (b) vital causeways. To complete a game of ICPC, the player must submit a plan to build causeways that satisfies all the requirements for the parameters (n), (k), and (b) provided by the council. Before the game's release, you are tasked with testing the game by designing a valid kingdom plan as the player. In case the game is impossible to complete, please report so. Each test contains multiple test cases. The first line contains the number of test cases (t). The |
Submission Id |
Author(s) |
Index |
Submitted |
Verdict |
Language |
Test Set |
Tests Passed |
Time taken (ms) |
Memory Consumed (bytes) |
Tags |
Rating |
|---|---|---|---|---|---|---|---|---|---|---|---|
| 349365183 | VaHiX | N | Nov. 17, 2025, 2:59 a.m. | OK | C++17 (GCC 7-32) | TESTS | 26 | 93 | 2355200 | ||
| 349249864 | su_da | N | Nov. 16, 2025, 11:30 a.m. | OK | C++17 (GCC 7-32) | TESTS | 26 | 93 | 2355200 | ||
| 349242948 | yousef324 | N | Nov. 16, 2025, 10:51 a.m. | OK | C++17 (GCC 7-32) | TESTS | 26 | 108 | 2355200 | ||
| 349219172 | as_dfsdf | N | Nov. 16, 2025, 7:05 a.m. | OK | C++17 (GCC 7-32) | TESTS | 26 | 108 | 8089600 | ||
| 349212246 | HollwoQ_Pelw trungnotchung bachbeo2007 | N | Nov. 16, 2025, 6:02 a.m. | OK | C++20 (GCC 13-64) | TESTS | 26 | 62 | 4608000 | ||
| 349237964 | feeder1 | N | Nov. 16, 2025, 10:03 a.m. | OK | C++20 (GCC 13-64) | TESTS | 26 | 77 | 307200 | ||
| 349219277 | HuaJun | N | Nov. 16, 2025, 7:06 a.m. | OK | C++20 (GCC 13-64) | TESTS | 26 | 77 | 307200 | ||
| 349211902 | kotatsugame | N | Nov. 16, 2025, 5:59 a.m. | OK | C++20 (GCC 13-64) | TESTS | 26 | 77 | 819200 | ||
| 349270016 | atkubo | N | Nov. 16, 2025, 2:32 p.m. | OK | C++20 (GCC 13-64) | TESTS | 26 | 77 | 3481600 | ||
| 349205387 | kizen leinad2 platter | N | Nov. 16, 2025, 4:42 a.m. | OK | C++20 (GCC 13-64) | TESTS | 26 | 78 | 3481600 | ||
| 349211119 | Grisses ddxrS su_da | N | Nov. 16, 2025, 5:51 a.m. | OK | C++20 (GCC 13-64) | TESTS | 26 | 125 | 3481600 | ||
| 349212133 | CCCCOrz OdtreeKing zhangtianhan | N | Nov. 16, 2025, 6:01 a.m. | OK | C++23 (GCC 14-64, msys2) | TESTS | 26 | 77 | 409600 | ||
| 349256747 | ogenus | N | Nov. 16, 2025, 12:27 p.m. | OK | C++23 (GCC 14-64, msys2) | TESTS | 26 | 77 | 3584000 | ||
| 349226510 | ogenus | N | Nov. 16, 2025, 8:15 a.m. | OK | C++23 (GCC 14-64, msys2) | TESTS | 26 | 77 | 3584000 | ||
| 349223595 | SorahISA | N | Nov. 16, 2025, 7:46 a.m. | OK | C++23 (GCC 14-64, msys2) | TESTS | 26 | 77 | 3584000 | ||
| 349206890 | YCY_love_little09 | N | Nov. 16, 2025, 5:04 a.m. | OK | C++23 (GCC 14-64, msys2) | TESTS | 26 | 78 | 409600 | ||
| 349223254 | hasan11292012 | N | Nov. 16, 2025, 7:43 a.m. | OK | C++23 (GCC 14-64, msys2) | TESTS | 26 | 124 | 307200 | ||
| 349222179 | hungchi17 | N | Nov. 16, 2025, 7:32 a.m. | OK | C++23 (GCC 14-64, msys2) | TESTS | 26 | 125 | 307200 | ||
| 349222102 | hungchi17 | N | Nov. 16, 2025, 7:31 a.m. | OK | C++23 (GCC 14-64, msys2) | TESTS | 26 | 140 | 409600 | ||
| 349216077 | qwerasdfzxcl imeimi Numbering | N | Nov. 16, 2025, 6:37 a.m. | OK | C++23 (GCC 14-64, msys2) | TESTS | 26 | 155 | 307200 | ||
| 349207994 | kiana810 ustze namespace_std | N | Nov. 16, 2025, 5:17 a.m. | OK | C++23 (GCC 14-64, msys2) | TESTS | 26 | 171 | 134451200 |
Back to search problems