CSES Subarray Sums II - Wrong Time Complexity

[dgeosh]

https://usaco.guide/problems/cses-1661-subarray-sums-ii/solution
STL ordered map data structure used for implementation with N accesses.
Each access takes logn.
Time complexity should be O(N log N), is incorrectly denoted O(N).

Place an "x" in the corresponding checkbox if it is done or does not apply to this pull request.

• I have tested my code.
• I have added my solution according to the steps here.
• I have followed the code conventions mentioned here.
  • I understand that if it is clear that I have not attempted to follow these conventions, my PR will be closed.
  • If changes are requested, I will re-request a review after addressing them.
• I have linked this PR to any issues that it closes.

[SansPapyrus683]

i mean you could replace it with unordered map but that literally makes it slower
also java/python uses a normal hashmap impl

[envyaims]

i mean you could replace it with unordered map but that literally makes it slower also java/python uses a normal hashmap impl

maybe just add a note the log factor is caused by hashmap

[bqi343]

maybe just add a note the log factor is caused by hashmap

huh? hashmap doesn't have a log factor

btw, the Python solution now TLEs on CSES due to hacks 😆

[SansPapyrus683]

unlucky, we should prob add a warning for that