結果

問題 No.867 避難経路
ユーザー uwiuwi
提出日時 2019-08-17 01:06:09
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 9,065 bytes
コンパイル時間 6,386 ms
コンパイル使用メモリ 85,480 KB
実行使用メモリ 180,824 KB
最終ジャッジ日時 2023-10-24 16:48:37
合計ジャッジ時間 100,190 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 87 ms
39,076 KB
testcase_01 AC 88 ms
39,296 KB
testcase_02 AC 95 ms
39,320 KB
testcase_03 AC 94 ms
39,072 KB
testcase_04 AC 88 ms
39,152 KB
testcase_05 AC 89 ms
39,332 KB
testcase_06 AC 90 ms
39,336 KB
testcase_07 AC 90 ms
39,384 KB
testcase_08 AC 92 ms
39,332 KB
testcase_09 AC 83 ms
39,388 KB
testcase_10 AC 93 ms
39,300 KB
testcase_11 AC 89 ms
39,340 KB
testcase_12 AC 91 ms
39,472 KB
testcase_13 AC 93 ms
39,440 KB
testcase_14 AC 91 ms
39,240 KB
testcase_15 AC 3,426 ms
165,292 KB
testcase_16 AC 3,431 ms
166,104 KB
testcase_17 AC 3,401 ms
166,120 KB
testcase_18 AC 3,316 ms
166,072 KB
testcase_19 AC 3,356 ms
166,172 KB
testcase_20 AC 3,275 ms
166,220 KB
testcase_21 AC 3,261 ms
166,144 KB
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
testcase_38 WA -
testcase_39 WA -
testcase_40 WA -
testcase_41 AC 58 ms
53,472 KB
testcase_42 AC 83 ms
54,848 KB
testcase_43 AC 81 ms
54,936 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest190816;
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 E3 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), m = ni();
		int gr = ni()-1, gc = ni()-1;
		
		int[][] a = new int[n][];
		for(int i = 0;i < n;i++)a[i] = na(m);
		
		// (K^2+1)*D <= (H+W)(K^2+99)
		int B = 300;
		int[] dr = { 1, 0, -1, 0 };
		int[] dc = { 0, 1, 0, -1 };
		
		int[][][] ds = new int[B][n][m];
		for(int k = 1;k < B;k++){
			for(int i = 0;i < n;i++)Arrays.fill(ds[k][i], Integer.MAX_VALUE / 2);
			MinHeap q = new MinHeap(n*m);
			q.add(gr*m+gc, 0);
			ds[k][gr][gc] = 0;
			
			while(q.size() > 0){
				int cur = q.argmin();
				q.remove(cur);
				int r = cur/m, c = cur%m;
				
				for(int d = 0;d < 4;d++){
					int nr = r + dr[d], nc = c + dc[d];
					if(nr >= 0 && nr < n && nc >= 0 && nc < m){
						int nd = ds[k][r][c] + a[nr][nc] + k*k;
						if(nd < ds[k][nr][nc]){
							ds[k][nr][nc] = nd;
							q.update(nr*m+nc, nd);
						}
					}
				}
			}
		}
		
		long[][] uds = new long[n][m];
		for(int i = 0;i < n;i++){
			Arrays.fill(uds[i], Long.MAX_VALUE / 2);
		}
		MinHeapL q = new MinHeapL(n*m);
		
		while(q.size() > 0){
			int argmin = q.argmin();
			q.remove(argmin);
			int r = argmin/m, c = argmin%m;
			for(int k = 0;k < 4;k++){
				int nr = r + dr[k], nc = c + dc[k];
				long nd = uds[r][c] + (1L<<32) + a[nr][nc];
				if(nr >= 0 && nr < n && nc >= 0 && nc < m && nd < uds[nr][nc]){
					uds[nr][nc] = nd;
					q.update(nr*m+nc, nd);
				}
			}
		}
		
		int Q = ni();
		
		for(int i = 0;i < Q;i++){
			int x = ni()-1, y = ni()-1, K = ni();
			if(K < B){
				out.println(ds[K][x][y] + (long)K*K+a[gr][gc]);
			}else{
				long d = uds[x][y]>>>32;
				long h = (int)(uds[x][y]);
				out.println(h + (long)K*K*(d+1) + a[gr][gc]);
			}
		}
	}
	

	public static class MinHeapL {
		public long[] a;
		public int[] map;
		public int[] imap;
		public int n;
		public int pos;
		public static long INF = Long.MAX_VALUE;
		
		public MinHeapL(int m)
		{
			n = Integer.highestOneBit((m+1)<<1);
			a = new long[n];
			map = new int[n];
			imap = new int[n];
			Arrays.fill(a, INF);
			Arrays.fill(map, -1);
			Arrays.fill(imap, -1);
			pos = 1;
		}
		
		public long add(int ind, long x)
		{
			int ret = imap[ind];
			if(imap[ind] < 0){
				a[pos] = x; map[pos] = ind; imap[ind] = pos;
				pos++;
				up(pos-1);
			}
			return ret != -1 ? a[ret] : x;
		}
		
		public long update(int ind, long x)
		{
			int ret = imap[ind];
			if(imap[ind] < 0){
				a[pos] = x; map[pos] = ind; imap[ind] = pos;
				pos++;
				up(pos-1);
			}else{
				a[ret] = x;
				up(ret);
				down(ret);
			}
			return x;
		}
		
		public long remove(int ind)
		{
			if(pos == 1)return INF;
			if(imap[ind] == -1)return INF;
			
			pos--;
			int rem = imap[ind];
			long ret = a[rem];
			map[rem] = map[pos];
			imap[map[pos]] = rem;
			imap[ind] = -1;
			a[rem] = a[pos];
			a[pos] = INF;
			map[pos] = -1;
			
			up(rem);
			down(rem);
			return ret;
		}
		
		public long min() { return a[1]; }
		public int argmin() { return map[1]; }
		public int size() {	return pos-1; }
		
		private void up(int cur)
		{
			for(int c = cur, p = c>>>1;p >= 1 && a[p] > a[c];c>>>=1, p>>>=1){
				long d = a[p]; a[p] = a[c]; a[c] = d;
				int e = imap[map[p]]; imap[map[p]] = imap[map[c]]; imap[map[c]] = e;
				e = map[p]; map[p] = map[c]; map[c] = e;
			}
		}
		
		private void down(int cur)
		{
			for(int c = cur;2*c < pos;){
				int b = a[2*c] < a[2*c+1] ? 2*c : 2*c+1;
				if(a[b] < a[c]){
					long d = a[c]; a[c] = a[b]; a[b] = d;
					int e = imap[map[c]]; imap[map[c]] = imap[map[b]]; imap[map[b]] = e;
					e = map[c]; map[c] = map[b]; map[b] = e;
					c = b;
				}else{
					break;
				}
			}
		}
	}
	
	public static class MinHeap {
		public int[] a;
		public int[] map;
		public int[] imap;
		public int n;
		public int pos;
		public static int INF = Integer.MAX_VALUE;
		
		public MinHeap(int m)
		{
			n = m+2;
			a = new int[n];
			map = new int[n];
			imap = new int[n];
			Arrays.fill(a, INF);
			Arrays.fill(map, -1);
			Arrays.fill(imap, -1);
			pos = 1;
		}
		
		public int add(int ind, int x)
		{
			int ret = imap[ind];
			if(imap[ind] < 0){
				a[pos] = x; map[pos] = ind; imap[ind] = pos;
				pos++;
				up(pos-1);
			}
			return ret != -1 ? a[ret] : x;
		}
		
		public int update(int ind, int x)
		{
			int ret = imap[ind];
			if(imap[ind] < 0){
				a[pos] = x; map[pos] = ind; imap[ind] = pos;
				pos++;
				up(pos-1);
			}else{
				int o = a[ret];
				a[ret] = x;
				up(ret);
				down(ret);
//				if(a[ret] > o){
//					up(ret);
//				}else{
//					down(ret);
//				}
			}
			return x;
		}
		
		public int remove(int ind)
		{
			if(pos == 1)return INF;
			if(imap[ind] == -1)return INF;
			
			pos--;
			int rem = imap[ind];
			int ret = a[rem];
			map[rem] = map[pos];
			imap[map[pos]] = rem;
			imap[ind] = -1;
			a[rem] = a[pos];
			a[pos] = INF;
			map[pos] = -1;
			
			up(rem);
			down(rem);
			return ret;
		}
		
		public int min() { return a[1]; }
		public int argmin() { return map[1]; }
		public int size() {	return pos-1; }
		
		private void up(int cur)
		{
			for(int c = cur, p = c>>>1;p >= 1 && a[p] > a[c];c>>>=1, p>>>=1){
				int d = a[p]; a[p] = a[c]; a[c] = d;
				int e = imap[map[p]]; imap[map[p]] = imap[map[c]]; imap[map[c]] = e;
				e = map[p]; map[p] = map[c]; map[c] = e;
			}
		}
		
		private void down(int cur)
		{
			for(int c = cur;2*c < pos;){
				int b = a[2*c] < a[2*c+1] ? 2*c : 2*c+1;
				if(a[b] < a[c]){
					int d = a[c]; a[c] = a[b]; a[b] = d;
					int e = imap[map[c]]; imap[map[c]] = imap[map[b]]; imap[map[b]] = e;
					e = map[c]; map[c] = map[b]; map[b] = e;
					c = b;
				}else{
					break;
				}
			}
		}
	}

	
	
	void run() throws Exception
	{
//		int n = 250, m = 250, q = 500000;
//		Random gen = new Random();
//		StringBuilder sb = new StringBuilder();
//		sb.append(n + " ");
//		sb.append(m + " ");
//		sb.append(1 + " ");
//		sb.append(1 + " ");
//		for (int i = 0; i < n*m; i++) {
//			sb.append(gen.nextInt(99)+1 + " ");
//		}
//		sb.append(q + " ");
//		for (int i = 0; i < q; i++) {
//			sb.append(gen.nextInt(n)+1 + " ");
//			sb.append(gen.nextInt(m)+1 + " ");
//			sb.append(gen.nextInt(1000000)+1 + " ");
//		}
//		INPUT = sb.toString();
//
		
		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");
//		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();
	}
	
	public static void main(String[] args) throws Exception { new E3().run(); }
	
	private 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 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 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 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[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	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