There is time constraint. I was hoping some standard algorithm can be used.
On Fri, Dec 16, 2011 at 12:34 PM, rahul raghavendra <[email protected]>wrote: > I would go for a theta(N ^2) solution ... > any time constraints ? > > On Fri, Dec 16, 2011 at 12:16 PM, vivek dhiman <[email protected]>wrote: > >> Hi all >> >> Can you suggest what algorithm can be used for such a problem. >> >> There are voids formed using blocks as shown in example file attached... >> >> I want to find out the volume of voids... >> >> >> What algorithm you guys suggest ? >> >> Thanks >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Google Code Jam" group. >> To post to this group, send email to [email protected]. >> To unsubscribe from this group, send email to >> [email protected]. >> For more options, visit this group at >> http://groups.google.com/group/google-code?hl=en. >> > > > > -- > * > K.Rahul :) > VII Semester > Information Science > PESIT , Bangalore > > * > > -- > You received this message because you are subscribed to the Google Groups > "Google Code Jam" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/google-code?hl=en. > -- Regards Vivek Dhiman -- You received this message because you are subscribed to the Google Groups "Google Code Jam" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/google-code?hl=en.
