結果

問題 No.440 2次元チワワ問題
ユーザー 37zigen37zigen
提出日時 2016-10-29 00:32:54
言語 Java21
(openjdk 21)
結果
RE  
実行時間 -
コード長 3,310 bytes
コンパイル時間 4,436 ms
コンパイル使用メモリ 88,980 KB
実行使用メモリ 63,652 KB
最終ジャッジ日時 2024-11-24 06:54:51
合計ジャッジ時間 24,939 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 132 ms
41,316 KB
testcase_01 RE -
testcase_02 RE -
testcase_03 AC 138 ms
41,360 KB
testcase_04 RE -
testcase_05 RE -
testcase_06 RE -
testcase_07 RE -
testcase_08 RE -
testcase_09 RE -
testcase_10 RE -
testcase_11 RE -
testcase_12 RE -
testcase_13 RE -
testcase_14 RE -
testcase_15 RE -
testcase_16 AC 523 ms
48,584 KB
testcase_17 AC 1,369 ms
63,528 KB
testcase_18 AC 1,368 ms
63,360 KB
testcase_19 AC 1,336 ms
63,544 KB
testcase_20 AC 1,344 ms
63,548 KB
testcase_21 AC 1,776 ms
63,312 KB
testcase_22 AC 1,796 ms
63,652 KB
testcase_23 AC 1,610 ms
63,380 KB
testcase_24 AC 1,622 ms
63,240 KB
testcase_25 AC 1,024 ms
60,720 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package yukicoder;

import java.util.Arrays;
import java.util.Scanner;

import javax.swing.plaf.synth.SynthSpinnerUI;

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

	void run() {
		Scanner sc = new Scanner(System.in);
		int H = sc.nextInt();
		int W = sc.nextInt();
		char[][] map = new char[H][W];
		for (int i = 0; i < H; ++i) {
			map[i] = sc.next().toCharArray();
		}
		int Q = sc.nextInt();
		int[] a = new int[Q];
		int[] b = new int[Q];
		int[] c = new int[Q];
		int[] d = new int[Q];
		for (int i = 0; i < Q; ++i) {
			b[i] = sc.nextInt() - 1;
			a[i] = sc.nextInt() - 1;
			d[i] = sc.nextInt() - 1;
			c[i] = sc.nextInt() - 1;

		}
		long[] ans1 = solver(H, W,Q, map, a, b, c, d);
		
		char[][] aaa=new char[H][W];
		for(int i=0;i<W;++i){
			for(int j=0;j<H;++j){
				aaa[i][j]=map[i][W-j-1];
			}
		}
		char[][] map2=new char[H][W];
		for(int i=0;i<W;++i){
			for(int j=0;j<H;++j){
				map2[i][j]=aaa[H-i-1][j];
			}
		}
		
		int[] a2=new int[Q];
		int[] b2=new int[Q];
		int[] c2=new int[Q];
		int[] d2=new int[Q];
		for(int i=0;i<Q;++i){
			a2[i]=W-a[i]-1;
			c2[i]=W-c[i]-1;
			b2[i]=H-b[i]-1;
			d2[i]=H-d[i]-1;
		}
		long[] ans2=solver(H,W,Q,map2,c2,d2,a2,b2);
		for(int i=0;i<Q;++i){
			System.out.println(ans1[i]+ans2[i]);
		}
	}

	long[] solver(int H, int W, int Q,char[][] map, int[] a, int[] b, int[] c, int[] d) {
		int[][] WsV = new int[W][H];
		int[][] WsH = new int[H][W];
		long[][] CWsV = new long[W][H];
		long[][] CWsH = new long[H][W];
		long[][] CWWsV = new long[W][H];
		long[][] CWWsH = new long[H][W];
		for (int i = 0; i < W; ++i) {
			for (int j = 0; j < H; ++j) {
				WsV[i][j] = (j > 0 ? WsV[i][j - 1] : 0) + (map[j][i] == 'w' ? 1 : 0);
				if (j > 0)
					CWsV[i][j] = CWsV[i][j - 1] + (map[j][i] == 'w' ? (j - WsV[i][j - 1]) : 0);
				if (j > 1) {
					CWWsV[i][j] = CWWsV[i][j - 1];
					if (map[j][i] == 'w')
						CWWsV[i][j] += CWsV[i][j - 1];
				}
			}
		}

		for (int i = 0; i < H; ++i) {
			for (int j = 0; j < W; ++j) {
				WsH[i][j] = (j > 0 ? WsH[i][j - 1] : 0) + (map[i][j] == 'w' ? 1 : 0);// ok
				if (j > 0)
					CWsH[i][j] = CWsH[i][j - 1] + (map[i][j] == 'w' ? (j - WsH[i][j - 1]) : 0);// ok
				if (j > 1) {
					CWWsH[i][j] = CWWsH[i][j - 1];
					if (map[i][j] == 'w')
						CWWsH[i][j] += CWsH[i][j - 1];
				}
			}
		}

		long ans[] = new long[Q];
		for (int i = 0; i < Q; ++i) {
			for (int x = a[i]; x <= c[i]; ++x) {
				ans[i] += CWWsV[x][d[i]] - (b[i] > 0 ? CWWsV[x][b[i] - 1] : 0);
				ans[i] -= (b[i] - (b[i] > 0 ? WsV[x][b[i] - 1] : 0))
						* (WsV[x][d[i]] - (b[i] > 0 ? WsV[x][b[i] - 1] : 0))
						* (WsV[x][d[i]] - (b[i] > 0 ? WsV[x][b[i] - 1] : 0) - 1) / 2;// [c][ww]
				ans[i] -= (b[i] > 0 ? CWsV[x][b[i] - 1] : 0) * (WsV[x][d[i]] - (b[i] > 0 ? WsV[x][b[i] - 1] : 0));// [cw][w]
			}
			for (int y = b[i]; y <= d[i]; ++y) {
				ans[i] += CWWsH[y][c[i]] - (a[i] > 0 ? CWWsH[y][a[i] - 1] : 0);
				ans[i] -= (a[i] - (a[i] > 0 ? WsH[y][a[i] - 1] : 0))
						* (WsH[y][c[i]] - (a[i] > 0 ? WsH[y][a[i] - 1] : 0))
						* (WsH[y][c[i]] - (a[i] > 0 ? WsH[y][a[i] - 1] : 0) - 1) / 2;
				ans[i] -= (a[i] > 0 ? CWsH[y][a[i] - 1] : 0) * (WsH[y][c[i]] - (a[i] > 0 ? WsH[y][a[i] - 1] : 0));
			}
		}
		return ans;
	}

	void tr(Object... objects) {
		System.out.println(Arrays.deepToString(objects));
	}
}
0