-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path15784.java
More file actions
70 lines (59 loc) · 1.57 KB
/
15784.java
File metadata and controls
70 lines (59 loc) · 1.57 KB
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
package algo;
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws IOException {
new Solution().run();
}
static class Solution {
private int N,R,C;
private int[][] map;
private BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
private StringTokenizer st = null;
private StringTokenizer getStringTokenizer() throws IOException {
return new StringTokenizer(br.readLine(), " ");
}
private void input() throws IOException {
st = getStringTokenizer();
N = Integer.parseInt(st.nextToken());
R = Integer.parseInt(st.nextToken());
C = Integer.parseInt(st.nextToken());
map = new int[N+1][N+1];
for(int i=1; i<=N; i++) {
st = getStringTokenizer();
for(int j=1; j<=N; j++) {
map[i][j] = Integer.parseInt(st.nextToken());
}
}
}
private void solution() throws IOException {
for(int i=1; i<=N; i++) {
if(map[R][i] > map[R][C]) {
System.out.println("ANGRY");
return;
}
}
for(int i=1; i<=N; i++) {
if(map[i][C] > map[R][C]) {
System.out.println("ANGRY");
return;
}
}
System.out.println("HAPPY");
}
public void run() throws IOException {
input();
solution();
close();
}
private void close() throws IOException {
bw.close();
br.close();
}
}
}