ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1681. Brother Bear's Garden

Test 12
Posted by Fyodor Menshikov 5 Mar 2009 02:48
n=7 k=3
fence has more than 2n angles
Re: Test 12
Posted by melkiy 6 Mar 2009 01:43
You are devilishly right!
I figured it out when i drew a polygon of shape far from regular.
But it incredibly complicates the solution :((
Re: Test 12
Posted by Sfairat 6 Mar 2009 02:02
Not really.If I understand your algo correctly,than it only needs to be improved a little.
Theoretically,my algo is O(n^3),but in tests my prog works less than 0,05 sec,because there're no such polygons,for which all the operations will be required.

Edited by author 06.03.2009 02:14