-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path241215-16173.java
44 lines (39 loc) · 1.23 KB
/
241215-16173.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
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Main {
static int N;
static int[][] arr;
static boolean[][] visited;
static int[] dx = {0, 1};
static int[] dy = {1, 0};
public static void main(String[] args) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
N = Integer.parseInt(br.readLine());
arr = new int[N][N];
visited = new boolean[N][N];
for (int i = 0; i < N; i++) {
StringTokenizer st = new StringTokenizer(br.readLine());
for (int j = 0; j < N; j++) {
arr[i][j] = Integer.parseInt(st.nextToken());
}
}
dfs(0, 0);
System.out.println("Hing");
}
private static void dfs(int r, int c) {
if (arr[r][c] == -1) {
System.out.println("HaruHaru");
System.exit(0);
}
for (int i = 0; i < 2; i++) {
int x = r + dx[i] * arr[r][c];
int y = c + dy[i] * arr[r][c];
if (x >= N || y >= N || visited[x][y]) {
continue;
}
visited[x][y] = true;
dfs(x, y);
}
}
}