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 |
|---|---|---|---|---|---|---|
| 853 | Codeforces Round 433 (Div. 1, based on Olympiad of Metropolises) | FINISHED | False | 7200 | 271703123 | Sept. 6, 2017, 12:55 p.m. |
Solved |
Index |
Name |
Type |
Tags |
Community Tag |
Rating |
|---|---|---|---|---|---|---|
| ( 81 ) | E | Lada Malina | PROGRAMMING | data structures geometry | 3400 |
After long-term research and lots of experiments leading Megapolian automobile manufacturer «AutoVoz» released a brand new car model named «Lada Malina». One of the most impressive features of «Lada Malina» is its highly efficient environment-friendly engines. Consider car as a point in Oxy plane. Car is equipped with k engines numbered from 1 to k . Each engine is defined by its velocity vector whose coordinates are ( vx i , vy i ) measured in distance units per day. An engine may be turned on at any level w i , that is a real number between - 1 and + 1 (inclusive) that result in a term of ( w i · vx i , w i · vy i ) in the final car velocity. Namely, the final car velocity is equal to Formally, if car moves with constant values of w i during the whole day then its x -coordinate will change by the first component of an expression above, and its y -coordinate will change by the second component of an expression above. For example, if all w i are equal to zero, the car won't move, and if all w i are equal to zero except w 1 = 1 , then car will move with the velocity of the first engine. There are n factories in Megapolia, i -th of them is located in ( fx i , fy i ) . On the i -th factory there are a i cars «Lada Malina» that are ready for operation. As an attempt to increase sales of a new car, «AutoVoz» is going to hold an international exposition of cars. There are q options of exposition location and time, in the i -th of them exposition will happen in a point with coordinates ( px i , py i ) in t i days. Of course, at the «AutoVoz» is going to bring as much new cars from factories as possible to the place of exposition. Cars are going to be moved by enabling their engines on some certain levels, such that at the beginning of an exposition car gets exactly to the exposition location. However, for some of the options it may be impossible to bring cars from some of the factories to the exposition location by the moment of an exposition. Your task is to det |
| Codeforces Round #433 Editorial |
Submission Id |
Author(s) |
Index |
Submitted |
Verdict |
Language |
Test Set |
Tests Passed |
Time taken (ms) |
Memory Consumed (bytes) |
Tags |
Rating |
|---|---|---|---|---|---|---|---|---|---|---|---|
| 30266100 | SkyDec | E | Sept. 11, 2017, 1:08 p.m. | OK | GNU C++ | TESTS | 65 | 1653 | 18534400 | 3400 | |
| 30266180 | SkyDec | E | Sept. 11, 2017, 1:12 p.m. | OK | GNU C++ | TESTS | 65 | 1668 | 18534400 | 3400 | |
| 30157566 | 1919810 | E | Sept. 6, 2017, 3:41 p.m. | OK | GNU C++ | TESTS | 65 | 4726 | 38502400 | 3400 | |
| 47853286 | skywalkert | E | Jan. 2, 2019, 7:19 p.m. | OK | GNU C++11 | TESTS | 65 | 1029 | 12800000 | 3400 | |
| 47795601 | Tangjz | E | Dec. 31, 2018, 4:41 p.m. | OK | GNU C++11 | TESTS | 65 | 1029 | 12800000 | 3400 | |
| 40979885 | ReaLNero1 | E | July 30, 2018, 5:17 p.m. | OK | GNU C++11 | TESTS | 65 | 1216 | 24883200 | 3400 | |
| 31229560 | laofudasuan | E | Oct. 12, 2017, 12:26 a.m. | OK | GNU C++11 | TESTS | 65 | 1263 | 24883200 | 3400 | |
| 57873308 | lopare | E | July 28, 2019, 3:29 a.m. | OK | GNU C++11 | TESTS | 65 | 1294 | 9011200 | 3400 | |
| 57769099 | py_ultron | E | July 25, 2019, 10:54 p.m. | OK | GNU C++11 | TESTS | 65 | 1294 | 9011200 | 3400 | |
| 30173059 | ditoly | E | Sept. 7, 2017, 6:01 a.m. | OK | GNU C++11 | TESTS | 65 | 1310 | 9011200 | 3400 | |
| 46760441 | Heaplax | E | Dec. 8, 2018, 1:11 p.m. | OK | GNU C++11 | TESTS | 65 | 1419 | 13619200 | 3400 | |
| 30228819 | krijgertje | E | Sept. 9, 2017, 3:19 p.m. | OK | GNU C++11 | TESTS | 65 | 1621 | 12083200 | 3400 | |
| 30698937 | FizzyDavid | E | Sept. 25, 2017, 8:50 a.m. | OK | GNU C++11 | TESTS | 65 | 1747 | 18636800 | 3400 | |
| 30335440 | Egor.Lifar | E | Sept. 14, 2017, 5:49 p.m. | OK | GNU C++14 | TESTS | 65 | 1325 | 9216000 | 3400 | |
| 34507361 | ssnsarang2023 | E | Jan. 24, 2018, 7:28 a.m. | OK | GNU C++14 | TESTS | 65 | 1481 | 26726400 | 3400 | |
| 59549655 | Scut82 | E | Aug. 27, 2019, 1:51 a.m. | OK | GNU C++14 | TESTS | 65 | 1965 | 22425600 | 3400 | |
| 30476098 | Necrozma | E | Sept. 18, 2017, 3:53 p.m. | OK | GNU C++14 | TESTS | 65 | 2059 | 246476800 | 3400 | |
| 37146456 | ykn1 | E | April 10, 2018, 1:57 p.m. | OK | GNU C++14 | TESTS | 65 | 2121 | 249856000 | 3400 | |
| 30236439 | Belonogov | E | Sept. 10, 2017, 2 a.m. | OK | GNU C++14 | TESTS | 65 | 2215 | 41984000 | 3400 | |
| 30179071 | FallDream | E | Sept. 7, 2017, 11:04 a.m. | OK | GNU C++14 | TESTS | 65 | 2245 | 173158400 | 3400 | |
| 30161518 | anta | E | Sept. 6, 2017, 5:11 p.m. | OK | GNU C++14 | TESTS | 65 | 2324 | 246579200 | 3400 | |
| 30179221 | FallDream | E | Sept. 7, 2017, 11:13 a.m. | OK | GNU C++14 | TESTS | 65 | 2401 | 224768000 | 3400 | |
| 59557139 | Scut82 | E | Aug. 27, 2019, 6:45 a.m. | OK | GNU C++14 | TESTS | 65 | 2636 | 15257600 | 3400 | |
| 63083534 | gongsuidashen | E | Oct. 21, 2019, 3:53 p.m. | OK | GNU C++17 | TESTS | 65 | 1559 | 9216000 | 3400 | |
| 62575674 | ak_taniya | E | Oct. 14, 2019, 3:49 p.m. | OK | GNU C++17 | TESTS | 65 | 2340 | 22016000 | 3400 | |
| 41995160 | MadCoding | E | Aug. 23, 2018, 11:40 a.m. | OK | GNU C++17 | TESTS | 65 | 2573 | 21913600 | 3400 | |
| 30164116 | mmaxio | E | Sept. 6, 2017, 6:44 p.m. | OK | Java 8 | TESTS | 65 | 3228 | 16793600 | 3400 | |
| 30187044 | fetetriste | E | Sept. 7, 2017, 5:15 p.m. | OK | Java 8 | TESTS | 65 | 4898 | 24166400 | 3400 | |
| 30824799 | Los_Angelos_Laycurse | E | Sept. 29, 2017, 9:38 a.m. | OK | MS C++ | TESTS | 65 | 3400 | 11264000 | 3400 |
Back to search problems