-
Notifications
You must be signed in to change notification settings - Fork 0
/
MapUtils.java
192 lines (155 loc) · 3.77 KB
/
MapUtils.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
package team122;
import java.util.Arrays;
import battlecode.common.Direction;
import battlecode.common.MapLocation;
import battlecode.common.RobotController;
import battlecode.common.Team;
public class MapUtils {
/**
* Sorts the map locations in accending distance order
* @param locs
*/
public static void sort(MapLocation start, MapLocation[] locs, boolean ascending) {
int[] dists = new int[locs.length];
for (int i = 0, len = locs.length; i < len; i++) {
dists[i] = locs[i].distanceSquaredTo(start);
}
sort(locs, dists, ascending);
}
/**
* Sorts the map in accending order.
* @param locs
* @param dists
*/
public static void sort(MapLocation[] locs, int[] dists, boolean ascending) {
if (locs.length < 5) {
int currentDist;
MapLocation currentLoc;
if (ascending) {
//InsertionSort
for (int i = 1, j, len = locs.length; i < len; i++) {
currentDist = dists[i];
currentLoc = locs[i];
for (j = i; j > 0 && currentDist < dists[j - 1]; j--) {
locs[j] = locs[j - 1];
dists[j] = dists[j - 1];
}
dists[j] = currentDist;
locs[j] = currentLoc;
}
} else {
//InsertionSort
for (int i = 1, j, len = locs.length; i < len; i++) {
currentDist = dists[i];
currentLoc = locs[i];
for (j = i; j > 0 && currentDist > dists[j - 1]; j--) {
locs[j] = locs[j - 1];
dists[j] = dists[j - 1];
}
dists[j] = currentDist;
locs[j] = currentLoc;
}
}
} else {
if (ascending) {
//QuickSort
_quicksort(dists, locs, 0, locs.length - 1);
} else {
_quicksort_descend(dists, locs, 0, locs.length - 1);
}
}
}
/**
* The quicksort algorithm uses recursion, maybe we can make it
* into while loops.
*
* @param numbers
* @param low
* @param high
*/
private static void _quicksort(int[] locsDists, MapLocation[] locs, int low, int high) {
int i = low, j = high;
int pivot = locsDists[low + (high - low) / 2];
while (i <= j) {
while (locsDists[i] < pivot) {
i++;
}
while (locsDists[j] > pivot) {
j--;
}
if (i <= j) {
int temp = locsDists[i];
locsDists[i] = locsDists[j];
locsDists[j] = temp;
MapLocation t = locs[i];
locs[i] = locs[j];
locs[j] = t;
i++;
j--;
}
}
if (low < j) {
_quicksort(locsDists, locs, low, j);
}
if (i < high) {
_quicksort(locsDists, locs, i, high);
}
}
/**
* The quicksort algorithm uses recursion, maybe we can make it
* into while loops.
*
* @param numbers
* @param low
* @param high
*/
private static void _quicksort_descend(int[] locsDists, MapLocation[] locs, int low, int high) {
int i = low, j = high;
int pivot = locsDists[low + (high - low) / 2];
while (i <= j) {
while (locsDists[i] > pivot) {
i++;
}
while (locsDists[j] < pivot) {
j--;
}
if (i <= j) {
int temp = locsDists[i];
locsDists[i] = locsDists[j];
locsDists[j] = temp;
MapLocation t = locs[i];
locs[i] = locs[j];
locs[j] = t;
i++;
j--;
}
}
if (low < j) {
_quicksort_descend(locsDists, locs, low, j);
}
if (i < high) {
_quicksort_descend(locsDists, locs, i, high);
}
}
/**
* Attempts to move in the direction with defusion.
* @param rc
* @param dir
* @return
*/
public static final int canMove(RobotController rc, RobotInformation info, Direction dir) {
MapLocation loc = rc.getLocation();
if (rc.canMove(dir)) {
Team t = rc.senseMine(loc.add(dir));
if (t != null && t != info.myTeam) {
return MUST_DEFUSE;
}
return CAN_MOVE;
} else {
return CANT_MOVE;
}
}
public static final int CAN_MOVE = 0;
public static final int MUST_DEFUSE = 1;
public static final int CANT_MOVE = 2;
}