Submit | All submissions | Best solutions | Back to list |
ACANVAS - A Canvas Building |
Original statement in spanish at http://www.dc.uba.ar/events/icpc/download/problems/taip2011-problems.pdf
The International Canvas Preparation Committee (ICPC) has a peculiar procedure for setting up its canvases. The procedure depends on a bidimensional view of the canvases.
A given canvas is set up using N poles of different heights. To set up the canvases, the ICPC uses the following procedure. First, N+2 points are marked on the floor, all on the same line, so that two consecutive points are always separated by a distance of exactly two feet. Afterwards, a pole is placed vertically over each of the N central points. Finally, the canvas is extended over the poles, joining the upper end of each pole with the upper end of neighboring poles. The first and last poles are joined with the free points on the floor.
The next figure shows 3 possible ways of setting up a canvas using the instructions mentioned before, with pole heights of 4, 5, 7, 8 and 9.
After years of hard work, the ICPC came to the conclusion that in order to obtain useful and sturdy canvases, it is necessary that the angle formed by two consecutive patches of canvas at the end of a pole, measured towards the inside, is strictly less than 180 degrees. In the figure shown, only the canvas on the left satisfies this condition. The canvas in the middle has an angle greater than 180 degrees at poles of heights 4 and 7, while the canvas on the right has an angle of exactly 180 degrees at the pole of height 8. We say a canvas is valid when it adheres to the ICPC recommendation.
Of course, given the number of poles and their heights, there are a lot of different ways of placing them, some of which will produce valid canvases and some of which will not. The task at hand is to, given this data, count the number of different valid canvases which can be set up. Two valid canvases are considered different if the sequence of heights of the poles in one of them, read from left to right, is different from the sequence of heights of the other one, read in the same way.
Input
The input contains several test cases. Each test case is described on two consecutive lines. The first line contains one integer N which indicates the number of poles (1 <= N <= 60). The second line contains N integers H_i representing the heights of the poles in feet (1 <= H_i <= 109 for 1 <= i <= N). The last line of the input contains a single -1 and should not be processed as a test case.
Output
For each test case output a single line with an integer representing the number of different valid canvases which can be set up using the given poles.
Example
Input:
5 4 5 7 8 9 7 33 65 57 64 63 61 49 1 1000000000 3 2 2 3 3 1 3 1 4 2 2 2 2 -1
Output:
2 16 1 1 0 0
Added by: | Pablo Ariel Heiber |
Date: | 2011-10-04 |
Time limit: | 1.315s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ASM64 |
Resource: | Argentinian Programming Tournament 2011 |
hide comments
2016-08-24 15:13:52 Rishav Goyal
@Igor: N^3 possible |
|
2013-06-25 00:06:13 Igor
Actually, is O(N^4) good enough? |