blablabla1803's blog

Resolved
By blablabla1803, history, 7 weeks ago, In English

In the last div2 B problem, 283258843 isnt this submission O(nlogn) ?? If it is so then why is it getting TLEd :(. Otherwise what is the correct complexity?

  • Vote: I like it
  • +1
  • Vote: I do not like it

»
7 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

isn't it O(T(n + q))?

→ Reply
»
7 weeks ago, # |
  Vote: I like it +1 Vote: I do not like it

had the same issue declare k as long long

→ Reply
»
7 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

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

→ Reply
»
7 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

I've just changed endl to '\n' and the type of K to long long and it got accepted 283362761

→ Reply
  • »
    »
    7 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    yah int was the issue, i didnt check the limits of k. Felt quite stupid :)

    → Reply