結果

問題 No.340 雪の足跡
ユーザー uwiuwi
提出日時 2016-01-29 22:34:03
言語 Java21
(openjdk 21)
結果
AC  
実行時間 403 ms / 1,000 ms
コード長 4,108 bytes
コンパイル時間 3,963 ms
コンパイル使用メモリ 83,708 KB
実行使用メモリ 86,196 KB
最終ジャッジ日時 2023-10-21 17:04:00
合計ジャッジ時間 12,145 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 50 ms
53,444 KB
testcase_01 AC 50 ms
53,452 KB
testcase_02 AC 50 ms
53,448 KB
testcase_03 AC 51 ms
53,452 KB
testcase_04 AC 50 ms
53,396 KB
testcase_05 AC 50 ms
53,456 KB
testcase_06 AC 51 ms
53,456 KB
testcase_07 AC 52 ms
53,452 KB
testcase_08 AC 51 ms
53,456 KB
testcase_09 AC 50 ms
53,444 KB
testcase_10 AC 51 ms
53,444 KB
testcase_11 AC 56 ms
53,464 KB
testcase_12 AC 54 ms
53,464 KB
testcase_13 AC 57 ms
53,460 KB
testcase_14 AC 127 ms
57,676 KB
testcase_15 AC 132 ms
57,804 KB
testcase_16 AC 97 ms
55,124 KB
testcase_17 AC 141 ms
58,128 KB
testcase_18 AC 139 ms
55,952 KB
testcase_19 AC 142 ms
57,836 KB
testcase_20 AC 299 ms
79,092 KB
testcase_21 AC 179 ms
59,516 KB
testcase_22 AC 105 ms
73,380 KB
testcase_23 AC 305 ms
86,096 KB
testcase_24 AC 250 ms
79,304 KB
testcase_25 AC 269 ms
79,056 KB
testcase_26 AC 125 ms
55,680 KB
testcase_27 AC 82 ms
54,684 KB
testcase_28 AC 131 ms
57,716 KB
testcase_29 AC 366 ms
73,832 KB
testcase_30 AC 292 ms
68,652 KB
testcase_31 AC 396 ms
80,924 KB
testcase_32 AC 403 ms
85,920 KB
testcase_33 AC 369 ms
85,996 KB
testcase_34 AC 402 ms
86,116 KB
testcase_35 AC 366 ms
86,196 KB
testcase_36 AC 354 ms
86,108 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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 Q932 {
	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];
			}
		}
		Queue<Integer> q = new ArrayDeque<Integer>();
		q.add(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 };
		while(!q.isEmpty()){
			int cur = q.poll();
			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.add(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 Q932().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)); }
}
0