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 |
---|---|---|---|---|---|---|
1525 | Educational Codeforces Round 109 (Rated for Div. 2) | FINISHED | False | 7200 | 116200811 | May 16, 2021, 8 a.m. |
Solved$ |
Index |
Name |
Type |
Tags |
Community Tag |
Rating |
---|---|---|---|---|---|---|
( 337 ) | F | Goblins And Gnomes | PROGRAMMING | brute force dp graph matchings |
B'Monocarp plays a computer game called "Goblins and Gnomes". In this game, he manages a large underground city of gnomes and defends it from hordes of goblins. The city consists of n halls and m one-directional tunnels connecting them. The structure of tunnels has the following property: if a goblin leaves any hall, he cannot return to that hall. The city will be attacked by k waves of goblins; during the i -th wave, i goblins attack the city. Monocarp 's goal is to pass all k waves. The i -th wave goes as follows: firstly, i goblins appear in some halls of the city and pillage them; at most one goblin appears in each hall. Then, goblins start moving along the tunnels, pillaging all the halls in their path. Goblins are very greedy and cunning, so they choose their paths so that no two goblins pass through the same hall. Among all possible attack plans, they choose a plan which allows them to pillage the maximum number of halls. After goblins are done pillaging, they leave the city. If all halls are pillaged during the wave -- Monocarp loses the game. Otherwise, the city is restored. If some hall is pillaged during a wave, goblins are still interested in pillaging it during the next waves. Before each wave, Monocarp can spend some time preparing to it. Monocarp doesn 't have any strict time limits on his preparations (he decides when to call each wave by himself), but the longer he prepares for a wave, the fewer points he gets for passing it. If Monocarp prepares for the i -th wave for t_i minutes, then he gets max(0, x_i - t_i cdot y_i) points for passing it (obviously, if he doesn 't lose in the process). While preparing for a wave, Monocarp can block tunnels. He can spend one minute to either block all tunnels leading from some hall or block all tunnels leading to some hall. If Monocarp blocks a tunnel while preparing for a wave, it stays blocked during the next waves as well. Help Monocarp '... |
90793 |
Submission Id |
Author(s) |
Index |
Submitted |
Verdict |
Language |
Test Set |
Tests Passed |
Time taken (ms) |
Memory Consumed (bytes) |
Tags |
Rating |
---|---|---|---|---|---|---|---|---|---|---|---|
116396778 | Mr.Robot_28 | F | May 16, 2021, 11:33 a.m. | OK | GNU C++11 | TESTS | 79 | 30 | 102400 | ||
116395698 | atoiz | F | May 16, 2021, 11:22 a.m. | OK | GNU C++11 | TESTS | 79 | 30 | 204800 | ||
116391371 | Richard_ZRC | F | May 16, 2021, 10:39 a.m. | OK | GNU C++11 | TESTS | 79 | 31 | 204800 | ||
116418697 | sh1194 | F | May 16, 2021, 3:50 p.m. | OK | GNU C++11 | TESTS | 79 | 46 | 0 | ||
116385915 | cjy2003 | F | May 16, 2021, 9:59 a.m. | OK | GNU C++11 | TESTS | 79 | 62 | 0 | ||
116436194 | pikapikachu | F | May 16, 2021, 9:24 p.m. | OK | GNU C++11 | TESTS | 79 | 62 | 102400 | ||
116428455 | abhishek.darsha1212000 | F | May 16, 2021, 6:18 p.m. | OK | GNU C++14 | TESTS | 79 | 46 | 0 | ||
116425184 | Pato_Donald | F | May 16, 2021, 5:24 p.m. | OK | GNU C++14 | TESTS | 79 | 46 | 716800 | ||
116391145 | Asilbek_001_tiger | F | May 16, 2021, 10:37 a.m. | OK | GNU C++17 | TESTS | 79 | 31 | 307200 | ||
116412900 | fivefourthreeone | F | May 16, 2021, 2:41 p.m. | OK | GNU C++17 | TESTS | 79 | 62 | 409600 | ||
116395432 | CoderAnshu | F | May 16, 2021, 11:20 a.m. | OK | GNU C++17 | TESTS | 79 | 108 | 512000 | ||
116390315 | _runtimeTerror_ | F | May 16, 2021, 10:29 a.m. | OK | GNU C++17 | TESTS | 79 | 109 | 819200 | ||
116444362 | penguinhacker | F | May 17, 2021, 3:22 a.m. | OK | GNU C++17 | TESTS | 79 | 140 | 409600 | ||
116389823 | _runtimeTerror_ | F | May 16, 2021, 10:25 a.m. | OK | GNU C++17 | TESTS | 79 | 171 | 512000 | ||
116429325 | pikel_rik | F | May 16, 2021, 6:33 p.m. | OK | GNU C++17 (64) | TESTS | 79 | 31 | 102400 | ||
116392361 | wty2016 | F | May 16, 2021, 10:50 a.m. | OK | GNU C++17 (64) | TESTS | 79 | 31 | 512000 | ||
116385839 | LayCurse | F | May 16, 2021, 9:59 a.m. | OK | GNU C++17 (64) | TESTS | 79 | 31 | 103219200 | ||
116386846 | hitonanode | F | May 16, 2021, 10:04 a.m. | OK | GNU C++17 (64) | TESTS | 79 | 77 | 1331200 | ||
116390488 | evilbuggy | F | May 16, 2021, 10:31 a.m. | OK | GNU C++17 (64) | TESTS | 79 | 93 | 102400 | ||
116444476 | aryanc403 | F | May 17, 2021, 3:26 a.m. | OK | GNU C++17 (64) | TESTS | 79 | 108 | 716800 | ||
116445357 | aryanc403 | F | May 17, 2021, 3:47 a.m. | OK | GNU C++17 (64) | TESTS | 79 | 218 | 819200 | ||
116401819 | uwi | F | May 16, 2021, 12:29 p.m. | OK | Java 11 | TESTS | 79 | 248 | 102400 |
Back to search problems