-
Notifications
You must be signed in to change notification settings - Fork 0
/
RoadsAndJunctionsVisForScoring.java
417 lines (394 loc) · 15.9 KB
/
RoadsAndJunctionsVisForScoring.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
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
import java.awt.*;
import java.awt.image.*;
import java.io.*;
import java.security.*;
import java.util.*;
import javax.imageio.*;
// --------------------------------------------------------
class Pnt {
public int x,y;
public Pnt() {};
public Pnt(int x1, int y1) {
x = x1;
y = y1;
}
public boolean equals(Pnt other) {
return (x == other.x && y == other.y);
}
public int dist2(Pnt other) {
return (x-other.x)*(x-other.x) + (y-other.y)*(y-other.y);
}
public String toString() {
return "(" + x + "," + y + ")";
}
}
public class RoadsAndJunctionsVisForScoring {
static int minS = 100, maxS = 1000;
static int minNC = 10, maxNC = 100;
static double minJC = 0, maxJC = 10;
static double minFailProb = 0, maxFailProb = 0.4;
int S; // size of the area
double jCost; // cost of building a junction
double jFailProb; // probability of a junction construction failing
int NC; // number of cities
Pnt[] cities; // coordinates of cities
int NJ; // number of junctions
Pnt[] junct; // coordinates of newly built junctions
HashSet<Integer> cUsed; // coordinates of cities and junctions as a set
int[] junctOk; // indicates whether the junction has been built successfully and can be used
Pnt[] vertices; // cities and junctions stored together
SecureRandom rnd;
int NR; // number of roads built
int[] roadS, roadE; // start and end cities/junctions of newly built roads
// -----------------------------------------
boolean isInside(int x, int y) {
return (x >= 0 && x <= S && x >= 0 && x <= S);
}
int cityToInt(Pnt p) {
return p.x * (S+1) + p.y;
}
int roadToInt(int start, int end) {
return start * (NC + NJ) + end;
}
// -----------------------------------------
String generate(String seedStr) {
try {
// generate test case
rnd = SecureRandom.getInstance("SHA1PRNG");
long seed = Long.parseLong(seedStr);
rnd.setSeed(seed);
S = rnd.nextInt(maxS - minS + 1) + minS;
NC = rnd.nextInt(maxNC - minNC + 1) + minNC;
jCost = rnd.nextDouble() * (maxJC - minJC) + minJC;
jFailProb = rnd.nextDouble() * (maxFailProb - minFailProb) + minFailProb;
// seed = [1, 16] is a special case.
if (1 <= seed && seed <= 16) {
S = ((seed % 2) == 0) ? minS : maxS;
NC = (((seed / 2) % 2) == 0) ? minNC : maxNC;
jCost = (((seed / 4) % 2) == 0) ? minJC : maxJC;
jFailProb = (((seed / 8) % 2) == 0) ? minFailProb : maxFailProb;
}
// generate the cities' coordinates (all distinct)
cities = new Pnt[NC];
cUsed = new HashSet<>();
for (int i = 0; i < NC; ++i) {
while (true) {
cities[i] = new Pnt(rnd.nextInt(S + 1), rnd.nextInt(S + 1));
Integer point = new Integer(cityToInt(cities[i]));
if (cUsed.contains(point))
continue;
cUsed.add(point);
break;
}
}
StringBuffer sb = new StringBuffer();
sb.append("S = ").append(S).append('\n');
sb.append("Number of cities = ").append(NC).append('\n');
sb.append("Junction cost = ").append(jCost).append('\n');
sb.append("Probability of junction construction failure = ").append(jFailProb).append('\n');
sb.append("Cities:\n");
for (int i = 0; i < NC; ++i)
sb.append(cities[i] + " ");
sb.append('\n');
return sb.toString();
}
catch (Exception e) {
addFatalError("An exception occurred while generating test case.");
e.printStackTrace();
return "";
}
}
// -----------------------------------------
public double runTest(String seed) {
try {
String test = generate(seed);
if (debug)
System.out.println(test);
if (proc != null) {
// call the solution
int[] citiesArg = new int[2 * NC];
for (int i = 0; i < NC; ++i) {
citiesArg[2*i] = cities[i].x;
citiesArg[2*i+1] = cities[i].y;
}
// first build the junctions
int[] junctionsRet;
try {
junctionsRet = buildJunctions(S, citiesArg, jCost, jFailProb);
} catch (Exception e) {
addFatalError("Failed to get result from buildJunctions.");
return -1.0;
}
// check the return and convert it to junctions
if (junctionsRet == null) {
addFatalError("Your return from buildJunctions contained invalid number of elements.");
return -1.0;
}
if (junctionsRet.length % 2 == 1) {
addFatalError("Your return from buildJunctions contained odd number of elements.");
return -1.0;
}
NJ = junctionsRet.length / 2;
if (NJ > 2 * NC) {
addFatalError("You can build at most " + 2 * NC + " new junctions.");
return -1.0;
}
junct = new Pnt[NJ];
for (int i = 0; i < NJ; ++i) {
if (!isInside(junctionsRet[2*i], junctionsRet[2*i+1])) {
addFatalError("You can only build junctions inside the area.");
return -1.0;
}
junct[i] = new Pnt(junctionsRet[2*i], junctionsRet[2*i+1]);
Integer point = new Integer(cityToInt(junct[i]));
if (cUsed.contains(point)) {
addFatalError("You can only build junctions on places not occupied by cities or other junctions.");
return -1.0;
}
cUsed.add(point);
}
// decide which junctions are functional and which are not
junctOk = new int[NJ];
for (int i = 0; i < NJ; ++i)
junctOk[i] = (rnd.nextDouble() >= jFailProb) ? 1 : 0;
// next build the roads (passing information about junctions to the method)
int[] roadsRet;
try {
roadsRet = buildRoads(junctOk);
} catch (Exception e) {
addFatalError("Failed to get result from buildRoads.");
return -1.0;
}
// check the return and convert it to junctions
if (roadsRet == null) {
addFatalError("Your return from buildRoads contained invalid number of elements.");
return -1.0;
}
if (roadsRet.length % 2 == 1) {
addFatalError("Your return from buildRoads contained odd number of elements.");
return -1.0;
}
NR = roadsRet.length / 2;
int maxR = (NC + NJ) * (NC + NJ - 1) / 2;
if (NR > maxR) {
addFatalError("You can build at most " + maxR + " roads.");
return -1.0;
}
HashSet<Integer> rUsed = new HashSet<>();
roadS = new int[NR];
roadE = new int[NR];
for (int i = 0; i < NR; ++i) {
if (roadsRet[2*i] < 0 || roadsRet[2*i] >= NC + NJ ||
roadsRet[2*i+1] < 0 || roadsRet[2*i+1] >= NC + NJ) {
addFatalError("You can only build roads between pairs of existing cities/junctions.");
return -1.0;
}
if (roadsRet[2*i] == roadsRet[2*i+1]) {
addFatalError("You can only build roads between distinct points.");
return -1.0;
}
if (roadsRet[2*i] >= NC && junctOk[roadsRet[2*i] - NC] == 0 ||
roadsRet[2*i+1] >= NC && junctOk[roadsRet[2*i+1] - NC] == 0) {
addFatalError("You can not build a road to a dysfunctional junction.");
return -1.0;
}
roadS[i] = Math.min(roadsRet[2*i], roadsRet[2*i+1]);
roadE[i] = Math.max(roadsRet[2*i], roadsRet[2*i+1]);
Integer road = new Integer(roadToInt(roadS[i], roadE[i]));
if (rUsed.contains(road)) {
addFatalError("You can only build one road between each pair of points. " + roadS[i] + " -> " + roadE[i]);
return -1.0;
}
rUsed.add(road);
}
} else {
// build no roads and no junctions
NJ = NR = 0;
junct = new Pnt[NJ];
roadS = new int[NR];
roadE = new int[NR];
}
// create a structure to handle cities and junctions uniformly
vertices = new Pnt[NC + NJ];
for (int i = 0; i < NC; ++i)
vertices[i] = cities[i];
for (int i = 0; i < NJ; ++i)
vertices[NC + i] = junct[i];
if (vis) {
// draw the results of program execution (even with invalid score)
draw();
}
// check that all cities and all functional junctions are connected by the roads
java.util.List<ArrayList<Integer>> adj = new ArrayList<ArrayList<Integer>>(NC + NJ);
for (int i = 0; i < NC + NJ; ++i)
adj.add(new ArrayList<Integer>());
for (int i = 0; i < NR; ++i) {
adj.get(roadS[i]).add(roadE[i]);
adj.get(roadE[i]).add(roadS[i]);
}
boolean[] used = new boolean[NC + NJ];
ArrayList<Integer> next = new ArrayList<Integer>();
next.add(0);
while (!next.isEmpty()) {
int vertexInd = next.get(0);
next.remove(0);
for (int i = 0; i < adj.get(vertexInd).size(); ++i) {
int adjInd = adj.get(vertexInd).get(i);
if (!used[adjInd]) {
used[adjInd] = true;
next.add(adjInd);
}
}
}
for (int i = 0; i < NC + NJ; ++i)
if (!used[i] && (i < NC || i >= NC && junctOk[i - NC] == 1)) {
addFatalError((i < NC ? ("City " + i) : ("Junction " + (i - NC)) ) + " not connected to the rest of the network.");
return -1.0;
}
// score is a function of total length of the roads
// and the number of junctions built
double totalRoadLength = 0;
for (int i = 0; i < NR; ++i)
totalRoadLength += Math.sqrt(vertices[roadS[i]].dist2(vertices[roadE[i]]));
if (debug) {
addFatalError("Number of junctions built: " + NJ);
addFatalError("Total length of roads built: " + totalRoadLength);
}
return totalRoadLength + jCost * NJ;
}
catch (Exception e) {
addFatalError("An exception occurred while trying to get your program's results.");
e.printStackTrace();
return -1.0;
}
}
// ------------- visualization part ------------
static String exec, fileName;
static boolean vis, debug;
static Process proc;
InputStream is;
OutputStream os;
BufferedReader br;
// -----------------------------------------
int[] buildJunctions(int S, int[] cities, double junctionCost, double failProb) throws IOException {
StringBuffer sb = new StringBuffer();
sb.append(S).append("\n");
sb.append(cities.length).append("\n");
for (int i = 0; i < cities.length; ++i) {
sb.append(cities[i]).append("\n");
}
sb.append(junctionCost).append("\n");
sb.append(failProb).append("\n");
os.write(sb.toString().getBytes());
os.flush();
// and get the return value
int N = Integer.parseInt(br.readLine());
int[] ret = new int[N];
for (int i = 0; i < N; i++)
ret[i] = Integer.parseInt(br.readLine());
return ret;
}
// -----------------------------------------
int[] buildRoads(int[] junctionBuilt) throws IOException {
StringBuffer sb = new StringBuffer();
sb.append(junctionBuilt.length).append("\n");
for (int i = 0; i < junctionBuilt.length; ++i) {
sb.append(junctionBuilt[i]).append("\n");
}
os.write(sb.toString().getBytes());
os.flush();
// and get the return value
int N = Integer.parseInt(br.readLine());
int[] ret = new int[N];
for (int i = 0; i < N; i++)
ret[i] = Integer.parseInt(br.readLine());
return ret;
}
// -----------------------------------------
public void draw() {
int SZX = S + 1, SZY = SZX;
BufferedImage bi = new BufferedImage(SZX, SZY,BufferedImage.TYPE_INT_RGB);
Graphics2D g2 = (Graphics2D)bi.getGraphics();
// background
g2.setColor(Color.WHITE);
g2.fillRect(0, 0, SZX, SZY);
// roads
g2.setColor(Color.BLACK);
for (int i = 0; i < NR; ++i) {
g2.drawLine(vertices[roadS[i]].x, vertices[roadS[i]].y, vertices[roadE[i]].x, vertices[roadE[i]].y);
}
// cities and junctions as colored points
g2.setColor(Color.BLACK);
for (int i = 0; i < NC; ++i) {
g2.fillOval(cities[i].x - 3, cities[i].y - 3, 7, 7);
}
for (int i = 0; i < NJ; ++i) {
g2.setColor((junctOk[i] == 0 ? Color.RED : Color.GREEN));
g2.fillOval(junct[i].x - 2, junct[i].y - 2, 5, 5);
}
try {
ImageIO.write(bi,"png", new File(fileName + ".png"));
} catch (Exception e) { e.printStackTrace(); }
}
// -----------------------------------------
public RoadsAndJunctionsVisForScoring(String seed) {
try {
if (exec != null) {
try {
Runtime rt = Runtime.getRuntime();
proc = rt.exec(exec);
os = proc.getOutputStream();
is = proc.getInputStream();
br = new BufferedReader(new InputStreamReader(is));
new ErrorReader(proc.getErrorStream()).start();
} catch (Exception e) { e.printStackTrace(); }
}
System.out.println("seed " + seed + ": score = " + runTest(seed));
if (proc != null)
try { proc.destroy(); }
catch (Exception e) { e.printStackTrace(); }
}
catch (Exception e) { e.printStackTrace(); }
}
// -----------------------------------------
public static void main(String[] args) {
String seed = "1";
vis = true;
for (int i = 0; i<args.length; i++)
{ if (args[i].equals("-seed"))
seed = args[++i];
if (args[i].equals("-exec"))
exec = args[++i];
if (args[i].equals("-novis"))
vis = false;
if (args[i].equals("-debug"))
debug = true;
}
if (exec == null)
vis = true;
if (vis)
fileName = seed;
RoadsAndJunctionsVisForScoring f = new RoadsAndJunctionsVisForScoring(seed);
}
// -----------------------------------------
void addFatalError(String message) {
System.out.println(message);
}
}
class ErrorReader extends Thread{
InputStream error;
public ErrorReader(InputStream is) {
error = is;
}
public void run() {
try {
byte[] ch = new byte[50000];
int read;
while ((read = error.read(ch)) > 0)
{ String s = new String(ch,0,read);
System.out.print(s);
System.out.flush();
}
} catch(Exception e) { }
}
}