I think the priority should be given to the points where 3 of its neighbor has already been marked and only one neighbor is not marked.
Because in this case, you can increase the number of the enclosed point without using extra stones. — Sent from Mailbox for iPhone On Mon, May 12, 2014 at 3:11 AM, vivek dhiman <[email protected]> wrote: > M, N, K = 6, 6, 26 > ...**. > ..*..* > .*...* > *....* > .*...* > .****. > This is what I get. > I guess priority should be given to the point farthest from the boundary in > any case. > that is the problem. > -- > You received this message because you are subscribed to the Google Groups > "Google Code Jam" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to [email protected]. > To post to this group, send email to [email protected]. > To view this discussion on the web visit > https://groups.google.com/d/msgid/google-code/CABaJBvJWdE3rEDpUHbi_w7uacFLqz47b%2Buyo4_RdqZoEuzpAWg%40mail.gmail.com. > For more options, visit https://groups.google.com/d/optout. -- You received this message because you are subscribed to the Google Groups "Google Code Jam" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/google-code/1399835665229.97d39d3c%40Nodemailer. For more options, visit https://groups.google.com/d/optout.
