結果

問題 No.440 2次元チワワ問題
ユーザー uwiuwi
提出日時 2016-10-28 22:59:47
言語 Java21
(openjdk 21)
結果
AC  
実行時間 2,097 ms / 5,000 ms
コード長 4,332 bytes
コンパイル時間 4,026 ms
コンパイル使用メモリ 87,460 KB
実行使用メモリ 48,932 KB
最終ジャッジ日時 2024-11-24 06:13:13
合計ジャッジ時間 22,025 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 49 ms
36,828 KB
testcase_01 AC 48 ms
37,096 KB
testcase_02 AC 48 ms
36,864 KB
testcase_03 AC 48 ms
36,612 KB
testcase_04 AC 61 ms
37,468 KB
testcase_05 AC 51 ms
36,892 KB
testcase_06 AC 50 ms
36,528 KB
testcase_07 AC 238 ms
40,944 KB
testcase_08 AC 363 ms
45,404 KB
testcase_09 AC 859 ms
48,508 KB
testcase_10 AC 266 ms
45,196 KB
testcase_11 AC 201 ms
41,224 KB
testcase_12 AC 318 ms
41,516 KB
testcase_13 AC 1,122 ms
47,676 KB
testcase_14 AC 90 ms
38,476 KB
testcase_15 AC 1,217 ms
48,396 KB
testcase_16 AC 113 ms
40,416 KB
testcase_17 AC 2,097 ms
48,732 KB
testcase_18 AC 1,235 ms
46,764 KB
testcase_19 AC 1,149 ms
46,972 KB
testcase_20 AC 1,413 ms
48,676 KB
testcase_21 AC 1,443 ms
48,916 KB
testcase_22 AC 1,059 ms
47,028 KB
testcase_23 AC 1,269 ms
46,632 KB
testcase_24 AC 1,512 ms
48,728 KB
testcase_25 AC 1,359 ms
48,932 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest161028;
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 E {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), m = ni();
		char[][] map = nm(n,m);
		
		int Q = ni();
		int[][] qs = new int[Q][];
		long[] rets = new long[Q];
		for(int z = 0;z < Q;z++){
			int r1 = ni()-1, c1 = ni()-1;
			int r2 = ni()-1, c2 = ni()-1;
			qs[z] = new int[]{r1, c1, r2, c2};
		}
		
		for(int rot = 0;rot < 4;rot++){
			int[][] temp = new int[m][m];
			for(int i = 0;i < n;i++){
				for(int j = 0;j < m;j++){
					int w = 0;
					for(int k = j;k < m;k++){
						temp[j][k] = k == j ? 0 : temp[j][k-1];
						if(map[i][k] == 'w'){
							w++;
						}else{
							temp[j][k] += w*(w-1)/2;
						}
					}
				}
				for(int z = 0;z < Q;z++){
					if(qs[z][0] <= i && i <= qs[z][2]){
						rets[z] += temp[qs[z][1]][qs[z][3]];
					}
				}
			}
//			tr("ret", rets);
			
			map = rot(map);
			for(int z = 0;z < Q;z++){
				int r1 = qs[z][0], r2 = qs[z][2];
				int c1 = qs[z][1], c2 = qs[z][3];
				qs[z][0] = c1;
				qs[z][2] = c2;
				qs[z][1] = n-1-r2; qs[z][3] = n-1-r1;
			}
			int d = n; n = m; m = d;
//			for(char[] u : map){
//				tr(new String(u));
//			}
		}
		for(long r : rets){
			out.println(r);
		}
	}
	
	public static char[][] rot(char[][] a)
	{
		int n = a.length, m = a[0].length;
		char[][] b = new char[m][n];
		for(int i = 0;i < n;i++){
			for(int j = 0;j < m;j++){
				b[j][n-1-i] = a[i][j];
			}
		}
		return b;
	}

	
	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");
//		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 E().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