Quantcast
Channel: CodeChef Discuss - latest questions
Viewing all articles
Browse latest Browse all 40121

magic ranking time limit exceeded

$
0
0

I am having problems with magic ranking problem.

I am quite sure i am using the right approach and produce correct results in O(n^2) but I keep getting TLE .

would someone care to explain to me wat's worng? thank you in advance .

here is my solution to the problem

and here is another solution with double array instead of vector and it gives me SIGSEGV .


Viewing all articles
Browse latest Browse all 40121

Trending Articles



<script src="https://jsc.adskeeper.com/r/s/rssing.com.1596347.js" async> </script>