結果
問題 | No.340 雪の足跡 |
ユーザー | uwi |
提出日時 | 2016-01-29 22:52:32 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 353 ms / 1,000 ms |
コード長 | 4,053 bytes |
コンパイル時間 | 4,830 ms |
コンパイル使用メモリ | 80,200 KB |
実行使用メモリ | 82,656 KB |
最終ジャッジ日時 | 2023-10-21 17:12:52 |
合計ジャッジ時間 | 12,217 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 53 ms
53,264 KB |
testcase_01 | AC | 52 ms
53,264 KB |
testcase_02 | AC | 52 ms
53,280 KB |
testcase_03 | AC | 52 ms
52,228 KB |
testcase_04 | AC | 56 ms
53,260 KB |
testcase_05 | AC | 53 ms
53,276 KB |
testcase_06 | AC | 52 ms
53,276 KB |
testcase_07 | AC | 52 ms
53,280 KB |
testcase_08 | AC | 52 ms
52,212 KB |
testcase_09 | AC | 52 ms
53,272 KB |
testcase_10 | AC | 53 ms
52,252 KB |
testcase_11 | AC | 56 ms
53,280 KB |
testcase_12 | AC | 56 ms
52,232 KB |
testcase_13 | AC | 56 ms
53,284 KB |
testcase_14 | AC | 123 ms
56,972 KB |
testcase_15 | AC | 123 ms
57,340 KB |
testcase_16 | AC | 109 ms
54,956 KB |
testcase_17 | AC | 157 ms
57,356 KB |
testcase_18 | AC | 119 ms
57,372 KB |
testcase_19 | AC | 135 ms
57,664 KB |
testcase_20 | AC | 293 ms
82,572 KB |
testcase_21 | AC | 186 ms
57,244 KB |
testcase_22 | AC | 107 ms
76,580 KB |
testcase_23 | AC | 288 ms
82,656 KB |
testcase_24 | AC | 265 ms
81,020 KB |
testcase_25 | AC | 272 ms
82,600 KB |
testcase_26 | AC | 119 ms
55,312 KB |
testcase_27 | AC | 80 ms
54,488 KB |
testcase_28 | AC | 126 ms
55,248 KB |
testcase_29 | AC | 326 ms
70,948 KB |
testcase_30 | AC | 258 ms
66,068 KB |
testcase_31 | AC | 336 ms
76,872 KB |
testcase_32 | AC | 351 ms
82,588 KB |
testcase_33 | AC | 306 ms
78,872 KB |
testcase_34 | AC | 353 ms
82,548 KB |
testcase_35 | AC | 317 ms
82,640 KB |
testcase_36 | AC | 315 ms
82,652 KB |
ソースコード
package contest; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class Q932F { 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]; } } int[] q = new int[n*m]; int p = 0; q[p++] = 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 }; for(int z = 0;z < p;z++){ int cur = q[z]; 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[p++] = 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 Q932F().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)); } }