VMILI - Military Story
Military headquaters plan to develop a better protection for a spaceport. They suppose that the spaceport would be best protected if it is surrounded with as many fences as possible and each fence is patroled by armed guards. The corresponding order was issued and military engineers started to develop a project.
Wishing to be promoted, sergeant Stupid sent soldiers to dig in fence poles before the project was actually ready. Without much thinking, the soldiers put a lot of poles at random. Help the sergeant to decide how to make barbwire fences using the poles so that the number of fences is maximal.
The first line contains an integer 3 ≤ N ≤ 4000, which is the number of the poles. Each of the following N lines contains two integers 0 ≤ x, y ≤ 10000, which are the coordinates of a corresponding pole. No two poles have the same position.
The output should contain a single integer number, which is the maximal possible number of nested fences that can be constructed. Each fence is a closed polygonal line without self-crossing whose vertices are poles. Different fences should not have common points.
Input: 4 100 100 200 100 100 200 300 300 Output: 1
plz provide me any additional test case. I'm getting wrong answer
AC in first attempt, I thought I might get TLE, thanks for this problem though, I finally was able to implement this task :)
Does this not work with Python 2.7, I always get a time limit exceeded!
Can't understand if the Time Limit is 1s then how did my code get accepted in 1.71s. Is it because judge runs with more than one test case?
Note that when you have 2 poles left, you can't make a fence
Monkey D. Luffy :
@Phenomenal more test cases pleaseLast edit: 2013-03-20 10:43:44
can someone provide additional testcases
Note to others: "no common points" in this case means no common vertices. Situations where an internal vertex touches an external edge are permissible.