It looks like that JUDGE for this problem generate "Output Limit Exceded" or limit for Output too small.
judge is incomplete (flag testable shouldn't be marked),really sorry.
it will be completed soon...
Could you detail the scoring of the examples ? Here is what I get:
Total score: 3.28...
Btw, what happens if the target polygon shares an edge with the initial polygon ? No cut is needed, but we are required to output a permutation of n, so how is this cut scored ? length of the edge ?
Sorry about the delay.
Fixed, thank you .
Such a situation will never occur in the test data (the problem text has been apropriately ammended to clarify this).
thanks, fixed (I've missed the change of order 3 2 1 -> 1 2 3, so the difference in the score),
now, I've added the third case to clearify the problem of minimization.
I think there's a mistake in the first test case. The second polygon is not in clockwise order1 02 11 20 1
Thank you, I've fixed it. The problem will be ready for solving on Tuesday, March 29.
Thanks for sharing.