Educational Codeforces Round 18

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
792 Educational Codeforces Round 18 FINISHED False 7200 285780323 March 27, 2017, 2:35 p.m.

Problems

Solved
Index
Name
Type
Tags
Community Tag
Rating
( 234 ) F Mages and Monsters PROGRAMMING data structures geometry 3100

Vova plays a computer game known as Mages and Monsters. Vova's character is a mage. Though as he has just started, his character knows no spells. Vova's character can learn new spells during the game. Every spell is characterized by two values x i and y i — damage per second and mana cost per second, respectively. Vova doesn't have to use a spell for an integer amount of seconds. More formally, if he uses a spell with damage x and mana cost y for z seconds, then he will deal x · z damage and spend y · z mana (no rounding). If there is no mana left (mana amount is set in the start of the game and it remains the same at the beginning of every fight), then character won't be able to use any spells. It is prohibited to use multiple spells simultaneously. Also Vova can fight monsters. Every monster is characterized by two values t j and h j — monster kills Vova's character in t j seconds and has h j health points. Mana refills after every fight (or Vova's character revives with full mana reserve), so previous fights have no influence on further ones. Vova's character kills a monster, if he deals h j damage to it in no more than t j seconds using his spells (it is allowed to use more than one spell in a fight) and spending no more mana than he had at the beginning of the fight. If monster's health becomes zero exactly in t j seconds (it means that the monster and Vova's character kill each other at the same time), then Vova wins the fight . You have to write a program which can answer two types of queries: 1 x y — Vova's character learns new spell which deals x damage per second and costs y mana per second. 2 t h — Vova fights the monster which kills his character in t seconds and has h health points. Note that queries are given in a different form. Also remember that Vova's character knows no spells at the beginning of the game. For every query of second type you have to determine if Vova is able to win the fight with corresponding monster. The first line conta

Tutorials

Educational Codeforces Round 18 - Editorial

Submissions

Submission Id
Author(s)
Index
Submitted
Verdict
Language
Test Set
Tests Passed
Time taken (ms)
Memory Consumed (bytes)
Tags
Rating
27461991 AkaneSasu F May 31, 2017, 8:21 a.m. OK GNU C++ TESTS 36 31 0 3100
26183499 xzyxzy F April 7, 2017, 3:50 a.m. OK GNU C++ TESTS 36 31 2048000 3100
25874869 870380501 F March 28, 2017, 1:33 p.m. OK GNU C++ TESTS 36 31 4915200 3100
25874851 870380501 F March 28, 2017, 1:32 p.m. OK GNU C++ TESTS 36 31 5734400 3100
40981905 ReaLNero1 F July 30, 2018, 6:11 p.m. OK GNU C++ TESTS 36 46 3584000 3100
27789429 zhan8855 F June 15, 2017, 8:26 a.m. OK GNU C++ TESTS 36 46 6246400 3100
25886616 jasonvictoryan F March 29, 2017, 3:15 a.m. OK GNU C++ TESTS 36 61 2048000 3100
25877194 Cydiater F March 28, 2017, 3:17 p.m. OK GNU C++ TESTS 36 62 2048000 3100
25877169 Cydiater F March 28, 2017, 3:16 p.m. OK GNU C++ TESTS 36 62 2048000 3100
25876905 Cydiater F March 28, 2017, 3:03 p.m. OK GNU C++ TESTS 36 62 2048000 3100
62107915 star_magic_young F Oct. 8, 2019, 11:23 a.m. OK GNU C++11 TESTS 36 31 0 3100
62060487 Rubbish12345 F Oct. 7, 2019, 1:29 p.m. OK GNU C++11 TESTS 36 31 0 3100
26170022 Talon_F F April 6, 2017, 12:39 p.m. OK GNU C++11 TESTS 36 31 1945600 3100
26169943 Talon_F F April 6, 2017, 12:36 p.m. OK GNU C++11 TESTS 36 31 1945600 3100
63918920 luogu_bot2 F Oct. 31, 2019, 11:04 a.m. OK GNU C++11 TESTS 36 46 0 3100
62107893 m_she F Oct. 8, 2019, 11:22 a.m. OK GNU C++11 TESTS 36 46 0 3100
62064904 luogu_bot5 F Oct. 7, 2019, 2:52 p.m. OK GNU C++11 TESTS 36 46 0 3100
58243699 beautiful-boy F Aug. 4, 2019, 3:45 a.m. OK GNU C++11 TESTS 36 46 0 3100
58228538 beautiful-boy F Aug. 3, 2019, 3:36 p.m. OK GNU C++11 TESTS 36 46 0 3100
58211968 beautiful-boy F Aug. 3, 2019, 9:09 a.m. OK GNU C++11 TESTS 36 46 0 3100
26463007 Egor.Lifar F April 17, 2017, 7:27 p.m. OK GNU C++14 TESTS 36 30 1945600 3100
62060443 iotang F Oct. 7, 2019, 1:28 p.m. OK GNU C++14 TESTS 36 46 0 3100
26334153 olekluka F April 13, 2017, 9:44 a.m. OK GNU C++14 TESTS 36 62 1945600 3100
25867364 AprilGrimoire F March 28, 2017, 7:19 a.m. OK GNU C++14 TESTS 36 77 2150400 3100
34558395 Klift F Jan. 25, 2018, 9:20 p.m. OK GNU C++14 TESTS 36 78 1843200 3100
26507950 NiroBC F April 20, 2017, 4:59 a.m. OK GNU C++14 TESTS 36 78 1945600 3100
26043196 shdut F April 1, 2017, 5:15 a.m. OK GNU C++14 TESTS 36 78 1945600 3100
25890072 atatomir F March 29, 2017, 7:46 a.m. OK GNU C++14 TESTS 36 78 1945600 3100
62060236 newbiegcz F Oct. 7, 2019, 1:24 p.m. OK GNU C++14 TESTS 36 93 0 3100
26059585 lys1280023 F April 1, 2017, 4:41 p.m. OK GNU C++14 TESTS 36 93 2048000 3100
59446708 7oKAVor758 F Aug. 25, 2019, 1:39 p.m. OK GNU C++17 TESTS 36 46 0 3100
66044731 ivanilos F Nov. 30, 2019, 2:44 p.m. OK GNU C++17 TESTS 36 62 0 3100
63395000 Arpa F Oct. 25, 2019, 4:23 p.m. OK GNU C++17 TESTS 36 93 0 3100
57290142 Benq F July 18, 2019, 4:19 p.m. OK GNU C++17 TESTS 36 93 0 3100
60415914 Kuroni F Sept. 12, 2019, 2:08 a.m. OK GNU C++17 TESTS 36 93 102400 3100
25948768 Oaixoul F March 30, 2017, 10:38 a.m. OK Java 8 TESTS 36 873 21196800 3100
26319621 LucaSeri F April 12, 2017, 2:23 p.m. OK Java 8 TESTS 36 1060 21196800 3100
26081868 jslijin F April 2, 2017, 4:20 p.m. OK MS C++ TESTS 36 187 2048000 3100
25876218 Yurik F March 28, 2017, 2:32 p.m. OK MS C++ TESTS 36 327 2048000 3100
37535361 pyrus F April 22, 2018, 2:27 p.m. OK Python 3 TESTS 36 873 15564800 3100

remove filters

Back to search problems