結果

問題 No.755 Zero-Sum Rectangle
ユーザー GrenacheGrenache
提出日時 2019-05-08 23:33:08
言語 Java21
(openjdk 21)
結果
AC  
実行時間 701 ms / 2,000 ms
コード長 4,805 bytes
コンパイル時間 4,020 ms
コンパイル使用メモリ 75,512 KB
実行使用メモリ 54,084 KB
最終ジャッジ日時 2023-09-14 17:29:04
合計ジャッジ時間 12,865 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 46 ms
49,488 KB
testcase_01 AC 422 ms
53,432 KB
testcase_02 AC 468 ms
53,240 KB
testcase_03 AC 600 ms
53,424 KB
testcase_04 AC 663 ms
53,128 KB
testcase_05 AC 701 ms
53,268 KB
testcase_06 AC 465 ms
53,640 KB
testcase_07 AC 442 ms
53,620 KB
testcase_08 AC 602 ms
53,660 KB
testcase_09 AC 289 ms
54,084 KB
testcase_10 AC 325 ms
53,752 KB
testcase_11 AC 49 ms
49,576 KB
evil_1 TLE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.NoSuchElementException;


public class Main_yukicoder755 {

	private static Scanner sc;
	private static Printer pr;

	private static void solve() {
		int n = sc.nextInt();
		int m = sc.nextInt();

		int[][] a = new int[m][m];
		for (int i = 0; i < m; i++) {
			for (int j = 0; j < m; j++) {
				a[i][j] = sc.nextInt();
			}
		}

		int[] x = new int[n];
		int[] y = new int[n];
		for (int i = 0; i < n; i++) {
			x[i] = sc.nextInt();
			y[i] = sc.nextInt();
		}

		long[][] aa = new long[m + 1][m + 1];
		for (int i = 0; i < m; i++) {
			for (int j = 0; j < m; j++) {
				aa[i + 1][j + 1] = aa[i + 1][j] + a[i][j];
			}
			for (int j = 1; j <= m; j++) {
				aa[i + 1][j] += aa[i][j];
			}
		}
		
		for (int i = 0; i < n; i++) {
			long ans = 0;
			for (int xx = 1; xx <= x[i]; xx++) {
				for (int yy = 1; yy <= y[i]; yy++) {
					for (int xx2 = x[i]; xx2 <= m; xx2++) {
						for (int yy2 = y[i]; yy2 <= m; yy2++) {
							long tmp = aa[xx2][yy2] - aa[xx2][yy - 1] - aa[xx - 1][yy2] + aa[xx - 1][yy - 1];
							if (tmp == 0) {
								ans++;
							}
						}
					}
				}
			}
			
			pr.println(ans);
		}
	}

	// ---------------------------------------------------
	public static void main(String[] args) {
		sc = new Scanner(System.in);
		pr = new Printer(System.out);
			
		solve();
			
		pr.close();
		sc.close();
	}

	static class Scanner {
		BufferedReader br;

		Scanner (InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}

		private boolean isPrintable(int ch) {
			return ch >= '!' && ch <= '~';
		}

		private boolean isCRLF(int ch) {
			return ch == '\n' || ch == '\r' || ch == -1;
		}

		private int nextPrintable() {
			try {
				int ch;
				while (!isPrintable(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}

				return ch;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		String next() {
			try {
				int ch = nextPrintable();
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (isPrintable(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		int nextInt() {
			try {
				// parseInt from Integer.parseInt()
				boolean negative = false;
				int res = 0;
				int limit = -Integer.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Integer.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				int multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		long nextLong() {
			try {
				// parseLong from Long.parseLong()
				boolean negative = false;
				long res = 0;
				long limit = -Long.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Long.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				long multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		float nextFloat() {
			return Float.parseFloat(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			try {
				int ch;
				while (isCRLF(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (!isCRLF(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		void close() {
			try {
				br.close();
			} catch (IOException e) {
//				throw new NoSuchElementException();
			}
		}
	}

	static class Printer extends PrintWriter {
		Printer(OutputStream out) {
			super(out);
		}
	}
}
0