結果

問題 No.440 2次元チワワ問題
コンテスト
ユーザー 37zigen
提出日時 2016-10-29 00:39:21
言語 Java
(openjdk 23)
結果
CE  
(最新)
AC  
(最初)
実行時間 -
コード長 3,553 bytes
コンパイル時間 2,083 ms
コンパイル使用メモリ 80,280 KB
最終ジャッジ日時 2024-11-14 19:53:19
合計ジャッジ時間 3,049 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。

コンパイルメッセージ
Main.java:7: error: package org.omg.Messaging does not exist
import org.omg.Messaging.SyncScopeHelper;
                        ^
2 errors

ソースコード

diff # 

package yukicoder;

import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

import org.omg.Messaging.SyncScopeHelper;

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] = Integer.parseInt(sc.next()) - 1;
			a[i] = Integer.parseInt(sc.next()) - 1;
			d[i] = Integer.parseInt(sc.next()) - 1;
			c[i] = Integer.parseInt(sc.next()) - 1;

		}
		long[] ans1 = solver(H, W, Q, map, a, b, c, d);

		char[][] aaa = new char[H][W];
		for (int i = 0; i < H; ++i) {
			for (int j = 0; j < W; ++j) {
				aaa[i][j] = map[i][W - j - 1];
			}
		}
		char[][] map2 = new char[H][W];
		for (int i = 0; i < H; ++i) {
			for (int j = 0; j < W; ++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);
		PrintWriter pw = new PrintWriter(System.out);
		for (int i = 0; i < Q; ++i) {
			pw.println(ans1[i] + ans2[i]);
		}
		pw.close();
	}

	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