#46405 (Java21) No.20 砂漠のオアシス

• 問題: No.20 砂漠のオアシス
• ユーザー: holeguma
• 提出日時: 2015-08-29 19:14:45
• 言語: Java21 (openjdk 21)
• 結果: WA
• 実行時間: -
• コード長: 2,849 bytes
• コンパイル時間: 2,038 ms
• コンパイル使用メモリ: 78,952 KB
• 実行使用メモリ: 52,312 KB
• 最終ジャッジ日時: 2024-04-21 06:42:49
• 合計ジャッジ時間: 3,910 ms
• ジャッジサーバーID （参考情報）: judge1 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	WA	-
testcase_01	WA	-
testcase_02	AC	49 ms; 49,852 KB
testcase_03	AC	49 ms; 49,860 KB
testcase_04	WA	-
testcase_05	WA	-
testcase_06	AC	59 ms; 50,428 KB
testcase_07	WA	-
testcase_08	AC	63 ms; 50,032 KB
testcase_09	AC	63 ms; 50,296 KB
testcase_10	AC	51 ms; 49,772 KB
testcase_11	WA	-
testcase_12	AC	52 ms; 49,992 KB
testcase_13	AC	51 ms; 50,028 KB
testcase_14	WA	-
testcase_15	WA	-
testcase_16	WA	-
testcase_17	AC	51 ms; 49,828 KB
testcase_18	WA	-
testcase_19	AC	51 ms; 50,020 KB
testcase_20	WA	-

ソースコード

import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.Deque;
import java.util.HashMap;
import java.util.InputMismatchException;
import java.util.Map;
import java.util.PriorityQueue;
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,MAX_N=200,ox,oy;
static int[][] map=new int[MAX_N][MAX_N];
static boolean[][] isSearched=new boolean[MAX_N][MAX_N];
static final int[] dx={-1,0,1,0};
static final int[] dy={0,-1,0,1};

public static void main(String[] args) throws IOException{
InputReader ir=new InputReader(in);
N=ir.nextInt();
V=ir.nextInt();
ox=ir.nextInt()-1;
oy=ir.nextInt()-1;
for(int i=0;i<N;i++) map[i]=ir.toIntArray(N);
out.println(dfs(0,0,V)?"YES":"NO");
out.flush();
}

public static boolean dfs(int cx,int cy,int hp){
isSearched[cx][cy]=true;
hp-=map[cy][cx];
if(cx==oy&&cy==oy) hp*=2;
if(hp<=0) return false;
else if(cx==N-1&&cy==N-1) return true;
for(int k=0;k<4;k++){
int nx=cx+dx[k];
int ny=cy+dy[k];
if(nx>=0&&nx<N&&ny>=0&&ny<N&&!isSearched[nx][ny]) if(dfs(nx,ny,hp)) return true;
}
return false;
}

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 int[] toIntArray(int n){
int[] a=new int[n];
for(int i=0;i<n;i++) a[i]=nextInt();
return a;
}
}
}