結果

問題 No.440 2次元チワワ問題
ユーザー tanzakutanzaku
提出日時 2016-10-29 00:50:18
言語 Java21
(openjdk 21)
結果
TLE  
実行時間 -
コード長 6,600 bytes
コンパイル時間 2,409 ms
コンパイル使用メモリ 90,496 KB
実行使用メモリ 85,256 KB
最終ジャッジ日時 2024-11-24 07:01:20
合計ジャッジ時間 43,638 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 49 ms
57,612 KB
testcase_01 AC 50 ms
85,256 KB
testcase_02 AC 51 ms
42,504 KB
testcase_03 AC 52 ms
84,368 KB
testcase_04 AC 55 ms
37,112 KB
testcase_05 AC 52 ms
37,224 KB
testcase_06 AC 51 ms
37,152 KB
testcase_07 AC 217 ms
40,636 KB
testcase_08 AC 513 ms
41,536 KB
testcase_09 AC 1,190 ms
46,628 KB
testcase_10 AC 191 ms
40,576 KB
testcase_11 AC 247 ms
41,856 KB
testcase_12 AC 251 ms
43,936 KB
testcase_13 AC 1,398 ms
47,144 KB
testcase_14 AC 86 ms
40,868 KB
testcase_15 AC 1,332 ms
45,120 KB
testcase_16 AC 125 ms
41,440 KB
testcase_17 AC 2,298 ms
48,276 KB
testcase_18 AC 1,839 ms
48,448 KB
testcase_19 AC 618 ms
47,324 KB
testcase_20 AC 1,443 ms
48,160 KB
testcase_21 TLE -
testcase_22 AC 3,849 ms
47,868 KB
testcase_23 TLE -
testcase_24 TLE -
testcase_25 TLE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.math.*;
import java.util.*;
import java.util.Map.Entry;

import static java.util.Arrays.*;

public class Main {
	private static final int mod = (int)1e9+7;

	final Random random = new Random(0);
	final IOFast io = new IOFast();

	/// MAIN CODE
	public void run() throws IOException {
//		int TEST_CASE = Integer.parseInt(new String(io.nextLine()).trim());
		int TEST_CASE = 1;
		while(TEST_CASE-- != 0) {
			int h = io.nextInt();
			int w = io.nextInt();

			char[][] cs = new char[h][];
			for (int i = 0; i < h; i++) {
				cs[i] = io.next();
			}

			int[][] sum_x = new int[h][w+1];
			int[][] sum_y = new int[w][h+1];
			for (int i = 0; i < h; i++) {
				for (int j = 0; j < w; j++) {
					sum_x[i][j+1] = sum_x[i][j] + (cs[i][j] == 'w' ? 1 : 0);
					sum_y[j][i+1] = sum_y[j][i] + (cs[i][j] == 'w' ? 1 : 0);
				}
			}

			int Q = io.nextInt();
			int[][] qs = io.nextIntArray2D(Q, 4);
			for (int i = 0; i < Q; i++) {
				int y1 = qs[i][0] - 1;
				int x1 = qs[i][1] - 1;
				int y2 = qs[i][2] - 1;
				int x2 = qs[i][3] - 1;
				long ans = 0;
				for (int y = y1; y <= y2; y++) {
					for (int x = x1; x <= x2; x++) if (cs[y][x] == 'c') {
						ans += f(sum_x[y][x] - sum_x[y][x1]);
						ans += f(sum_x[y][x2+1] - sum_x[y][x+1]);
						ans += f(sum_y[x][y] - sum_y[x][y1]);
						ans += f(sum_y[x][y2+1] - sum_y[x][y+1]);
//						if (i == 0) {
//							dump(i, x, y, y2, sum_y[x][y+1], sum_y[x][y2+1], ans);
//						}
					}
				}
				io.out.println(ans);
			}
		}
	}
	
	long f(long n) {
		return n * (n - 1) / 2;
	}
	
	/// TEMPLATE
	static int gcd(int n, int r) { return r == 0 ? n : gcd(r, n%r); }
	static long gcd(long n, long r) { return r == 0 ? n : gcd(r, n%r); }
	
	static <T> void swap(T[] x, int i, int j) { T t = x[i]; x[i] = x[j]; x[j] = t; }
	static void swap(int[] x, int i, int j) { int t = x[i]; x[i] = x[j]; x[j] = t; }

	void printArrayLn(int[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); }
	void printArrayLn(long[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); }
	
	static void dump(Object... o) { System.err.println(Arrays.deepToString(o)); } 
	
	void main() throws IOException {
		//		IOFast.setFileIO("rle-size.in", "rle-size.out");
		try { run(); }
		catch (EndOfFileRuntimeException e) { }
		io.out.flush();
	}
	public static void main(String[] args) throws IOException { new Main().main(); }
	
	static class EndOfFileRuntimeException extends RuntimeException {
		private static final long serialVersionUID = -8565341110209207657L; }

	static
	public class IOFast {
		private BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		private PrintWriter out = new PrintWriter(System.out);

		void setFileIn(String ins) throws IOException { in.close(); in = new BufferedReader(new FileReader(ins)); }
		void setFileOut(String outs) throws IOException { out.flush(); out.close(); out = new PrintWriter(new FileWriter(outs)); }
		void setFileIO(String ins, String outs) throws IOException { setFileIn(ins); setFileOut(outs); }

		private static int pos, readLen;
		private static final char[] buffer = new char[1024 * 8];
		private static char[] str = new char[500*8*2];
		private static boolean[] isDigit = new boolean[256];
		private static boolean[] isSpace = new boolean[256];
		private static boolean[] isLineSep = new boolean[256];

		static { for(int i = 0; i < 10; i++) { isDigit['0' + i] = true; } isDigit['-'] = true; isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true; isLineSep['\r'] = isLineSep['\n'] = true; }
		public int read() throws IOException { if(pos >= readLen) { pos = 0; readLen = in.read(buffer); if(readLen <= 0) { throw new EndOfFileRuntimeException(); } } return buffer[pos++]; }
		public int nextInt() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; int ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
		public long nextLong() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; long ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
		public char nextChar() throws IOException { while(true) { final int c = read(); if(!isSpace[c]) { return (char)c; } } }
		int reads(int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } if(str.length == len) { char[] rep = new char[str.length * 3 / 2]; System.arraycopy(str, 0, rep, 0, str.length); str = rep; } str[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
		int reads(char[] cs, int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } cs[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
		public char[] nextLine() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isLineSep); try { if(str[len-1] == '\r') { len--; read(); } } catch(EndOfFileRuntimeException e) { ; } return Arrays.copyOf(str, len); }
		public String nextString() throws IOException { return new String(next()); }
		public char[] next() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); return Arrays.copyOf(str, len); }
//		public int next(char[] cs) throws IOException { int len = 0; cs[len++] = nextChar(); len = reads(cs, len, isSpace); return len; }
		public double nextDouble() throws IOException { return Double.parseDouble(nextString()); }
		public long[] nextLongArray(final int n) throws IOException { final long[] res = new long[n]; for(int i = 0; i < n; i++) { res[i] = nextLong(); } return res; }
		public int[] nextIntArray(final int n) throws IOException { final int[] res = new int[n]; for(int i = 0; i < n; i++) { res[i] = nextInt(); } return res; }
		public int[][] nextIntArray2D(final int n, final int k) throws IOException { final int[][] res = new int[n][]; for(int i = 0; i < n; i++) { res[i] = nextIntArray(k); } return res; }
		public int[][] nextIntArray2DWithIndex(final int n, final int k) throws IOException { final int[][] res = new int[n][k+1]; for(int i = 0; i < n; i++) { for(int j = 0; j < k; j++) { res[i][j] = nextInt(); } res[i][k] = i; } return res; }
		public double[] nextDoubleArray(final int n) throws IOException { final double[] res = new double[n]; for(int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; }
	}
}
0