-
Notifications
You must be signed in to change notification settings - Fork 22
/
aliens.java
241 lines (210 loc) · 6.45 KB
/
aliens.java
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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
import java.io.*;
import java.util.*;
public class aliens
{
private static Reader in;
private static PrintWriter out;
public static final int bound = 10000;
public static final double EPSILON = -0.000001;
public static void main(String[] args) throws IOException {
in = new Reader();
out = new PrintWriter(System.out, true);
int t = in.nextInt();
Point[] points;
int n, i;
double xPos, yPos, minRd, dist;
while(t-->0)
{
n=in.nextInt();
points = new Point[n];
for(i = 0; i < n; i++)
points[i] = new Point(in.nextDouble(), in.nextDouble());
points = convexHull(points, n);
xPos=yPos=0;
for(Point p : points){
out.printf("%.1f %.1f\n",p.x,p.y);
xPos += p.x / (double)points.length;
yPos += p.y / (double)points.length;
}
minRd = 0;
for(Point p : points){
dist = Math.sqrt( (xPos-p.x)*(xPos-p.x) + (yPos-p.y)*(yPos-p.y) );
if(dist > minRd) minRd = dist;
}
out.printf("%.2f\n%.2f %.2f\n",minRd,xPos,yPos);
}
System.exit(0);
}
private static Point[] convexHull(Point[] p, int numPoints)
{
int i;
Point m = new Point(0,0);
for(i = 0; i < numPoints; i++)
{
m.x += p[i].x/numPoints;
m.y += p[i].y/numPoints;
}
for(i = 0; i < numPoints; i++)
p[i].angle = Math.atan2(p[i].y-m.y,p[i].x-m.x);
Arrays.sort(p);
Point[] hull = new Point[numPoints];
hull[0] = p[0];
hull[1] = p[1];
int hullPos = 2;
for(i = 2; i < numPoints-1; i++)
{
while(hullPos > 1 && cross_1(hull[hullPos-2], hull[hullPos-1], p[i]) < EPSILON) hullPos--;
hull[hullPos++] = p[i];
}
// add last point
Point p2 = p[numPoints-1];
while(hullPos > 1 && cross_1(hull[hullPos-2], hull[hullPos-1], p2) < EPSILON) hullPos--;
int hullStart = 0;
boolean flag = false;
do
{
flag = false;
if(hullPos - hullStart >= 2 && cross_2(p2, hull[hullPos-1], hull[hullStart]) < EPSILON)
{
p2 = hull[--hullPos];
flag = true;
}
if(hullPos - hullStart >= 2 && cross_2(hull[hullStart+1], hull[hullStart], p2) < EPSILON)
{
hullStart++;
flag = true;
}
}while(flag);
hull[hullPos++] = p2;
Point[] cleanHull = new Point[hullPos-hullStart];
for(i = hullStart; i < hullPos; i++)
cleanHull[i-hullStart] = hull[i];
return cleanHull;
}
private static double zCrossProduct(Point a, Point b)
{
return a.x*b.y - a.y*b.x;
}
private static double cross_1(Point a, Point b, Point c)
{// vectors ab and bc
Point ab = new Point(a.x-b.x,a.y-b.y);
Point bc = new Point(b.x-c.x,b.y-c.y);
return zCrossProduct(ab, bc);
}
private static double cross_2(Point a, Point b, Point c)
{// vectors ab and ca
Point ab = new Point(a.x-b.x, a.y-b.y);
Point ca = new Point(c.x-a.x, c.y-a.y);
return zCrossProduct(ab, ca);
}
static class Point implements Comparable
{
public double x,y;
public double angle;
public Point(double x, double y)
{
this.x = x; this.y = y;
angle = 0;
}
public int compareTo(Object other)
{
if((angle - ((Point)other).angle) < 0.000001)
return -1;
if((angle - ((Point)other).angle) > 0.000001)
return 1;
return 0;
}
}
}
/** Faster input **/
class Reader
{
final private int BUFFER_SIZE = 1 << 16;
private DataInputStream din;
private byte[] buffer;
private int bufferPointer, bytesRead;
public Reader()
{
din = new DataInputStream(System.in);
buffer = new byte[BUFFER_SIZE];
bufferPointer = bytesRead = 0;
}
public Reader(String file_name) throws IOException
{
din = new DataInputStream(new FileInputStream(file_name));
buffer = new byte[BUFFER_SIZE];
bufferPointer = bytesRead = 0;
}
public String readLine() throws IOException
{
byte[] buf = new byte[64]; // line length
int cnt = 0, c;
while( (c=read()) != -1) {
buf[cnt++] = (byte)c;
if(c == '\n') break;
}
return new String(buf,0,cnt);
}
public int nextInt() throws IOException
{
int ret = 0;
byte c = read();
while (c <= ' ') c = read();
boolean neg = c == '-';
if (neg) c = read();
do {
ret = ret * 10 + c - '0';
c = read();
} while (c >= '0' && c <= '9');
if (neg) return -ret;
return ret;
}
public long nextLong() throws IOException
{
long ret = 0;
byte c = read();
while (c <= ' ') c = read();
boolean neg = c == '-';
if (neg) c = read();
do {
ret = ret * 10 + c - '0';
c = read();
} while (c >= '0' && c <= '9');
if (neg) return -ret;
return ret;
}
public double nextDouble() throws IOException
{
double ret = 0, div = 1;
byte c = read();
while(c <= ' ') c = read();
boolean neg = c == '-';
if(neg) c = read();
do {
ret = ret * 10 + c - '0';
c = read();
} while (c >= '0' && c <= '9');
if(c == '.')
while((c=read()) >= '0' && c <= '9') {
div *= 10;
ret = ret + (c - '0') / div;
}
if (neg) return -ret;
return ret;
}
private void fillBuffer() throws IOException
{
bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
if (bytesRead == -1) buffer[0] = -1;
}
private byte read() throws IOException
{
if (bufferPointer == bytesRead) fillBuffer();
return buffer[bufferPointer++];
}
public void close() throws IOException
{
if(din == null) return;
din.close();
}
}