Kattis/a1paper.java at master · PedroContipelli/Kattis · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
import java.util.Scanner;
public class a1paper {

public static boolean possible(int[] nums , int pow2) {
	int sum = 0;
	int high = pow2;

	for (int i = 0; i < nums.length; i++)
		{
		pow2 /= 2;
		sum += pow2 * nums[i];

		if (sum >= high)
			return true;
		}

	return false;
}

public static void main(String[] args) {
Scanner scan = new Scanner(System.in);

int Asize = scan.nextInt() - 1;
int pow2 = (int)Math.pow(2, Asize);

int[] paper = new int[Asize];

for (int i = 0; i < paper.length; i++)
	paper[i] = scan.nextInt();

if (possible(paper , pow2))
	{
	int sum = 0;
	int high = pow2;
	int index = 0;

	for (int i = 0; i < paper.length; i++)
		{
		pow2 /= 2;
		sum += pow2 * paper[i];

		if (sum >= high)
			{
			index = i;
			int sub = sum - high;
			paper[index] -= sub;
			break;
			}
		}

	int[] a = new int[index + 1];

	for (int i = 0; i < index + 1; i++)
		a[i] = paper[i];

	double length = 0;
	double constant = Math.pow(2 , -((2 * index + 3.0) / 4));
	double root2 = Math.sqrt(2);

	for (int i = index; i >= 0; i--)
		{
		length += (a[i] / 2) * constant;

		if (i == 0)
			break;

		a[i - 1] += a[i] / 2;
		constant *= root2;
		}

	System.out.printf("%.6f" , length);
	}
else
	System.out.println("impossible");

scan.close();
	}
}