forked from MiYazJE/Acepta-el-reto
-
Notifications
You must be signed in to change notification settings - Fork 0
/
p209.java
58 lines (42 loc) · 1.58 KB
/
p209.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
import java.util.Scanner;
import java.util.TreeSet;
/**
* @author Rubén Saiz
*/
public class p209 {
public static void main(String[] args) {
final Scanner s = new Scanner(System.in);
int consultas, n;
String tunel;
TreeSet<Integer> telefonos = new TreeSet<>();
while (s.hasNext()) {
tunel = s.nextLine();
for (int i = 0; i < tunel.length(); i++)
if (tunel.charAt(i) == 'T') telefonos.add(i + 1);
consultas = s.nextInt();
for (int i = 0; i < consultas; i++) {
n = s.nextInt();
if (telefonos.contains(n)) {
System.out.println("AQUI");
}
else {
Integer leftCost = telefonos.lower(n);
if (leftCost == null) leftCost = n;
else leftCost = n - leftCost;
Integer rightCost = telefonos.higher(n);
if (rightCost == null) rightCost = tunel.length() - n + 1;
else rightCost -= n;
if (leftCost < rightCost) System.out.println("PENINSULA");
else if (rightCost < leftCost) System.out.println("ISLAS");
else {
int right = tunel.length() - n + 1;
if (n <= right) System.out.println("PENINSULA");
else System.out.println("ISLAS");
}
}
}
if (s.hasNext()) s.nextLine();
telefonos.clear();
}
}
}