gilcu3's blog

By gilcu3, 9 years ago, In English

I'm looking for the solution or hints for the E problem, Efficient Cartography, ACM-ICPC NEERC 2010-2011 Moscow Subregional Contest, which can be found here. I have found the official solution here as well, but its in Russian, and I don't understand it, anyone willing to translate it, or solve the problem and post hints? thank you...

 
 
 
 
  • Vote: I like it
  • +1
  • Vote: I do not like it

»
9 years ago, # |
  Vote: I like it 0 Vote: I do not like it

The main idia is to switch from rectangles net to dots net. We will replace all pixels in area with rectangle (equal to screen size) but thesame time replace screen rectangles to dots. This way we have to find the least amount of the pixels net on the new extended area.

  • »
    »
    9 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    That's kinda the idea in the official solution, but I need much more details, because I don't understand it by far...

»
9 years ago, # |
  Vote: I like it +3 Vote: I do not like it

Isn't anybody from the russian comunity willing to translate such an interesting problem? Maybe I should start learning russian...