Tima's blog

USP-ICMC 2015

By Tima, history, 11 years ago, In Russian

How to solve I ,J ?

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

»
11 years ago, hide # |
 
Vote: I like it +5 Vote: I do not like it

I — Max flow, but greedy also works.

J — For each sprayer find walls positions when the sprayer is blocked — you'll get a bunch of segments, then just find point covered by maximum number of segments.

→ Reply
  • »
    »
    11 years ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it

    Please can you explain J a little more ? I can't understand the idea.

    → Reply