Los_Angelos_Laycurse's blog

O(n^2) Accepted gym 100134 K Kingdom Reunion1
By Los_Angelos_Laycurse, history, 9 years ago, In English

http://mirror.codeforces.com/gym/100134

though there are 345 test cases, I think there are a lot of holes in test cases,maybe it is a little boring to write n^2 brute force but sweepline algorithm is also not interesting....

  • Vote: I like it
  • -22
  • Vote: I do not like it

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

I don't really see a problem in O(N^2) solution passing for N=10000.

→ Reply