結果

問題 No.1323 うしらずSwap
ユーザー uwiuwi
提出日時 2020-12-20 00:35:30
言語 Java19
(openjdk 21)
結果
AC  
実行時間 604 ms / 3,000 ms
コード長 13,188 bytes
コンパイル時間 4,647 ms
コンパイル使用メモリ 86,868 KB
実行使用メモリ 103,792 KB
最終ジャッジ日時 2023-08-09 13:50:17
合計ジャッジ時間 26,998 ms
ジャッジサーバーID
(参考情報)
judge13 / judge12
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 64 ms
48,504 KB
testcase_01 AC 63 ms
50,436 KB
testcase_02 AC 64 ms
50,448 KB
testcase_03 AC 65 ms
50,848 KB
testcase_04 AC 65 ms
50,464 KB
testcase_05 AC 64 ms
50,576 KB
testcase_06 AC 65 ms
50,476 KB
testcase_07 AC 65 ms
50,440 KB
testcase_08 AC 65 ms
50,776 KB
testcase_09 AC 65 ms
50,376 KB
testcase_10 AC 66 ms
50,528 KB
testcase_11 AC 64 ms
50,448 KB
testcase_12 AC 65 ms
50,436 KB
testcase_13 AC 65 ms
50,528 KB
testcase_14 AC 66 ms
50,484 KB
testcase_15 AC 64 ms
50,356 KB
testcase_16 AC 319 ms
79,144 KB
testcase_17 AC 337 ms
79,300 KB
testcase_18 AC 320 ms
79,192 KB
testcase_19 AC 377 ms
79,156 KB
testcase_20 AC 321 ms
79,340 KB
testcase_21 AC 512 ms
98,088 KB
testcase_22 AC 590 ms
98,216 KB
testcase_23 AC 509 ms
98,092 KB
testcase_24 AC 604 ms
98,836 KB
testcase_25 AC 458 ms
98,512 KB
testcase_26 AC 491 ms
103,792 KB
testcase_27 AC 472 ms
99,484 KB
testcase_28 AC 363 ms
80,096 KB
testcase_29 AC 341 ms
97,516 KB
testcase_30 AC 450 ms
96,520 KB
testcase_31 AC 426 ms
97,592 KB
testcase_32 AC 403 ms
97,772 KB
testcase_33 AC 472 ms
79,872 KB
testcase_34 AC 480 ms
80,052 KB
testcase_35 AC 469 ms
79,956 KB
testcase_36 AC 480 ms
79,616 KB
testcase_37 AC 442 ms
79,804 KB
testcase_38 AC 460 ms
80,008 KB
testcase_39 AC 474 ms
79,916 KB
testcase_40 AC 491 ms
79,792 KB
testcase_41 AC 488 ms
80,008 KB
testcase_42 AC 488 ms
79,824 KB
testcase_43 AC 303 ms
79,440 KB
testcase_44 AC 355 ms
78,888 KB
testcase_45 AC 341 ms
80,024 KB
testcase_46 AC 338 ms
78,416 KB
testcase_47 AC 308 ms
79,188 KB
testcase_48 AC 437 ms
93,208 KB
testcase_49 AC 523 ms
102,816 KB
testcase_50 AC 444 ms
100,684 KB
testcase_51 AC 307 ms
86,924 KB
testcase_52 AC 366 ms
97,448 KB
testcase_53 AC 469 ms
102,632 KB
testcase_54 AC 379 ms
99,128 KB
testcase_55 AC 505 ms
103,028 KB
testcase_56 AC 373 ms
101,176 KB
testcase_57 AC 491 ms
103,532 KB
testcase_58 AC 72 ms
50,556 KB
testcase_59 AC 74 ms
50,520 KB
testcase_60 AC 74 ms
50,376 KB
testcase_61 AC 68 ms
50,432 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

package adv2020;

import java.io.*;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Queue;

public class Day20 {
	InputStream is;
	FastWriter out;

//	String INPUT = "2 7 1 6 1 7 "+
//			".......\n" +
//			".######\n" +"";
	String INPUT = "";

	public void solve() {
		int H = ni(), W = ni();
		int ra = ni() - 1, ca = ni() - 1, rb = ni() - 1, cb = ni() - 1;
		char[][] map = nm(H, W);

		int[][] da = distmap(map, ra, ca);
		int[][] db = distmap(map, rb, cb);
		if(da[rb][cb] >= Integer.MAX_VALUE / 2){
			out.println(-1);
			return;
		}

		int D = da[rb][cb];
		int[] f = new int[D+1];
		for(int i = 0;i < H;i++){
			for(int j = 0;j < W;j++){
				if(da[i][j] + db[i][j] == D){
					f[da[i][j]]++;
				}
			}
		}
		for(int i = 0;i <= D;i++){
			if(f[i] > 1){
				out.println(2*D);
				return;
			}
		}
		for(int i = 0;i < H;i++){
			for(int j = 0;j < W;j++){
				if(da[i][j] + db[i][j] == D+2 && da[i][j] <= D && db[i][j] <= D){
					out.println(2*D+2);
					return;
				}
			}
		}

		int[][] da2 = distmap2(map, ra, ca, da, db, D);

		int ans = da2[rb][cb] + D;

		f = new int[H*W];
		int[] g = new int[H*W];
		for(int i = 0;i < H;i++){
			for(int j = 0;j < W;j++){
				if(da[i][j] - db[i][j] == D) {
					g[db[i][j]]++;
				}
				if(db[i][j] - da[i][j] == D){
					f[da[i][j]]++;
				}
			}
		}
		for(int i = 0;i < H*W;i++){
			if(f[i] > 1 || g[i] > 1){
				ans = Math.min(ans, 4*i+2*D);
			}
		}
		if(ans < Integer.MAX_VALUE / 2) {
			out.println(ans);
		}else {
			out.println(-1);
		}
	}

	int[][] distmap(char[][] map, int sr, int sc){
		Queue<int[]> q = new ArrayDeque<>();
		int[] dr = {1, 0, -1, 0};
		int[] dc = {0, 1, 0, -1};
		int n = map.length, m = map[0].length;
		int[][] ds = new int[n][m];
		for(int i = 0;i <  n;i++)Arrays.fill(ds[i], Integer.MAX_VALUE / 2);

		q.add(new int[]{sr, sc});
		ds[sr][sc] = 0;
		while(!q.isEmpty()){
			int[] cur = q.poll();
			int r = cur[0], c = cur[1];
			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[nr][nc] != '#' && ds[nr][nc] > ds[r][c] + 1){
					ds[nr][nc] = ds[r][c] + 1;
					q.add(new int[]{nr, nc});
				}
			}
		}
		return ds;
	}

	int[][] distmap2(char[][] map, int sr, int sc, int[][] da, int[][] db, int ng){
		Queue<int[]> q = new ArrayDeque<>();
		int[] dr = {1, 0, -1, 0};
		int[] dc = {0, 1, 0, -1};
		int n = map.length, m = map[0].length;
		int[][] ds = new int[n][m];
		for(int i = 0;i <  n;i++)Arrays.fill(ds[i], Integer.MAX_VALUE / 2);

		q.add(new int[]{sr, sc});
		ds[sr][sc] = 0;
		while(!q.isEmpty()){
			int[] cur = q.poll();
			int r = cur[0], c = cur[1];
			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[nr][nc] != '#' && ds[nr][nc] > ds[r][c] + 1){
					if(da[r][c] + db[r][c] == ng && da[nr][nc] + db[nr][nc] == ng)continue;
					ds[nr][nc] = ds[r][c] + 1;
					q.add(new int[]{nr, nc});
				}
			}
		}
		return ds;
	}



	public static void main(String[] args) {
		new Day20().run();
	}

	public void run()
	{
		long S = System.currentTimeMillis();
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new FastWriter(System.out);

		solve();
		out.flush();
		long G = System.currentTimeMillis();
		tr(G-S+"ms");
		//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
		//			@Override
		//			public void run() {
		//				long s = System.currentTimeMillis();
		//				solve();
		//				out.flush();
		//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
		//			}
		//		};
		//		t.start();
		//		t.join();
	}

	private 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 final byte[] inbuf = new byte[1024];
	public 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 boolean isSpaceChar(int c) { return !(c >= 32 && 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))){
			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 long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		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();
		}
	}

	public static class FastWriter
	{
		private static final int BUF_SIZE = 1<<13;
		private final byte[] buf = new byte[BUF_SIZE];
		private final OutputStream out;
		private int ptr = 0;

		private FastWriter(){out = null;}

		public FastWriter(OutputStream os)
		{
			this.out = os;
		}

		public FastWriter(String path)
		{
			try {
				this.out = new FileOutputStream(path);
			} catch (FileNotFoundException e) {
				throw new RuntimeException("FastWriter");
			}
		}

		public FastWriter write(byte b)
		{
			buf[ptr++] = b;
			if(ptr == BUF_SIZE)innerflush();
			return this;
		}

		public FastWriter write(char c)
		{
			return write((byte)c);
		}

		public FastWriter write(char[] s)
		{
			for(char c : s){
				buf[ptr++] = (byte)c;
				if(ptr == BUF_SIZE)innerflush();
			}
			return this;
		}

		public FastWriter write(String s)
		{
			s.chars().forEach(c -> {
				buf[ptr++] = (byte)c;
				if(ptr == BUF_SIZE)innerflush();
			});
			return this;
		}

		private static int countDigits(int l) {
			if (l >= 1000000000) return 10;
			if (l >= 100000000) return 9;
			if (l >= 10000000) return 8;
			if (l >= 1000000) return 7;
			if (l >= 100000) return 6;
			if (l >= 10000) return 5;
			if (l >= 1000) return 4;
			if (l >= 100) return 3;
			if (l >= 10) return 2;
			return 1;
		}

		public FastWriter write(int x)
		{
			if(x == Integer.MIN_VALUE){
				return write((long)x);
			}
			if(ptr + 12 >= BUF_SIZE)innerflush();
			if(x < 0){
				write((byte)'-');
				x = -x;
			}
			int d = countDigits(x);
			for(int i = ptr + d - 1;i >= ptr;i--){
				buf[i] = (byte)('0'+x%10);
				x /= 10;
			}
			ptr += d;
			return this;
		}

		private static int countDigits(long l) {
			if (l >= 1000000000000000000L) return 19;
			if (l >= 100000000000000000L) return 18;
			if (l >= 10000000000000000L) return 17;
			if (l >= 1000000000000000L) return 16;
			if (l >= 100000000000000L) return 15;
			if (l >= 10000000000000L) return 14;
			if (l >= 1000000000000L) return 13;
			if (l >= 100000000000L) return 12;
			if (l >= 10000000000L) return 11;
			if (l >= 1000000000L) return 10;
			if (l >= 100000000L) return 9;
			if (l >= 10000000L) return 8;
			if (l >= 1000000L) return 7;
			if (l >= 100000L) return 6;
			if (l >= 10000L) return 5;
			if (l >= 1000L) return 4;
			if (l >= 100L) return 3;
			if (l >= 10L) return 2;
			return 1;
		}

		public FastWriter write(long x)
		{
			if(x == Long.MIN_VALUE){
				return write("" + x);
			}
			if(ptr + 21 >= BUF_SIZE)innerflush();
			if(x < 0){
				write((byte)'-');
				x = -x;
			}
			int d = countDigits(x);
			for(int i = ptr + d - 1;i >= ptr;i--){
				buf[i] = (byte)('0'+x%10);
				x /= 10;
			}
			ptr += d;
			return this;
		}

		public FastWriter write(double x, int precision)
		{
			if(x < 0){
				write('-');
				x = -x;
			}
			x += Math.pow(10, -precision)/2;
			//		if(x < 0){ x = 0; }
			write((long)x).write(".");
			x -= (long)x;
			for(int i = 0;i < precision;i++){
				x *= 10;
				write((char)('0'+(int)x));
				x -= (int)x;
			}
			return this;
		}

		public FastWriter writeln(char c){
			return write(c).writeln();
		}

		public FastWriter writeln(int x){
			return write(x).writeln();
		}

		public FastWriter writeln(long x){
			return write(x).writeln();
		}

		public FastWriter writeln(double x, int precision){
			return write(x, precision).writeln();
		}

		public FastWriter write(int... xs)
		{
			boolean first = true;
			for(int x : xs) {
				if (!first) write(' ');
				first = false;
				write(x);
			}
			return this;
		}

		public FastWriter write(long... xs)
		{
			boolean first = true;
			for(long x : xs) {
				if (!first) write(' ');
				first = false;
				write(x);
			}
			return this;
		}

		public FastWriter writeln()
		{
			return write((byte)'\n');
		}

		public FastWriter writeln(int... xs)
		{
			return write(xs).writeln();
		}

		public FastWriter writeln(long... xs)
		{
			return write(xs).writeln();
		}

		public FastWriter writeln(char[] line)
		{
			return write(line).writeln();
		}

		public FastWriter writeln(char[]... map)
		{
			for(char[] line : map)write(line).writeln();
			return this;
		}

		public FastWriter writeln(String s)
		{
			return write(s).writeln();
		}

		private void innerflush()
		{
			try {
				out.write(buf, 0, ptr);
				ptr = 0;
			} catch (IOException e) {
				throw new RuntimeException("innerflush");
			}
		}

		public void flush()
		{
			innerflush();
			try {
				out.flush();
			} catch (IOException e) {
				throw new RuntimeException("flush");
			}
		}

		public FastWriter print(byte b) { return write(b); }
		public FastWriter print(char c) { return write(c); }
		public FastWriter print(char[] s) { return write(s); }
		public FastWriter print(String s) { return write(s); }
		public FastWriter print(int x) { return write(x); }
		public FastWriter print(long x) { return write(x); }
		public FastWriter print(double x, int precision) { return write(x, precision); }
		public FastWriter println(char c){ return writeln(c); }
		public FastWriter println(int x){ return writeln(x); }
		public FastWriter println(long x){ return writeln(x); }
		public FastWriter println(double x, int precision){ return writeln(x, precision); }
		public FastWriter print(int... xs) { return write(xs); }
		public FastWriter print(long... xs) { return write(xs); }
		public FastWriter println(int... xs) { return writeln(xs); }
		public FastWriter println(long... xs) { return writeln(xs); }
		public FastWriter println(char[] line) { return writeln(line); }
		public FastWriter println(char[]... map) { return writeln(map); }
		public FastWriter println(String s) { return writeln(s); }
		public FastWriter println() { return writeln(); }
	}

	public static void trnz(int... o)
	{
		for(int i = 0;i < o.length;i++)if(o[i] != 0)System.out.print(i+":"+o[i]+" ");
		System.out.println();
	}

	// print ids which are 1
	public static void trt(long... o)
	{
		Queue<Integer> stands = new ArrayDeque<>();
		for(int i = 0;i < o.length;i++){
			for(long x = o[i];x != 0;x &= x-1)stands.add(i<<6|Long.numberOfTrailingZeros(x));
		}
		System.out.println(stands);
	}

	public static void tf(boolean... r)
	{
		for(boolean x : r)System.out.print(x?'#':'.');
		System.out.println();
	}

	public static void tf(boolean[]... b)
	{
		for(boolean[] r : b) {
			for(boolean x : r)System.out.print(x?'#':'.');
			System.out.println();
		}
		System.out.println();
	}

	public void tf(long[]... b)
	{
		if(INPUT.length() != 0) {
			for (long[] r : b) {
				for (long x : r) {
					for (int i = 0; i < 64; i++) {
						System.out.print(x << ~i < 0 ? '#' : '.');
					}
				}
				System.out.println();
			}
			System.out.println();
		}
	}

	public void tf(long... b)
	{
		if(INPUT.length() != 0) {
			for (long x : b) {
				for (int i = 0; i < 64; i++) {
					System.out.print(x << ~i < 0 ? '#' : '.');
				}
			}
			System.out.println();
		}
	}

	private void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}
0