結果
問題 | No.440 2次元チワワ問題 |
ユーザー | uwi |
提出日時 | 2016-10-29 05:11:08 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 947 ms / 5,000 ms |
コード長 | 5,041 bytes |
コンパイル時間 | 4,915 ms |
コンパイル使用メモリ | 84,932 KB |
実行使用メモリ | 51,576 KB |
最終ジャッジ日時 | 2024-05-03 08:41:19 |
合計ジャッジ時間 | 15,813 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 49 ms
37,068 KB |
testcase_01 | AC | 48 ms
36,944 KB |
testcase_02 | AC | 51 ms
37,048 KB |
testcase_03 | AC | 51 ms
36,940 KB |
testcase_04 | AC | 53 ms
37,692 KB |
testcase_05 | AC | 53 ms
37,352 KB |
testcase_06 | AC | 50 ms
37,076 KB |
testcase_07 | AC | 284 ms
46,456 KB |
testcase_08 | AC | 454 ms
47,760 KB |
testcase_09 | AC | 580 ms
49,388 KB |
testcase_10 | AC | 289 ms
45,660 KB |
testcase_11 | AC | 347 ms
46,620 KB |
testcase_12 | AC | 250 ms
47,096 KB |
testcase_13 | AC | 590 ms
49,728 KB |
testcase_14 | AC | 106 ms
41,060 KB |
testcase_15 | AC | 584 ms
50,564 KB |
testcase_16 | AC | 162 ms
43,328 KB |
testcase_17 | AC | 729 ms
51,440 KB |
testcase_18 | AC | 754 ms
49,884 KB |
testcase_19 | AC | 674 ms
50,184 KB |
testcase_20 | AC | 706 ms
51,576 KB |
testcase_21 | AC | 936 ms
51,568 KB |
testcase_22 | AC | 839 ms
49,848 KB |
testcase_23 | AC | 768 ms
50,012 KB |
testcase_24 | AC | 947 ms
51,336 KB |
testcase_25 | AC | 915 ms
51,348 KB |
ソースコード
package contest161028; 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 E2 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(), m = ni(); char[][] map = nm(n,m); int Q = ni(); int[][] qs = new int[Q][]; long[] rets = new long[Q]; for(int z = 0;z < Q;z++){ int r1 = ni()-1, c1 = ni()-1; int r2 = ni()-1, c2 = ni()-1; qs[z] = new int[]{r1, c1, r2, c2}; } for(int rot = 0;rot < 4;rot++){ for(int i = 0;i < n;i++){ RangeSubsequenceCounter rsc = new RangeSubsequenceCounter(map[i], "cww".toCharArray()); for(int z = 0;z < Q;z++){ if(qs[z][0] <= i && i <= qs[z][2]){ rets[z] += rsc.count(qs[z][1], qs[z][3]+1); } } } map = rot(map); for(int z = 0;z < Q;z++){ int r1 = qs[z][0], r2 = qs[z][2]; int c1 = qs[z][1], c2 = qs[z][3]; qs[z][0] = c1; qs[z][2] = c2; qs[z][1] = n-1-r2; qs[z][3] = n-1-r1; } int d = n; n = m; m = d; // for(char[] u : map){ // tr(new String(u)); // } } for(long r : rets){ out.println(r); } } public static char[][] rot(char[][] a) { int n = a.length, m = a[0].length; char[][] b = new char[m][n]; for(int i = 0;i < n;i++){ for(int j = 0;j < m;j++){ b[j][n-1-i] = a[i][j]; } } return b; } public static class RangeSubsequenceCounter { public char[] s; public char[] q; public long[][][] dp; public long[] numsuffix; public RangeSubsequenceCounter(char[] s, char[] q) { assert q != null; assert q.length > 0; this.s = s; this.q = q; int n = s.length, m = q.length; dp = new long[m][m+1][n+1]; for(int i = 0;i < m;i++){ Arrays.fill(dp[i][i], 1); for(int j = i;j < m;j++){ for(int k = 0;k < n;k++){ dp[i][j+1][k+1] = dp[i][j+1][k]; if(s[k] == q[j])dp[i][j+1][k+1] += dp[i][j][k]; } } } numsuffix = new long[m]; } public long count(int l, int r) { int m = q.length; for(int i = m-1;i >= 0;i--){ long val = dp[i][m][r]-dp[i][m][l]; for(int j = i+1;j <= m-1;j++){ // [i,j) [j,m) val -= dp[i][j][l]*numsuffix[j]; } numsuffix[i] = val; } return numsuffix[0]; } } 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 E2().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)); } }