ghost1733's blog

By ghost1733, history, 4 years ago, In English

I tried a question based on geometry and found an O(n) algo but still its getting TLE with time limit 1 sec. Please give suggestions to improve my code's efficiency. question: ICPC mirror problem G (https://codeforces.me/contest/1468/problem/G) my Code: https://codeforces.me/contest/1468/submission/102368471 Edit 102455572 Somehow taking input as integers and then assigning to point data structures solves my issue.

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

»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by ghost1733 (previous revision, new revision, compare).

»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by ghost1733 (previous revision, new revision, compare).

»
3 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by ghost1733 (previous revision, new revision, compare).