could anyone tell me why i am getting tle on test case 41? my solution is of o(nlogn) {if i am not wrong} . and by seeing constraints it should pass the testcases?. anyone?
sumbission link :- https://codeforces.me/contest/1902/submission/256209886
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3857 |
| 2 | jiangly | 3810 |
| 3 | maroonrk | 3534 |
| 4 | tourist | 3528 |
| 5 | Kevin114514 | 3510 |
| 6 | turmax | 3411 |
| 7 | Um_nik | 3387 |
| 8 | Radewoosh | 3367 |
| 9 | heuristica | 3322 |
| 10 | strapple | 3317 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | maspy | 150 |
| 3 | Um_nik | 146 |
| 4 | Errichto | 139 |
| 5 | adamant | 136 |
| 6 | maroonrk | 134 |
| 7 | DNR | 133 |
| 8 | Dominater069 | 131 |
| 9 | Proof_by_QED | 130 |
| 9 | AmShZ | 130 |
could anyone tell me why i am getting tle on test case 41? my solution is of o(nlogn) {if i am not wrong} . and by seeing constraints it should pass the testcases?. anyone?
sumbission link :- https://codeforces.me/contest/1902/submission/256209886
| Name |
|---|



You need to change one thing on L142
From:
To:
The first one copies the vector in
m[{x1,y1}]to create a new vector stored intemp. This takes $$$O(n)$$$ time, where $$$n$$$ is the length of the vector.thnx a lot, i had wasted several hrs due to this bug. dont know why i am getting downvoted for asking this question :(
I think it's probably because your dirty doings got exposed here.
ooh thnx . may be u should read my pov. (looks like no use of discussing it , leave it. thnx for helping)