codeforces-scrape

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

1130.md (1203B)


      1 Source: https://codeforces.com/blog/entry/65520
      2 
      3 Thanks for participating; we hope you enjoyed the tasks! Look at the bottom of this post for some more challenges.
      4 
      5 Feel free to ask in the comment if you have any question. If you have a different solution from ours, share it too. :D
      6 
      7 #### Our approaches
      8 
      9 **Div2A**
     10 
     11 Tutorial is loading...
     12 
     13 **Div2B**
     14 
     15 Tutorial is loading...
     16 
     17 **Div2C**
     18 
     19 Tutorial is loading...
     20 
     21 **Div1A / Div2D**
     22 
     23 Tutorial is loading...
     24 
     25 **Div1B / Div2E**
     26 
     27 Tutorial is loading...
     28 
     29 **Div1C**
     30 
     31 Tutorial is loading...
     32 
     33 **Div1D**
     34 
     35 Tutorial is loading...
     36 
     37 **Div1E**
     38 
     39 Tutorial is loading...
     40 
     41 #### Challenges
     42 
     43 **Div2C**
     44 
     45 Can you do better than ![](https://espresso.codeforces.com/52f5eb64c79099e50853c05d5eeed424185b604b.png)?
     46 
     47 There's a nice ![](https://espresso.codeforces.com/29165e38e9dc2f1300719e31f973634e704eef6c.png) solution, but you could also use a Voronoi diagram for an ![](https://espresso.codeforces.com/925b67176442b3799c066e54c14485d5ba1f412d.png) runtime too!
     48 
     49 **Div1A / Div2D**
     50 
     51 Develop from our ![](https://espresso.codeforces.com/2ea07df0930018e7899f810e5f4842f0e6499e40.png) approach to solve the task in linear time!
     52 
     53 **Div1C**
     54 
     55 Solve the task when *m* can be up to 105!