結果
問題 | No.340 雪の足跡 |
ユーザー |
|
提出日時 | 2016-01-29 22:34:03 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 430 ms / 1,000 ms |
コード長 | 4,108 bytes |
コンパイル時間 | 3,895 ms |
コンパイル使用メモリ | 88,580 KB |
実行使用メモリ | 83,152 KB |
最終ジャッジ日時 | 2024-09-21 18:18:47 |
合計ジャッジ時間 | 12,380 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 5 |
other | AC * 32 |
ソースコード
package contest;import java.io.ByteArrayInputStream;import java.io.IOException;import java.io.InputStream;import java.io.PrintWriter;import java.util.ArrayDeque;import java.util.Arrays;import java.util.InputMismatchException;import java.util.Queue;public class Q932 {InputStream is;PrintWriter out;String INPUT = "";void solve(){int m = ni(), n = ni(), Q = ni();int[][] map = new int[2*n+3][2*m+3];for(int i = 0;i < Q;i++){int L = ni();int[] b = na(L+1);for(int j = 0;j < L;j++){int sr = b[j]/m, sc = b[j]%m;int tr = b[j+1]/m, tc = b[j+1]%m;if(sr == tr){map[2*sr][Math.min(sc, tc)*2+1]++;map[2*sr][Math.max(sc, tc)*2+1]--;}else{map[Math.min(sr, tr)*2+1][2*sc]++;map[Math.max(sr, tr)*2+1][2*sc]--;}}}for(int i = 0;i < 2*n;i+=2){for(int j = 3;j < 2*m+3;j+=2){map[i][j] += map[i][j-2];}}for(int j = 0;j < 2*m;j+=2){for(int i = 3;i < 2*n+3;i+=2){map[i][j] += map[i-2][j];}}Queue<Integer> q = new ArrayDeque<Integer>();q.add(0);int[] d = new int[n*m];int I = 999999999;Arrays.fill(d, I);d[0] = 0;int[] dr = { 1, 0, -1, 0 };int[] dc = { 0, 1, 0, -1 };while(!q.isEmpty()){int cur = q.poll();int r = cur / m, c = cur % m;for(int k = 0;k < 4;k++){int nr = r + dr[k], nc = c + dc[k];if(nr >= 0 && nr < n && nc >= 0 && nc < m && map[r+nr][c+nc] > 0 && d[nr*m+nc] > d[cur] + 1){d[nr*m+nc] = d[cur] + 1;q.add(nr*m+nc);}}}int ret = d[n*m-1];if(ret >= I){out.println("Odekakedekinai..");}else{out.println(ret);}}void run() throws Exception{is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());out = new PrintWriter(System.out);long s = System.currentTimeMillis();solve();out.flush();if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");}public static void main(String[] args) throws Exception { new Q932().run(); }private byte[] inbuf = new byte[1024];private int lenbuf = 0, ptrbuf = 0;private int readByte(){if(lenbuf == -1)throw new InputMismatchException();if(ptrbuf >= lenbuf){ptrbuf = 0;try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }if(lenbuf <= 0)return -1;}return inbuf[ptrbuf++];}private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }private double nd() { return Double.parseDouble(ns()); }private char nc() { return (char)skip(); }private String ns(){int b = skip();StringBuilder sb = new StringBuilder();while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')sb.appendCodePoint(b);b = readByte();}return sb.toString();}private char[] ns(int n){char[] buf = new char[n];int b = skip(), p = 0;while(p < n && !(isSpaceChar(b))){buf[p++] = (char)b;b = readByte();}return n == p ? buf : Arrays.copyOf(buf, p);}private char[][] nm(int n, int m){char[][] map = new char[n][];for(int i = 0;i < n;i++)map[i] = ns(m);return map;}private int[] na(int n){int[] a = new int[n];for(int i = 0;i < n;i++)a[i] = ni();return a;}private int ni(){int num = 0, b;boolean minus = false;while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));if(b == '-'){minus = true;b = readByte();}while(true){if(b >= '0' && b <= '9'){num = num * 10 + (b - '0');}else{return minus ? -num : num;}b = readByte();}}private long nl(){long num = 0;int b;boolean minus = false;while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));if(b == '-'){minus = true;b = readByte();}while(true){if(b >= '0' && b <= '9'){num = num * 10 + (b - '0');}else{return minus ? -num : num;}b = readByte();}}private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }}