School Personal Contest #3 (Winter Computer School 2010/11) - Codeforces Beta Round 45 (ACM-ICPC Rules)

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
48 School Personal Contest #3 (Winter Computer School 2010/11) - Codeforces Beta Round 45 (ACM-ICPC Rules) FINISHED False 10800 484264823 Dec. 12, 2010, 8 a.m.

Problems

Solved
Index
Name
Type
Tags
Community Tag
Rating
( 189 ) F Snow sellers PROGRAMMING greedy sortings 2600

The New Year celebrations in Berland last n days. Only this year the winter is snowless, that’s why the winter celebrations’ organizers should buy artificial snow. There are m snow selling companies in Berland. Every day the i -th company produces w i cubic meters of snow. Next day the snow thaws and the company has to produce w i cubic meters of snow again. During the celebration new year discounts are on, that’s why the snow cost decreases every day. It is known that on the first day the total cost of all the snow produced by the i -th company is equal to c i bourles. Every day this total cost decreases by a i bourles, i.e. on the second day it is equal to c i - a i ,and on the third day — to c i - 2 a i , and so on. It is known that for one company the cost of the snow produced by it does not get negative or equal to zero. You have to organize the snow purchase so as to buy every day exactly W snow cubic meters. At that it is not necessary to buy from any company all the snow produced by it. If you buy n i cubic meters of snow ( 0 ≤ n i ≤ w i , the number n i is not necessarily integer!) from the i -th company at one of the days when the cost of its snow is equal to s i , then its price will total to bourles. During one day one can buy the snow from several companies. In different days one can buy the snow from different companies. It is required to make the purchases so as to spend as little money as possible. It is guaranteed that the snow produced by the companies will be enough. The first line contains integers n , m and W ( 1 ≤ n ≤ 100 , 1 ≤ m ≤ 500000 , 1 ≤ W ≤ 10 9 ) which represent the number of days, the number of companies and the amount of snow that needs to be purchased on every one of the n days. The second line contains m integers w i . The third line contains m integers c i . The fourth line contains m integers a i . All the numbers are strictly positive and do not exceed 10 9 . For all the i the inequation c i - ( n - 1) a i > 0 holds tr

Tutorials

Submissions

Submission Id
Author(s)
Index
Submitted
Verdict
Language
Test Set
Tests Passed
Time taken (ms)
Memory Consumed (bytes)
Tags
Rating
1373940 ignored F March 17, 2012, 8:09 p.m. OK GNU C++ TESTS 31 1230 7475200 2600
11337747 Amr_Hassan F May 28, 2015, 7:17 p.m. OK GNU C++ TESTS 31 1278 6041600 2600
4387113 I_so_sad F Aug. 31, 2013, 10:39 a.m. OK GNU C++ TESTS 31 1278 6041600 2600
4387093 I_so_sad F Aug. 31, 2013, 10:37 a.m. OK GNU C++ TESTS 31 1340 6041600 2600
473909 ILJ F June 1, 2011, 11:30 a.m. OK GNU C++ TESTS 31 1630 7372800 2600
275663 ACRush F Feb. 5, 2011, 2:44 p.m. OK GNU C++ TESTS 31 1670 7372800 2600
221952 NotOnlySuccess F Dec. 28, 2010, 1:27 p.m. OK GNU C++ TESTS 31 1950 9318400 2600
3883419 numitus F June 14, 2013, 2:13 p.m. OK GNU C++ TESTS 31 2250 19968000 2600
219655 ilyakor F Dec. 12, 2010, 10:30 a.m. OK GNU C++ TESTS 31 2270 27443200 2600
5544442 gagaga5-gagaga F Dec. 28, 2013, 7:25 p.m. OK GNU C++ TESTS 31 2340 10035200 2600
2879702 Archon.JK F Jan. 7, 2013, 4:17 a.m. OK GNU C++0x TESTS 31 1156 6041600 2600
3234891 konstantanter F March 3, 2013, 3:02 p.m. OK GNU C++0x TESTS 31 1171 6041600 2600
46063234 luogu_bot4 F Nov. 22, 2018, 2:30 p.m. OK GNU C++11 TESTS 31 1060 5836800 2600
40993327 ReaLNero1 F July 31, 2018, 1:54 a.m. OK GNU C++11 TESTS 31 1278 5836800 2600
12033441 HellKitsune F July 13, 2015, 8:45 p.m. OK GNU C++11 TESTS 31 2588 14028800 2600
20526057 hnuRoshan F Sept. 11, 2016, 9:44 a.m. OK GNU C++11 TESTS 31 3086 11980800 2600
12095144 user32 F July 17, 2015, 12:24 p.m. OK GNU C++11 TESTS 31 3212 10035200 2600
44684769 irkstepanov F Oct. 22, 2018, 8:48 a.m. OK GNU C++11 TESTS 31 5990 44646400 2600
57907027 lopare F July 28, 2019, 6:03 p.m. OK GNU C++11 TESTS 31 6552 14131200 2600
43053058 zhouyuyang F Sept. 19, 2018, 12:13 a.m. OK GNU C++11 TESTS 31 7486 14131200 2600
23622266 Ali.Pi F Jan. 7, 2017, 10:56 a.m. OK GNU C++14 TESTS 31 3118 13926400 2600
26142151 Roms F April 5, 2017, 11:59 a.m. OK GNU C++14 TESTS 31 5802 13926400 2600
56015804 sorry_im_smurfing F June 24, 2019, 9:05 p.m. OK GNU C++14 TESTS 31 7268 14233600 2600
56239861 artur.socha F June 28, 2019, 5:55 p.m. OK GNU C++14 TESTS 31 7922 78540800 2600
56239652 artur.socha F June 28, 2019, 5:50 p.m. OK GNU C++14 TESTS 31 7986 82841600 2600
33023998 Cmise F Dec. 8, 2017, 1:46 p.m. OK GNU C++14 TESTS 31 9950 19968000 2600
38017462 ruo F May 8, 2018, 10:20 a.m. OK GNU C++17 TESTS 31 3118 15667200 2600
68943827 Slaaava F Jan. 16, 2020, 3:22 p.m. OK GNU C++17 TESTS 31 5646 38092800 2600
220300 Sergey.Bankevich F Dec. 12, 2010, 10:55 a.m. OK Java 6 TESTS 31 2410 43417600 2600
18630928 2016 F June 21, 2016, 1:29 p.m. OK MS C++ TESTS 31 1652 26009600 2600
221728 moondy F Dec. 17, 2010, 9:15 a.m. OK MS C++ TESTS 31 1880 9728000 2600
3905815 Mark_tven F June 16, 2013, 1:40 p.m. OK MS C++ TESTS 31 2203 11980800 2600
3905793 Mark_tven F June 16, 2013, 1:33 p.m. OK MS C++ TESTS 31 2281 11980800 2600
221189 Vasya.V F Dec. 13, 2010, 12:33 p.m. OK MS C++ TESTS 31 2830 17408000 2600
221680 Vasya.V F Dec. 16, 2010, 9:57 p.m. OK MS C++ TESTS 31 3020 17408000 2600
221683 Vasya.V F Dec. 16, 2010, 10:06 p.m. OK MS C++ TESTS 31 3170 17408000 2600
221679 Vasya.V F Dec. 16, 2010, 9:56 p.m. OK MS C++ TESTS 31 3190 17408000 2600
221678 Vasya.V F Dec. 16, 2010, 9:52 p.m. OK MS C++ TESTS 31 3330 17408000 2600
221288 KADR F Dec. 13, 2010, 8:16 p.m. OK MS C++ TESTS 31 3440 17510400 2600

remove filters

Back to search problems