/
BOJ_27988.java
74 lines (60 loc) · 1.93 KB
/
BOJ_27988.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
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Main {
static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
public static void main(String[] args) throws Exception {
new Main().solution();
}
private void solution() throws Exception {
int n = Integer.parseInt(br.readLine());
Ribbon[] arr = new Ribbon[n];
for (int i = 0; i < n; i++) arr[i] = new Ribbon(i+1);
StringTokenizer st = new StringTokenizer(br.readLine());
for (int i = 0; i < n; i++) arr[i].s = Integer.parseInt(st.nextToken());
st = new StringTokenizer(br.readLine());
for (int i = 0; i < n; i++) arr[i].setup(Integer.parseInt(st.nextToken()));
st = new StringTokenizer(br.readLine());
for (int i = 0; i < n; i++) arr[i].color = st.nextToken().charAt(0);
Arrays.sort(arr);
char curColor = 0;
int lastNum = -1;
int lastE = Integer.MIN_VALUE;
for (Ribbon cur : arr) {
if (cur.s > lastE) {
curColor = cur.color;
lastNum = cur.num;
lastE = cur.e;
continue;
}
if (cur.color != curColor) {
System.out.printf("YES\n%d %d\n", lastNum, cur.num);
return;
}
if (cur.e > lastE) {
lastE = cur.e;
lastNum = cur.num;
}
}
System.out.println("NO");
}
}
class Ribbon implements Comparable<Ribbon> {
int s, e, num;
char color;
public Ribbon(int num) {
this.num = num;
}
public void setup(int len) {
int tmp = s;
s = tmp-len;
e = tmp+len;
}
@Override
public int compareTo(final Ribbon o) {
if (this.s == o.s)
return this.e-o.e;
return this.s-o.s;
}
}