# TLE IN C++, AC in Python3.6, Jan Long Challenge ISBIAS

I was solving ISBIAS from January Long Challenge, I came up with a dynamic programming approach where I simply calculated the count of increasing and decreasing subsequences for each index and stored the (count of increasing - count of decreasing) in an array for each index.
I first calculated all values of this array for given length N .
Did it in O(n) timecomplexity.
So total complexity was O(n+q) .

I implemented this in c++ 14
Here’s my code https://www.codechef.com/viewsolution/28744208

It was showing me TLE , then I wrote the exact same logic in Python3.6 , and got it accepted with just 0.65s time.
My Python3.6 Code-
https://www.codechef.com/viewsolution/28767171
So what is stopping my c++ code from being accepted? Why is it showing TLE for exact same logic?
Need help !

bool solve(int n,int q,vi a,int l, int r){


You’re passing a copy of a (takes O(N)) to the solve function for all O(Q) queries, resulting in an O(N \times Q) algorithm. Pass it by reference-to-const instead:

bool solve(int n,int q, const vi& a,int l, int r){

4 Likes

Oh wow okay, Thanks a lot.
I understand now, I learnt alot in this Jan Long and am very grateful.

1 Like

i would recommend use global variables and use resize and memset to reset the size according to need to avoid mistakes in future

1 Like