Page 1 of 1

Posted: Fri Jan 11, 2002 2:44 pm
by cyfra
Does anyone have any test cases....

Should I use real or double .....

Because I always have WA :sad:

Please help...

Posted: Wed Mar 27, 2002 4:54 pm
by srbga
I am the problem setter
you may send me your code
so that i can check it for u

Not so nice milk

Posted: Fri Oct 04, 2002 5:25 pm
by Yarin
I've done _many_ submissions on this one now, always WA. I do a BFS on the polygon (together with which edges have been dipped already), "shrinking" one edge being a move. I am certain the polygon clipping routine works, it's been tested a lot. So are there any other things I'm missing? Some strange test case etc.


Posted: Sat Feb 12, 2005 5:25 pm
by Moha
I have a problem with this.
i use a backtrack approach but i got WA in 1.5 s can anybody send some I/O?
this is my code:

Code: Select all

I got Accepted ;)

10117 - Nice Milk

Posted: Fri Jun 01, 2007 6:35 pm
by adelar
Hi people,
was with error the name of post previous and it was blocked :roll:
I'm trying to solve the problem 10117... something know how I can do paralel lines with a segment with a constant value of distance (h)?

thanks in advance


Posted: Mon Oct 08, 2012 12:24 am
by darkloz
After several WA I don't know what is wrong in my algorithm I just do all possible cuts (the cutting algorithm has been tested in other problems) and compute the minimum remaining area, then the answer is the original area minus the minimum remaining area, is the algorithm wrong? does somebody have special test cases for this problem ?

Thanks in advance.

Re: 10117 - Nice Milk

Posted: Thu May 19, 2016 5:48 pm
by pointless0
This worked for me: assume the judge input contains concave polygons.

Concave polygon input:

Code: Select all

4 3 2
0 0
5 1
10 0
5 10

0 0 0
AC-ish output:

Code: Select all

Whether or not the judge input actually contains concave polygons I do not know.