結果
問題 | No.323 yuki国 |
ユーザー | uwi |
提出日時 | 2015-12-16 00:05:56 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 357 ms / 5,000 ms |
コード長 | 3,636 bytes |
コンパイル時間 | 3,833 ms |
コンパイル使用メモリ | 87,488 KB |
実行使用メモリ | 60,104 KB |
最終ジャッジ日時 | 2023-09-10 21:11:51 |
合計ジャッジ時間 | 10,348 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
49,252 KB |
testcase_01 | AC | 45 ms
49,336 KB |
testcase_02 | AC | 46 ms
49,024 KB |
testcase_03 | AC | 46 ms
49,268 KB |
testcase_04 | AC | 43 ms
49,000 KB |
testcase_05 | AC | 63 ms
51,268 KB |
testcase_06 | AC | 55 ms
49,208 KB |
testcase_07 | AC | 47 ms
49,180 KB |
testcase_08 | AC | 293 ms
60,104 KB |
testcase_09 | AC | 193 ms
59,872 KB |
testcase_10 | AC | 44 ms
48,828 KB |
testcase_11 | AC | 45 ms
49,076 KB |
testcase_12 | AC | 46 ms
49,272 KB |
testcase_13 | AC | 183 ms
59,612 KB |
testcase_14 | AC | 253 ms
59,844 KB |
testcase_15 | AC | 192 ms
59,464 KB |
testcase_16 | AC | 290 ms
59,664 KB |
testcase_17 | AC | 190 ms
59,780 KB |
testcase_18 | AC | 61 ms
52,200 KB |
testcase_19 | AC | 234 ms
57,516 KB |
testcase_20 | AC | 85 ms
56,512 KB |
testcase_21 | AC | 357 ms
59,760 KB |
testcase_22 | AC | 142 ms
57,904 KB |
testcase_23 | AC | 330 ms
59,540 KB |
testcase_24 | AC | 96 ms
59,452 KB |
testcase_25 | AC | 214 ms
59,792 KB |
testcase_26 | AC | 97 ms
59,804 KB |
testcase_27 | AC | 309 ms
59,936 KB |
testcase_28 | AC | 215 ms
59,624 KB |
testcase_29 | AC | 223 ms
59,816 KB |
testcase_30 | AC | 43 ms
48,964 KB |
testcase_31 | AC | 47 ms
48,960 KB |
testcase_32 | AC | 50 ms
49,280 KB |
testcase_33 | AC | 47 ms
47,252 KB |
testcase_34 | AC | 62 ms
51,224 KB |
testcase_35 | AC | 43 ms
49,352 KB |
testcase_36 | AC | 51 ms
49,176 KB |
testcase_37 | AC | 43 ms
49,020 KB |
ソースコード
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 QP { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(), m = ni(); int A = ni(), sr = ni(), sc = ni(); int B = ni(), gr = ni(), gc = ni(); char[][] map = nm(n,m); boolean[][][] can = new boolean[n][m][2002]; can[sr][sc][A] = true; Queue<int[]> q = new ArrayDeque<>(); q.add(new int[]{sr, sc, A}); int[] dr = { 1, 0, -1, 0 }; int[] dc = { 0, 1, 0, -1 }; while(!q.isEmpty()){ int[] cur = q.poll(); int r = cur[0], c = cur[1], w = cur[2]; if(can[gr][gc][B])break; 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){ int nw = w + (map[nr][nc] == '*' ? 1 : -1); if(nw >= 1 && nw <= 2000 && !can[nr][nc][nw]){ can[nr][nc][nw] = true; q.add(new int[]{nr, nc, nw}); } } } } out.println(can[gr][gc][B] ? "Yes" : "No"); } 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 QP().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)); } }