Los_Angelos_Laycurse's blog

is there O(n^2) solution for problem 100016B — Command Post ?
By Los_Angelos_Laycurse, 10 years ago, In English

link: http://mirror.codeforces.com/gym/100016 I used a O(n^2*k) construct with some optimization and run 4100+ms how can it be solved in O(n^2),can anyone give some ideas?

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

Comments Comments (1)
| Write comment?
»
10 years ago, # |
  Vote: I like it 0 Vote: I do not like it

I don't think it has O(n^2) solution, but probably there is O(n^2 * log(k)) or O(n * k * log(n)).

→ Reply