結果

問題 No.34 砂漠の行商人
ユーザー uwiuwi
提出日時 2015-02-17 03:15:14
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,574 bytes
コンパイル時間 4,552 ms
コンパイル使用メモリ 80,328 KB
実行使用メモリ 54,008 KB
最終ジャッジ日時 2023-09-06 00:57:50
合計ジャッジ時間 45,799 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 96 ms
53,424 KB
testcase_01 AC 100 ms
53,172 KB
testcase_02 AC 230 ms
53,484 KB
testcase_03 AC 188 ms
53,368 KB
testcase_04 AC 854 ms
53,464 KB
testcase_05 WA -
testcase_06 AC 742 ms
53,380 KB
testcase_07 AC 1,777 ms
53,668 KB
testcase_08 AC 2,287 ms
53,668 KB
testcase_09 AC 1,583 ms
54,008 KB
testcase_10 AC 2,671 ms
53,324 KB
testcase_11 AC 2,429 ms
51,560 KB
testcase_12 AC 804 ms
53,812 KB
testcase_13 AC 2,987 ms
53,544 KB
testcase_14 AC 2,499 ms
53,616 KB
testcase_15 AC 900 ms
53,952 KB
testcase_16 AC 808 ms
53,792 KB
testcase_17 AC 1,774 ms
53,780 KB
testcase_18 AC 300 ms
53,312 KB
testcase_19 AC 2,291 ms
53,484 KB
testcase_20 AC 2,439 ms
53,452 KB
testcase_21 AC 3,048 ms
53,552 KB
testcase_22 AC 2,555 ms
53,716 KB
testcase_23 AC 1,124 ms
53,712 KB
testcase_24 AC 2,576 ms
53,820 KB
testcase_25 AC 1,468 ms
53,776 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package q0xx;
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 Q15_3 {
	static InputStream is;
	static PrintWriter out;
	static String INPUT = "";
	
	static void solve()
	{
		int n = ni(), v = ni();
		int sc = ni()-1, sr = ni()-1;
		int tc = ni()-1, tr = ni()-1;
		int[][] a = new int[n][];
		for(int i = 0;i < n;i++){
			a[i] = na(n);
		}
		
		int[][][] dp = new int[11][n][n];
		int I = 99999999;
		for(int i = 0;i < 11;i++){
			for(int j = 0;j < n;j++){
				Arrays.fill(dp[i][j], I);
			}
		}
		dp[0][sr][sc] = 0;
		int[] dr = { 1, 0, -1, 0 };
		int[] dc = { 0, 1, 0, -1 };
		int ret = I;
		for(int i = 1, ii = 1;i < 10300;i++, ii++){
			if(ii == 11)ii = 0;
			for(int j = 0;j < n;j++){
				for(int k = 0;k < n;k++){
					int pre = (i+11-a[j][k]-1)%11;
					int min = I;
					for(int l = 0;l < 4;l++){
						int pr = j-dr[l], pc = k-dc[l];
						if(pr >= 0 && pr < n && pc >= 0 && pc < n && i-(dp[pre][pr][pc]+1) < v){
							min = Math.min(min, dp[pre][pr][pc]+1);
						}
					}
					dp[ii][j][k] = min;
				}
			}
			if(dp[ii][tr][tc] != I){
				ret = Math.min(dp[ii][tr][tc], ret);
			}
		}
		out.println(ret == I ? -1 : ret);
	}
	
	public static void main(String[] args) throws Exception
	{
//		int n = 100, m = 100;
//		Random gen = new Random();
//		StringBuilder sb = new StringBuilder();
//		sb.append(n + " ");
//		sb.append(10000 + " ");
//		sb.append(1 + " ");
//		sb.append(1+ " ");
//		sb.append(n + " ");
//		sb.append(n+ " ");
//		for (int i = 0; i < n*n; i++) {
//			sb.append(gen.nextInt(10) + " ");
//		}
//		INPUT = sb.toString();
		
		long S = System.currentTimeMillis();
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		solve();
		out.flush();
		long G = System.currentTimeMillis();
		tr(G-S+"ms");
	}
	
	private static boolean eof()
	{
		if(lenbuf == -1)return true;
		int lptr = ptrbuf;
		while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;
		
		try {
			is.mark(1000);
			while(true){
				int b = is.read();
				if(b == -1){
					is.reset();
					return true;
				}else if(!isSpaceChar(b)){
					is.reset();
					return false;
				}
			}
		} catch (IOException e) {
			return true;
		}
	}
	
	private static byte[] inbuf = new byte[1024];
	static int lenbuf = 0, ptrbuf = 0;
	
	private static 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 static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private static double nd() { return Double.parseDouble(ns()); }
	private static char nc() { return (char)skip(); }
	
	private static 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 static 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 static 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 static int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private static 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 static 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) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}
0