結果

問題 No.340 雪の足跡
ユーザー ぴろずぴろず
提出日時 2016-01-29 23:29:06
言語 Java21
(openjdk 21)
結果
AC  
実行時間 441 ms / 1,000 ms
コード長 6,367 bytes
コンパイル時間 2,600 ms
コンパイル使用メモリ 78,784 KB
実行使用メモリ 95,164 KB
最終ジャッジ日時 2024-09-21 18:44:36
合計ジャッジ時間 12,211 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 74 ms
77,076 KB
testcase_01 AC 73 ms
77,232 KB
testcase_02 AC 72 ms
76,768 KB
testcase_03 AC 73 ms
77,024 KB
testcase_04 AC 72 ms
77,172 KB
testcase_05 AC 72 ms
76,756 KB
testcase_06 AC 74 ms
76,768 KB
testcase_07 AC 71 ms
77,288 KB
testcase_08 AC 73 ms
77,216 KB
testcase_09 AC 72 ms
77,176 KB
testcase_10 AC 76 ms
77,228 KB
testcase_11 AC 81 ms
76,896 KB
testcase_12 AC 78 ms
78,000 KB
testcase_13 AC 82 ms
78,000 KB
testcase_14 AC 155 ms
81,900 KB
testcase_15 AC 161 ms
82,524 KB
testcase_16 AC 145 ms
80,552 KB
testcase_17 AC 165 ms
82,692 KB
testcase_18 AC 160 ms
82,308 KB
testcase_19 AC 170 ms
82,644 KB
testcase_20 AC 362 ms
94,484 KB
testcase_21 AC 261 ms
85,964 KB
testcase_22 AC 153 ms
90,452 KB
testcase_23 AC 375 ms
94,584 KB
testcase_24 AC 324 ms
94,484 KB
testcase_25 AC 378 ms
95,164 KB
testcase_26 AC 192 ms
82,124 KB
testcase_27 AC 127 ms
78,808 KB
testcase_28 AC 181 ms
82,004 KB
testcase_29 AC 437 ms
91,416 KB
testcase_30 AC 395 ms
89,524 KB
testcase_31 AC 441 ms
93,900 KB
testcase_32 AC 435 ms
94,544 KB
testcase_33 AC 414 ms
94,496 KB
testcase_34 AC 439 ms
94,552 KB
testcase_35 AC 384 ms
94,596 KB
testcase_36 AC 397 ms
94,704 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package no340;

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;

public class Main {
	public static final int INF = 1 << 29;
	public static void main(String[] args) {
		IO io = new IO();
		int w = io.nextInt();
		int h = io.nextInt();
		int n = io.nextInt();
		int[][] vert = new int[h-1][w];
		int[][] hori = new int[h][w-1];
		for(int i=0;i<n;i++) {
			int m = io.nextInt();
			int[] b = io.nextIntArray(m+1);
			for(int j=0;j<m;j++) {
				int i1 = b[j] / w;
				int j1 = b[j] % w;
				int i2 = b[j+1] / w;
				int j2 = b[j+1] % w;
				if (i1 == i2) { //horizontal
					int min = Math.min(j1, j2);
					int max = Math.max(j1, j2);
					hori[i1][min] += 1;
					if (max < w - 1) {
						hori[i1][max] -= 1;
					}
					
				}else{ //vertical
					int min = Math.min(i1, i2);
					int max = Math.max(i1, i2);
					vert[min][j1] += 1;
					if (max < h - 1) {
						vert[max][j1] -= 1;
					}
				}
			}
		}
//		System.out.println(Arrays.deepToString(vert));
//		System.out.println(Arrays.deepToString(hori));
		for(int i=0;i<h;i++) {
			for(int j=0;j<w-2;j++) {
				hori[i][j+1] += hori[i][j];
			}
		}
		for(int j=0;j<w;j++) {
			for(int i=0;i<h-2;i++) {
				vert[i+1][j] += vert[i][j];
			}
		}
		MyQueueLong q = new MyQueueLong(5 * 1000000);
		int[][] dist = new int[h][w];
		for(int i=0;i<h;i++) {
			Arrays.fill(dist[i], INF);
		}
		dist[0][0] = 0;
		q.offer(0L);
		while(!q.isEmpty()) {
			long c = q.poll();
			int ci = (int) (c & 0xFFFFFFFF) / w;
			int cj = (int) (c & 0xFFFFFFFF) % w;
			int cd = (int) (c >> 32);
			if (ci < h - 1 && vert[ci][cj] >= 1)   check(q, dist, w, ci+1, cj, cd + 1);
			if (ci >= 1    && vert[ci-1][cj] >= 1) check(q, dist, w, ci-1, cj, cd + 1);
			if (cj < w - 1 && hori[ci][cj] >= 1)   check(q, dist, w, ci, cj+1, cd + 1);
			if (cj >= 1    && hori[ci][cj-1] >= 1) check(q, dist, w, ci, cj-1, cd + 1);
		}
		if (dist[h-1][w-1] >= INF) {
			System.out.println("Odekakedekinai..");
		}else{
			System.out.println(dist[h-1][w-1]);
		}
	}
	
	public static void check(MyQueueLong q,int[][] dist,int w, int ni,int nj,int nd) {
		if (dist[ni][nj] > nd) {
			dist[ni][nj] = nd;
			q.offer((ni * w + nj) | ((long) nd << 32));
		}
	}
}

class MyQueueLong {
	int n;
	long[] data;
	int begin = 0;
	int size = 0;
	public MyQueueLong(int buffersize) {
		n = buffersize;
		data = new long[n];
	}
	public int size() {
		return size;
	}
	public boolean isEmpty() {
		return size == 0;
	}
	public void offer(long x) {
		if (size == n) {
			throw new RuntimeException();
		}
		int i = begin + size;
		if (i >= n) i -= n;
		data[i] = x;
		size++;
	}
	public long poll() {
		if (size == 0) {
			throw new RuntimeException();
		}
		long ret = data[begin];
		begin++;
		if (begin >= n) begin = 0;
		size--;
		return ret;
	}
}

class IO extends PrintWriter {
	private final InputStream in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;
	
	public IO() { this(System.in);}
	public IO(InputStream source) { super(System.out); this.in = source;}
	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		}else{
			ptr = 0;
			try {
				buflen = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen <= 0) {
				return false;
			}
		}
		return true;
	}
	private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
	private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
	private static boolean isNewLine(int c) { return c == '\n' || c == '\r';}
	public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
	public boolean hasNextLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++; return hasNextByte();}
	public String next() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public char[] nextCharArray(int len) {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		char[] s = new char[len];
		int i = 0;
		int b = readByte();
		while(isPrintableChar(b)) {
			if (i == len) {
				throw new InputMismatchException();
			}
			s[i++] = (char) b;
			b = readByte();
		}
		return s;
	}
	public String nextLine() {
		if (!hasNextLine()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(!isNewLine(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public long nextLong() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while(true){
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			}else if(b == -1 || !isPrintableChar(b)){
				return minus ? -n : n;
			}else{
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}
	public int nextInt() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {
			throw new NumberFormatException();
		}
		return (int) nl;
	}
	public char nextChar() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		return (char) readByte();
	}
	public double nextDouble() { return Double.parseDouble(next());}
	public int[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}
	public long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}
	public double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}
	public void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}
	public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;}
	public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}
	public void close() { super.close(); try {in.close();} catch (IOException e) {}}
}
0