結果
問題 | No.34 砂漠の行商人 |
ユーザー | holeguma |
提出日時 | 2015-09-14 21:21:02 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 123 ms / 5,000 ms |
コード長 | 3,729 bytes |
コンパイル時間 | 2,434 ms |
コンパイル使用メモリ | 91,888 KB |
実行使用メモリ | 55,100 KB |
最終ジャッジ日時 | 2023-09-10 19:15:21 |
合計ジャッジ時間 | 5,441 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 42 ms
49,372 KB |
testcase_01 | AC | 43 ms
49,260 KB |
testcase_02 | AC | 47 ms
49,500 KB |
testcase_03 | AC | 44 ms
49,512 KB |
testcase_04 | AC | 64 ms
50,428 KB |
testcase_05 | AC | 65 ms
50,396 KB |
testcase_06 | AC | 58 ms
50,340 KB |
testcase_07 | AC | 91 ms
51,928 KB |
testcase_08 | AC | 98 ms
53,856 KB |
testcase_09 | AC | 91 ms
52,028 KB |
testcase_10 | AC | 77 ms
53,628 KB |
testcase_11 | AC | 97 ms
54,188 KB |
testcase_12 | AC | 55 ms
49,964 KB |
testcase_13 | AC | 109 ms
54,564 KB |
testcase_14 | AC | 123 ms
55,100 KB |
testcase_15 | AC | 52 ms
49,744 KB |
testcase_16 | AC | 63 ms
50,892 KB |
testcase_17 | AC | 59 ms
51,360 KB |
testcase_18 | AC | 50 ms
50,028 KB |
testcase_19 | AC | 102 ms
54,160 KB |
testcase_20 | AC | 102 ms
54,616 KB |
testcase_21 | AC | 67 ms
52,796 KB |
testcase_22 | AC | 64 ms
50,880 KB |
testcase_23 | AC | 54 ms
49,460 KB |
testcase_24 | AC | 107 ms
54,196 KB |
testcase_25 | AC | 70 ms
51,404 KB |
ソースコード
import java.io.InputStream; import java.io.IOException; import java.io.PrintWriter; import java.util.ArrayDeque; import java.util.ArrayList; import java.util.Arrays; import java.util.BitSet; import java.util.Comparator; import java.util.Deque; import java.util.HashMap; import java.util.HashSet; import java.util.InputMismatchException; import java.util.Map; import java.util.PriorityQueue; import java.math.BigDecimal; import java.math.BigInteger; public class Main{ static final InputStream in=System.in; static final PrintWriter out=new PrintWriter(System.out); static final int INF=Integer.MAX_VALUE/2; static final long LINF=Long.MAX_VALUE/2; static int n,V,sx,sy,gx,gy,ans; static AdjacentList[] al; static int[][] map; static int[] dist; static int[] dx={0,-1,0,1}; static int[] dy={-1,0,1,0}; public static void main(String[] args) throws IOException{ InputReader ir=new InputReader(in); n=ir.nextInt(); V=ir.nextInt(); sx=ir.nextInt()-1; sy=ir.nextInt()-1; gx=ir.nextInt()-1; gy=ir.nextInt()-1; ans=INF; dist=new int[n*n]; al=new AdjacentList[n*n]; map=new int[n][n]; for(int i=0;i<n;i++) for(int j=0;j<n;j++) map[i][j]=ir.nextInt(); for(int i=0;i<n*n;i++) al[i]=new AdjacentList(); for(int i=0;i<n*n;i++){ int x=i/n; int y=i%n; for(int j=0;j<4;j++){ int nx=x+dx[j]; int ny=y+dy[j]; if(nx>=0&&nx<n&&ny>=0&&ny<n) al[i].add(new Edge(nx*n+ny,map[nx][ny])); } } bfs(sx+sy*n,gx+gy*n); out.println(ans==INF?-1:ans); out.flush(); } static class Edge{ int to; int cost; public Edge(int to,int cost){ this.to=to; this.cost=cost; } } static class AdjacentList extends ArrayList<Edge>{} static class Info{ int v; int times; public Info(int v,int times){ this.v=v; this.times=times; } } public static void bfs(int s,int g){ Arrays.fill(dist,INF); dist[s]=0; Deque<Info> que=new ArrayDeque<Info>(); que.offerLast(new Info(s,0)); while(!que.isEmpty()){ Info I=que.pollFirst(); int v=I.v; int t=I.times; if(dist[v]>=V) continue; else if(v==g){ ans=t; return; } else{ AdjacentList list=al[v]; for(int i=0;i<list.size();i++){ Edge e=list.get(i); if(dist[e.to]>dist[v]+e.cost){ dist[e.to]=dist[v]+e.cost; que.offerLast(new Info(e.to,t+1)); } } } } } static class InputReader { private InputStream in; private byte[] buffer=new byte[1024]; private int curbuf; private int lenbuf; public InputReader(InputStream in) {this.in=in;} public int readByte() { if(lenbuf==-1) throw new InputMismatchException(); if(curbuf>=lenbuf){ curbuf= 0; try{ lenbuf=in.read(buffer); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf<=0) return -1; } return buffer[curbuf++]; } public boolean isSpaceChar(int c){return !(c>=33&&c<=126);} private int skip() {int b; while((b = readByte())!=-1&&isSpaceChar(b)); return b;} public String next() { int b=skip(); StringBuilder sb=new StringBuilder(); while(!isSpaceChar(b)){ sb.appendCodePoint(b); b=readByte(); } return sb.toString(); } public int nextInt() { int c=readByte(); while (isSpaceChar(c)) c=readByte(); boolean minus=false; if (c=='-') { minus=true; c=readByte(); } int res=0; do{ if(c<'0'||c>'9') throw new InputMismatchException(); res=res*10+c-'0'; c=readByte(); }while(!isSpaceChar(c)); return (minus)?-res:res; } public long nextLong() { int c=readByte(); while (isSpaceChar(c)) c=readByte(); boolean minus=false; if (c=='-') { minus=true; c=readByte(); } long res = 0; do{ if(c<'0'||c>'9') throw new InputMismatchException(); res=res*10+c-'0'; c=readByte(); }while(!isSpaceChar(c)); return (minus)?-res:res; } public double nextDouble(){return Double.parseDouble(next());} public BigInteger nextBigInteger(){return new BigInteger(next());} public int[] nextIntArray(int n){ int[] a=new int[n]; for(int i=0;i<n;i++) a[i]=nextInt(); return a; } } }