結果

問題 No.755 Zero-Sum Rectangle
ユーザー hiromi_ayase
提出日時 2018-12-03 03:48:24
言語 Java
(openjdk 23)
結果
WA  
(最新)
AC  
(最初)
実行時間 -
コード長 3,271 bytes
コンパイル時間 2,848 ms
コンパイル使用メモリ 89,860 KB
実行使用メモリ 58,508 KB
最終ジャッジ日時 2024-07-01 05:34:02
合計ジャッジ時間 11,672 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 10 WA * 1 TLE * 1
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

public class Main {
  private static void solve() {
    int n = ni();
    int m = ni();
    int[][] a = ntable(m, m);
    int[][] sum = new int[m + 1][m + 1];
    for (int i = 0; i < m; i ++) {
      for (int j = 0; j < m; j ++) {
        sum[i + 1][j + 1] += sum[i + 1][j] + a[i][j];
      }
      if (i > 0) {
        for (int j = 0; j <= m; j ++) {
          sum[i + 1][j] += sum[i][j];
        }
      }
    }
    
    for (int i = 0; i < n; i ++) {
      int x = ni();
      int y = ni();
      
      int ret = 0;
      for (int x1 = 0; x1 < x; x1 ++) {
        for (int y1 = 0; y1 < y; y1 ++) {
          for (int x2 = x; x2 <= m; x2 ++) {
            for (int y2 = y; y2 <= m; y2 ++) {
              int now = sum[x2][y2] - sum[x1][y2] - sum[x2][y1] + sum[x1][y1];
              if (now == 0) {
                ret ++;
              }
            }
          }
        }
      }
      System.out.println(ret);
    }
  }
  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = args.length > 0 ? args[0] : null;
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }
  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;
  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }
  private static double nd() {
    return Double.parseDouble(next());
  }
  private static long nl() {
    return Long.parseLong(next());
  }
  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }
  private static char[] ns() {
    return next().toCharArray();
  }
  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = nl();
    return a;
  }
  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }
  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }
  private static int ni() {
    return Integer.parseInt(next());
  }
  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0