I was reading through http://langevin.univ-tln.fr/cours/PAA/extra/Tarjan-1972.pdf and saw the complexity of the biconnectivity algo. I know that the compleixity is O(V+E) for both, I was wondering what is the constant for the memory and time?

Hi,

If you're a beginner and would like to learn the concept of DSU, do take part in CodeMonk DSU! :D

Date: 15 July Time: 2100 HRS (IST)

Yes, there are HackerEarth merchandise to be won. So, come on and code on!

Here's the link: https://www.hackerearth.com/code-monk-disjoint-set-union/

Good luck!

Anyone can help solve problem problem GOODG? I can't figure out how to apply Convex Hull DP since the lines won't be added in sorted order.

Hello all,

Recently, I tried solving problem Cycling City.

I've been trying for hours to debug my code (below) to make it pass test #12 (as you can see from my submissions :P), but I can't seem to find the error. It'd be great if anyone could help me find the error; the code is quite well commented. The problem seems to be in either the "cyc" method or the articulation point detection, all of which is commented. Look particularly at the comments in the "solve" method; I outlined what I found while attempting to debug.

Actually, I think there's not much need to look at create and find methods, as I tested them by checking on a SPOJ problems. However, other commented methods could contain an error that I'm not sure of.

http://pastebin.com/xbnfPC9q

Thanks in advance, Alex_Gu