結果

問題 No.755 Zero-Sum Rectangle
ユーザー uwiuwi
提出日時 2018-12-03 01:08:05
言語 Java21
(openjdk 21)
結果
AC  
実行時間 448 ms / 2,000 ms
コード長 3,907 bytes
コンパイル時間 4,703 ms
コンパイル使用メモリ 86,436 KB
実行使用メモリ 42,072 KB
最終ジャッジ日時 2024-07-01 05:31:37
合計ジャッジ時間 9,418 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 55 ms
37,096 KB
testcase_01 AC 382 ms
41,320 KB
testcase_02 AC 429 ms
41,852 KB
testcase_03 AC 416 ms
41,912 KB
testcase_04 AC 423 ms
41,956 KB
testcase_05 AC 413 ms
41,864 KB
testcase_06 AC 447 ms
39,984 KB
testcase_07 AC 408 ms
42,072 KB
testcase_08 AC 448 ms
41,972 KB
testcase_09 AC 395 ms
41,816 KB
testcase_10 AC 336 ms
41,768 KB
testcase_11 AC 55 ms
36,824 KB
evil_1 AC 441 ms
42,168 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package adv2018;
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 Day3 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), m = ni();
		int[][] a = new int[m][];
		for(int i = 0;i < m;i++){
			a[i] = na(m);
		}
		
		long[][] cum = new long[m+1][m+1];
		for(int i = 0;i < m;i++){
			for(int j = 0;j < m;j++){
				cum[i+1][j+1] = cum[i][j+1] + cum[i+1][j] - cum[i][j] + a[i][j];
			}
		}
		
		int[][] hey = new int[m+1][m+1];
		for(int i = 0;i < m;i++){
			for(int j = 0;j < m;j++){
				for(int k = i+1;k <= m;k++){
					for(int l = j+1;l <= m;l++){
						if(cum[k][l] - cum[k][j] - cum[i][l] + cum[i][j] == 0){
							hey[i][j]++;
							hey[k][l]++;
							hey[i][l]--;
							hey[k][j]--;
						}
					}
				}
			}
		}
		
		long[][] ccum = new long[m+1][m+1];
		for(int i = 0;i < m;i++){
			for(int j = 0;j < m;j++){
				ccum[i+1][j+1] = ccum[i][j+1] + ccum[i+1][j] - ccum[i][j] + hey[i][j];
			}
		}
		
		for(int i = 0;i < n;i++){
			int r = ni()-1, c = ni()-1;
			out.println(ccum[r+1][c+1]);
		}
	}
	
	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 Day3().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