Submission #183449
Source Code Expand
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 Main { static InputStream is; static PrintWriter out; static String INPUT = ""; static void solve() { int n = ni(), m = ni(); int[][] a = new int[n][]; for(int i = 0;i < n;i++){ a[i] = na(m); } int[][] bl = new int[n+1][m+1]; int[][] wh = new int[n+1][m+1]; for(int i = 0;i < n;i++){ for(int j = 0;j < m;j++){ if((i+j)%2 == 0){ bl[i+1][j+1] = a[i][j]; }else{ wh[i+1][j+1] = a[i][j]; } } } for(int i = 1;i <= n;i++){ for(int j = 1;j <= m;j++){ bl[i][j] += bl[i][j-1] + bl[i-1][j] - bl[i-1][j-1]; wh[i][j] += wh[i][j-1] + wh[i-1][j] - wh[i-1][j-1]; } } int max = 0; for(int i = 0;i < n;i++){ for(int j = 0;j < m;j++){ for(int k = i;k < n;k++){ for(int l = j;l < m;l++){ int q = (bl[k+1][l+1] - bl[i][l+1] - bl[k+1][j] + bl[i][j]) - (wh[k+1][l+1] - wh[i][l+1] - wh[k+1][j] + wh[i][j]); if(q == 0){ max = Math.max(max, (k-i+1)*(l-j+1)); } } } } } out.println(max); } public static void main(String[] args) throws Exception { long S = System.currentTimeMillis(); is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); solve(); out.flush(); long G = System.currentTimeMillis(); tr(G-S+"ms"); } private static boolean eof() { if(lenbuf == -1)return true; int lptr = ptrbuf; while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false; try { is.mark(1000); while(true){ int b = is.read(); if(b == -1){ is.reset(); return true; }else if(!isSpaceChar(b)){ is.reset(); return false; } } } catch (IOException e) { return true; } } private static byte[] inbuf = new byte[1024]; static int lenbuf = 0, ptrbuf = 0; private static 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 static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } // private static boolean isSpaceChar(int c) { return !(c >= 32 && c <= 126); } private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private static double nd() { return Double.parseDouble(ns()); } private static char nc() { return (char)skip(); } private static String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private static 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 static 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 static int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private static int ni() { int num = 0, 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 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) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); } }
Submission Info
Submission Time | |
---|---|
Task | B - チョコレート |
User | uwi |
Language | Java (OpenJDK 1.7.0) |
Score | 100 |
Code Size | 4365 Byte |
Status | AC |
Exec Time | 827 ms |
Memory | 23348 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample-01.txt, subtask0_sample-02.txt, subtask0_sample-03.txt, subtask0_sample-04.txt, subtask0_sample-05.txt |
All | subtask0_sample-01.txt, subtask0_sample-02.txt, subtask0_sample-03.txt, subtask0_sample-04.txt, subtask0_sample-05.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample-01.txt | AC | 409 ms | 20792 KB |
subtask0_sample-02.txt | AC | 378 ms | 20660 KB |
subtask0_sample-03.txt | AC | 380 ms | 20660 KB |
subtask0_sample-04.txt | AC | 375 ms | 20656 KB |
subtask0_sample-05.txt | AC | 377 ms | 20788 KB |
subtask1_01.txt | AC | 391 ms | 20656 KB |
subtask1_02.txt | AC | 379 ms | 20556 KB |
subtask1_03.txt | AC | 385 ms | 20660 KB |
subtask1_04.txt | AC | 383 ms | 20652 KB |
subtask1_05.txt | AC | 398 ms | 21164 KB |
subtask1_06.txt | AC | 421 ms | 21928 KB |
subtask1_07.txt | AC | 374 ms | 20660 KB |
subtask1_08.txt | AC | 409 ms | 21096 KB |
subtask1_09.txt | AC | 772 ms | 22324 KB |
subtask1_10.txt | AC | 454 ms | 22000 KB |
subtask1_11.txt | AC | 780 ms | 23232 KB |
subtask1_12.txt | AC | 766 ms | 23068 KB |
subtask1_13.txt | AC | 766 ms | 23348 KB |
subtask1_14.txt | AC | 791 ms | 23348 KB |
subtask1_15.txt | AC | 827 ms | 22472 KB |
subtask1_16.txt | AC | 758 ms | 22780 KB |
subtask1_17.txt | AC | 700 ms | 22312 KB |
subtask1_18.txt | AC | 377 ms | 20656 KB |
subtask1_19.txt | AC | 401 ms | 20964 KB |
subtask1_20.txt | AC | 779 ms | 22452 KB |