結果
問題 | No.852 連続部分文字列 |
ユーザー | uwi |
提出日時 | 2019-07-26 21:24:22 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 591 ms / 3,153 ms |
コード長 | 3,704 bytes |
コンパイル時間 | 4,120 ms |
コンパイル使用メモリ | 86,636 KB |
実行使用メモリ | 59,060 KB |
最終ジャッジ日時 | 2024-07-02 06:36:13 |
合計ジャッジ時間 | 17,352 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 123 ms
53,936 KB |
testcase_01 | AC | 123 ms
54,080 KB |
testcase_02 | AC | 123 ms
54,076 KB |
testcase_03 | AC | 126 ms
53,672 KB |
testcase_04 | AC | 122 ms
53,896 KB |
testcase_05 | AC | 122 ms
53,924 KB |
testcase_06 | AC | 122 ms
53,928 KB |
testcase_07 | AC | 124 ms
53,760 KB |
testcase_08 | AC | 121 ms
53,788 KB |
testcase_09 | AC | 124 ms
53,956 KB |
testcase_10 | AC | 124 ms
53,896 KB |
testcase_11 | AC | 125 ms
53,632 KB |
testcase_12 | AC | 123 ms
53,940 KB |
testcase_13 | AC | 191 ms
57,052 KB |
testcase_14 | AC | 170 ms
56,836 KB |
testcase_15 | AC | 209 ms
57,596 KB |
testcase_16 | AC | 183 ms
57,272 KB |
testcase_17 | AC | 208 ms
57,308 KB |
testcase_18 | AC | 214 ms
57,124 KB |
testcase_19 | AC | 143 ms
56,024 KB |
testcase_20 | AC | 174 ms
56,536 KB |
testcase_21 | AC | 219 ms
57,276 KB |
testcase_22 | AC | 172 ms
56,788 KB |
testcase_23 | AC | 188 ms
56,868 KB |
testcase_24 | AC | 174 ms
57,088 KB |
testcase_25 | AC | 177 ms
56,736 KB |
testcase_26 | AC | 218 ms
57,448 KB |
testcase_27 | AC | 209 ms
56,980 KB |
testcase_28 | AC | 215 ms
57,048 KB |
testcase_29 | AC | 221 ms
57,372 KB |
testcase_30 | AC | 168 ms
56,924 KB |
testcase_31 | AC | 198 ms
56,892 KB |
testcase_32 | AC | 216 ms
57,300 KB |
testcase_33 | AC | 528 ms
58,856 KB |
testcase_34 | AC | 589 ms
58,808 KB |
testcase_35 | AC | 574 ms
58,888 KB |
testcase_36 | AC | 591 ms
59,060 KB |
testcase_37 | AC | 587 ms
58,920 KB |
testcase_38 | AC | 524 ms
58,916 KB |
testcase_39 | AC | 587 ms
58,944 KB |
testcase_40 | AC | 590 ms
58,920 KB |
testcase_41 | AC | 565 ms
58,824 KB |
testcase_42 | AC | 508 ms
58,864 KB |
testcase_43 | AC | 445 ms
58,768 KB |
ソースコード
package contest190726; 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 B { InputStream is; PrintWriter out; String INPUT = ""; void solve() { char[] s = ns().toCharArray(); int[][] dp = new int[0][]; long E = 0; long num = 0; for(char c : s) { int[][] ndp = new int[dp.length+1][]; int p = 0; for(int i = 0;i < dp.length;i++) { int np = dp[i][0]|1<<c-'a'; if(p == 0 || ndp[p-1][0] != np) { ndp[p++] = new int[] {np, dp[i][1]}; }else { ndp[p-1][1] += dp[i][1]; } } int np = 1<<c-'a'; if(p == 0 || ndp[p-1][0] != np) { ndp[p++] = new int[] {np, 1}; }else { ndp[p-1][1] += 1; } for(int i = 0;i < p;i++) { E += (long)Integer.bitCount(ndp[i][0]) * ndp[i][1]; num += ndp[i][1]; } dp = Arrays.copyOf(ndp, p); } out.printf("%.14f\n", (double)E/num); } 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 B().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)); } }