Search found 3 matches

by Marcgal
Tue Sep 29, 2015 1:23 am
Forum: Volume 1 (100-199)
Topic: 115 - Climbing Trees
Replies: 30
Views: 11262

Re: 115 - Climbing Trees

OK, so now my small contribution to anyone who struggles with WA in this problem. Contrary to what many people have claimed here, there are no nodes with more than one parent in the input. This has been confirmed with the following code . This input is, therefore, invalid : A B A C no.child no.paren...
by Marcgal
Fri Jul 10, 2015 11:32 am
Forum: Volume 1 (100-199)
Topic: 102 - Ecological Bin Packing
Replies: 485
Views: 49720

Re: 102 - Ecological Bin Packing

You got two problems here. First and foremost, you count the values of your total[] table as if G was before C in the alphabet. In addition to this, you also have a typo in your switch. Correct the order of the values of your total[] table, modify your switch accordingly and double-check it for typo...
by Marcgal
Tue Jul 02, 2013 6:37 pm
Forum: Volume 1 (100-199)
Topic: 107 - The Cat in the Hat
Replies: 278
Views: 20532

Re: WA in 107

@kbr_iut, my AC code for ur input gives this: Input: 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 1 10 1 0 0 Ouptut 1 3 2 5 2 7 SIGXCPU To me, ouptut 1 4 for input 3 1 makes no sense (as well as any other output)! First, the smallest cat must always be at height 1, which is clearly stated. Only one not working cat...

Go to advanced search