Блог пользователя skpro19

O(n^2) solution is getting accepted but O(n * (n — 1)) solution is getting TLE
Автор skpro19, история, 9 лет назад, По-английски

The problem is Almost Arithmetic Sequences.

Accepted Solution

Time limit exceeded

Can someone please figure out why is this happening?

  • Проголосовать: нравится
  • -6
  • Проголосовать: не нравится

»
9 лет назад, # |
  Проголосовать: нравится +16 Проголосовать: не нравится

O(n2) and O(n(n - 1)) is the same in terms of big O notation. Are you sure you need set in your programs? Your slower program is because you add O(n2) elements to set. Maybe list or vector will be enough? Or iterating over elements instead of a new structure?

→ Ответить