結果
問題 | No.866 レベルKの正方形 |
ユーザー | uwi |
提出日時 | 2019-08-16 22:01:00 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 4,615 ms / 6,000 ms |
コード長 | 4,427 bytes |
コンパイル時間 | 3,816 ms |
コンパイル使用メモリ | 80,484 KB |
実行使用メモリ | 475,532 KB |
最終ジャッジ日時 | 2024-09-22 16:33:49 |
合計ジャッジ時間 | 62,865 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 54 ms
50,348 KB |
testcase_01 | AC | 53 ms
50,332 KB |
testcase_02 | AC | 54 ms
50,280 KB |
testcase_03 | AC | 53 ms
50,504 KB |
testcase_04 | AC | 54 ms
50,552 KB |
testcase_05 | AC | 54 ms
50,488 KB |
testcase_06 | AC | 54 ms
50,532 KB |
testcase_07 | AC | 54 ms
50,380 KB |
testcase_08 | AC | 4,065 ms
475,264 KB |
testcase_09 | AC | 4,154 ms
475,280 KB |
testcase_10 | AC | 4,269 ms
475,288 KB |
testcase_11 | AC | 4,288 ms
475,424 KB |
testcase_12 | AC | 4,615 ms
475,328 KB |
testcase_13 | AC | 4,064 ms
475,500 KB |
testcase_14 | AC | 4,495 ms
475,312 KB |
testcase_15 | AC | 4,263 ms
475,264 KB |
testcase_16 | AC | 4,566 ms
475,432 KB |
testcase_17 | AC | 4,425 ms
475,208 KB |
testcase_18 | AC | 4,174 ms
475,532 KB |
testcase_19 | AC | 4,069 ms
475,372 KB |
testcase_20 | AC | 3,782 ms
475,452 KB |
testcase_21 | AC | 1,684 ms
475,416 KB |
testcase_22 | AC | 53 ms
50,468 KB |
testcase_23 | AC | 53 ms
50,228 KB |
testcase_24 | AC | 57 ms
50,488 KB |
ソースコード
package contest190816;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 D2 {InputStream is;PrintWriter out;String INPUT = "";void solve(){int n = ni(), m = ni(), K = ni();char[][] map = nm(n, m);int I = 999999999;int[][][] all = new int[26][][];for(int u = 0;u < 26;u++){int[][] dp = new int[n+1][m+1];for(int i = 0;i <= n;i++){for(int j = 0;j <= m;j++){if(i == n || j == m){dp[i][j] = I;}else{dp[i][j] = map[i][j]-'a' == u ? 0 : I;}}}for(int i = n-1;i >= 0;i--){for(int j = m-1;j >= 0;j--){int v = dp[i][j];if(dp[i+1][j] + 1 < v)v = dp[i+1][j] + 1;if(dp[i][j+1] + 1 < v)v = dp[i][j+1] + 1;if(dp[i+1][j+1] + 1 < v)v = dp[i+1][j+1] + 1;dp[i][j] = v;}}all[u] = dp;}long ret = 0;int[] temp = new int[26];for(int i = 0;i < n;i++){for(int j = 0;j < m;j++){for(int k = 0;k < 26;k++){temp[k] = all[k][i][j];}Arrays.sort(temp);int upper = K == 26 ? 999999999 : temp[K];int lower = temp[K-1];upper = Math.min(upper, n-i);upper = Math.min(upper, m-j);ret += Math.max(0, upper-lower);}}out.println(ret);}void run() throws Exception{// int n = 2000, m = 2000;// Random gen = new Random();// StringBuilder sb = new StringBuilder();// sb.append(n + " ");// sb.append(m + " ");// sb.append(26 + " ");// for (int i = 0; i < n; i++) {// for(int j = 0;j < m;j++){// sb.append((char)(gen.nextInt(26)+'a'));// }// sb.append("\n");// }// INPUT = sb.toString();//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 D2().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)); }}