codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

670D2.md (2864B)


      1 Source: https://codeforces.com/problemset/problem/670/D2
      2 
      3 D2. Magic Powder - 2
      4 
      5 time limit per test
      6 
      7 1 second
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 This problem is given in two versions that differ only by constraints. If you can solve this problem in large constraints, then you can just write a single solution to the both versions. If you find the problem too difficult in large constraints, you can write solution to the simplified version only.
     22 
     23 Waking up in the morning, Apollinaria decided to bake cookies. To bake one cookie, she needs $n$ ingredients, and for each ingredient she knows the value $a_i$ — how many grams of this ingredient one needs to bake a cookie. To prepare one cookie Apollinaria needs to use all $n$ ingredients.
     24 
     25 Apollinaria has $b_i$ gram of the $i$-th ingredient. Also she has $k$ grams of a magic powder. Each gram of magic powder can be turned to exactly $1$ gram of any of the $n$ ingredients and can be used for baking cookies.
     26 
     27 Your task is to determine the maximum number of cookies, which Apollinaria is able to bake using the ingredients that she has and the magic powder.
     28 
     29 Input
     30 
     31 The first line contains two positive integers $n$ and $k$ ($1 \le n \le 100\,000, 1 \le k \le 10^9$) — the number of ingredients and the number of grams of the magic powder.
     32 
     33 The second line contains the sequence $a_1, a_2, \dots, a_n$ ($1 \le a_i \le 10^9$), where the $i$-th number is equal to the number of grams of the $i$-th ingredient, needed to bake one cookie.
     34 
     35 The third line contains the sequence $b_1, b_2, \dots, b_n$ ($1 \le b_i \le 10^9$), where the $i$-th number is equal to the number of grams of the $i$-th ingredient, which Apollinaria has.
     36 
     37 Output
     38 
     39 Print the maximum number of cookies, which Apollinaria will be able to bake using the ingredients that she has and the magic powder.
     40 
     41 Examples
     42 
     43 Input
     44 
     45 ```
     46 1 1000000000  
     47 1  
     48 1000000000
     49 ```
     50 
     51 Output
     52 
     53 ```
     54 2000000000
     55 ```
     56 
     57 Input
     58 
     59 ```
     60 10 1  
     61 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000  
     62 1 1 1 1 1 1 1 1 1 1
     63 ```
     64 
     65 Output
     66 
     67 ```
     68 0
     69 ```
     70 
     71 Input
     72 
     73 ```
     74 3 1  
     75 2 1 4  
     76 11 3 16
     77 ```
     78 
     79 Output
     80 
     81 ```
     82 4
     83 ```
     84 
     85 Input
     86 
     87 ```
     88 4 3  
     89 4 3 5 6  
     90 11 12 14 20
     91 ```
     92 
     93 Output
     94 
     95 ```
     96 3
     97 ```
     98 
     99 Note
    100 
    101 The first two examples highlight the larger constraints of the input in this version.
    102 
    103 In the third example, it is profitably for Apollinaria to make the existing $1$ gram of her magic powder to ingredient with the index $2$, then Apollinaria will be able to bake $4$ cookies.
    104 
    105 In the fourth example, Apollinaria should turn $1$ gram of magic powder to ingredient with the index $1$ and $1$ gram of magic powder to ingredient with the index $3$. Then Apollinaria will be able to bake $3$ cookies. The remaining $1$ gram of the magic powder can be left, because it can't be used to increase the answer.