Los_Angelos_Laycurse's blog

By Los_Angelos_Laycurse, history, 9 years ago, In English

http://codeforces.net/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....

| 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.