Maybe consider the worst case where N = 10, and all of them are not
pointing anywhere
*11060 20 40 50 60 20 40 50 60 200 0 0 0 0 0 0 0 0 0*
在2022年4月5日星期二 UTC-7 17:27:24 写道：
> Hello plesse send one test case where it is failing
>
>
When taking min, you should only consider the propagated fun value of the
direct child, not the accumulated sum.
You also need to increase the recursion depth to avoid runtime error.
See the accepted code below:
*import syssys.setrecursionlimit(20)memo =
After the round concluded, you can download the full test sets [and their
answers] if you switch to the analysis tab and scroll to the bottom. You
could run your solution against the real test cases locally and get the
corresponding detailed error message, even without checking the specific
test
Hello there!
The problem is I get a runtime error during the tests on site, thus no hint
is visible, even the testing samples are not known. I tried to reproduce
the error locally by making up some test cases but with no success.
środa, 6 kwietnia 2022 o 02:27:24 UTC+2 jawa napisał(a):
>
Hi Joe,
Thanks for the explanation, though I think it does not explain the issue
raised by Ricola. Yes, we need to guarantee that "rare" high degrees are
properly accounted for. I think that part of the official analysis is very
good.
What Ricola was asking is about the details of the
