-
Notifications
You must be signed in to change notification settings - Fork 0
/
Main16948.java
77 lines (61 loc) · 1.71 KB
/
Main16948.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
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.LinkedList;
import java.util.Queue;
import java.util.StringTokenizer;
public class Main16948 {
public static void main(String[] args) throws NumberFormatException, IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int N = Integer.parseInt(br.readLine());
StringTokenizer st = new StringTokenizer(br.readLine());
int r1 = Integer.parseInt(st.nextToken());
int c1 = Integer.parseInt(st.nextToken());
int r2 = Integer.parseInt(st.nextToken());
int c2 = Integer.parseInt(st.nextToken());
System.out.println(bfs(r1,c1,r2,c2,N));
}
static int[] dx = { -2, -2, 0, 0, 2, 2 };
static int[] dy = { -1, 1, -2, 2, -1, 1 };
static int bfs(int r1,int c1,int r2,int c2,int N) {
if(r1==r2 && c1==c2) return 0;
int[][] map = new int[N][N];
boolean[][] visit = new boolean[N][N];
visit[r1][c1] = true;
Queue<Pos> q = new LinkedList<>();
q.offer(new Pos(r1,c1));
int time = 0;
boolean flag = false;
Label : while(!q.isEmpty()) {
int size = q.size();
time++;
for(int s=0;s<size;s++) {
Pos p = q.poll();
for(int i=0;i<6;i++) {
int nx = p.x+dx[i];
int ny = p.y+dy[i];
if(nx>=0 && nx<N && ny>=0 && ny<N && !visit[nx][ny]) {
if(r2 == nx && c2 == ny) {
flag = true;
break Label;
}
q.offer(new Pos(nx,ny));
visit[nx][ny] = true;
}
}
}
}
return flag?time:-1;
}
static class Pos{
int x, y;
public Pos(int x, int y) {
super();
this.x = x;
this.y = y;
}
}
}