It looks like that JUDGE for this problem generate "Output Limit Exceded" or limit for Output too small.
created
Mar '05last reply
Nov '13- 7
replies
- 1.6k
views
- 6
users
Could you detail the scoring of the examples ? Here is what I get:
- case 1: initial perimeter is 8 and there are 4 cuts of length sqrt(2) each, that is score = 8/(4*sqrt(2))
- case 2: initial perimeter is 12, first cut along side 1 has length 3, second length along side 2 has length 2, and the last cut has length sqrt(2). Score = 12/(5+sqrt(2))
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.
11 days later
I think there's a mistake in the first test case. The second polygon is not in clockwise order
1 0
2 1
1 2
0 1
8 years later
