結果
| 問題 | No.367 ナイトの転身 |
| ユーザー |
 ぴろず
|
| 提出日時 | 2016-04-29 22:49:06 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 656 ms / 2,000 ms |
| コード長 | 6,036 bytes |
| コンパイル時間 | 2,478 ms |
| コンパイル使用メモリ | 80,060 KB |
| 実行使用メモリ | 183,444 KB |
| 最終ジャッジ日時 | 2024-10-04 18:28:50 |
| 合計ジャッジ時間 | 7,025 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 27 |
ソースコード
package no367;import java.io.IOException;import java.io.InputStream;import java.io.PrintWriter;import java.util.ArrayDeque;import java.util.ArrayList;import java.util.Arrays;import java.util.InputMismatchException;import java.util.NoSuchElementException;public class Main {static int[][] dr = {{-1,-2,-2,-1,1,2,2,1},{-1,-1,1,1}};static int[][] dc = {{2,1,-1,-2,-2,-1,1,2},{1,-1,-1,1}};public static void main(String[] args) {IO io = new IO();int h = io.nextInt();int w = io.nextInt();char[][] m = io.nextCharMap(h, w);int si=-1,sj=-1,gi=-1,gj=-1;for(int i=0;i<h;i++) {for(int j=0;j<w;j++) {if (m[i][j] == 'S') {si = i;sj = j;}else if(m[i][j] == 'G') {gi = i;gj = j;}}}Graph g = new Graph(h * w * 2);for(int i=0;i<h;i++) {for(int j=0;j<w;j++) {for(int k=0;k<2;k++) {int cs = encode(h,w,i,j,k);for(int dir=0;dir<dr[k].length;dir++) {int ni = i + dr[k][dir];int nj = j + dc[k][dir];if (ni < 0 || ni >= h || nj < 0 || nj >= w) {continue;}int nk = k ^ (m[ni][nj] == 'R' ? 1 : 0);g.addEdge(cs, encode(h,w,ni,nj,nk), 1);}}}}int[] dist = g.minDistQueue(encode(h,w,si,sj,0));int ans = Math.min(dist[encode(h,w,gi,gj,0)], dist[encode(h,w,gi,gj,1)]);if (ans >= Graph.INF) {System.out.println(-1);}else{System.out.println(ans);}}static int encode(int h,int w,int i,int j,int k) {return h * w * k + w * i + j;}}class Graph {public static final int INF = 1<<29;int n;ArrayList<Edge>[] graph;@SuppressWarnings("unchecked")public Graph(int n) {this.n = n;this.graph = new ArrayList[n];for(int i=0;i<n;i++) {graph[i] = new ArrayList<Edge>();}}public void addBidirectionalEdge(int from,int to,int cost) {addEdge(from,to,cost);addEdge(to,from,cost);}public void addEdge(int from,int to,int cost) {graph[from].add(new Edge(to, cost));}//O(E) all cost is 0 or 1public int[] minDistQueue(int s) {int[] d = new int[n];Arrays.fill(d, INF);ArrayDeque<Integer> q = new ArrayDeque<Integer>();q.add(s);d[s] = 0;while(!q.isEmpty()) {int v = q.pollFirst();for(Edge e:graph[v]) {int u = e.to;if (d[v] + e.cost < d[u]) {d[u] = d[v] + e.cost;if (e.cost == 0) {q.addFirst(u);}else{q.addLast(u);}}}}return d;}class Edge {int to;int cost;public Edge(int to,int cost) {this.to = to;this.cost = cost;}}}class IO extends PrintWriter {private final InputStream in;private final byte[] buffer = new byte[1024];private int ptr = 0;private int buflen = 0;public IO() { this(System.in);}public IO(InputStream source) { super(System.out); this.in = source;}private boolean hasNextByte() {if (ptr < buflen) {return true;}else{ptr = 0;try {buflen = in.read(buffer);} catch (IOException e) {e.printStackTrace();}if (buflen <= 0) {return false;}}return true;}private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}private static boolean isNewLine(int c) { return c == '\n' || c == '\r';}public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}public boolean hasNextLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++; return hasNextByte();}public String next() {if (!hasNext()) {throw new NoSuchElementException();}StringBuilder sb = new StringBuilder();int b = readByte();while(isPrintableChar(b)) {sb.appendCodePoint(b);b = readByte();}return sb.toString();}public char[] nextCharArray(int len) {if (!hasNext()) {throw new NoSuchElementException();}char[] s = new char[len];int i = 0;int b = readByte();while(isPrintableChar(b)) {if (i == len) {throw new InputMismatchException();}s[i++] = (char) b;b = readByte();}return s;}public String nextLine() {if (!hasNextLine()) {throw new NoSuchElementException();}StringBuilder sb = new StringBuilder();int b = readByte();while(!isNewLine(b)) {sb.appendCodePoint(b);b = readByte();}return sb.toString();}public long nextLong() {if (!hasNext()) {throw new NoSuchElementException();}long n = 0;boolean minus = false;int b = readByte();if (b == '-') {minus = true;b = readByte();}if (b < '0' || '9' < b) {throw new NumberFormatException();}while(true){if ('0' <= b && b <= '9') {n *= 10;n += b - '0';}else if(b == -1 || !isPrintableChar(b)){return minus ? -n : n;}else{throw new NumberFormatException();}b = readByte();}}public int nextInt() {long nl = nextLong();if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {throw new NumberFormatException();}return (int) nl;}public char nextChar() {if (!hasNext()) {throw new NoSuchElementException();}return (char) readByte();}public double nextDouble() { return Double.parseDouble(next());}public int[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}public long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}public double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}public void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;}public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}public void close() { super.close(); try {in.close();} catch (IOException e) {}}}