結果

問題 No.852 連続部分文字列
ユーザー uwiuwi
提出日時 2019-07-26 21:24:22
言語 Java21
(openjdk 21)
結果
AC  
実行時間 581 ms / 3,153 ms
コード長 3,704 bytes
コンパイル時間 4,462 ms
コンパイル使用メモリ 82,084 KB
実行使用メモリ 60,832 KB
最終ジャッジ日時 2023-09-15 00:32:56
合計ジャッジ時間 17,650 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 115 ms
55,308 KB
testcase_01 AC 114 ms
54,512 KB
testcase_02 AC 114 ms
56,044 KB
testcase_03 AC 112 ms
55,312 KB
testcase_04 AC 112 ms
56,004 KB
testcase_05 AC 114 ms
55,196 KB
testcase_06 AC 113 ms
55,704 KB
testcase_07 AC 114 ms
55,448 KB
testcase_08 AC 113 ms
55,692 KB
testcase_09 AC 114 ms
55,840 KB
testcase_10 AC 114 ms
55,664 KB
testcase_11 AC 114 ms
55,692 KB
testcase_12 AC 113 ms
55,772 KB
testcase_13 AC 179 ms
58,844 KB
testcase_14 AC 156 ms
58,416 KB
testcase_15 AC 203 ms
58,812 KB
testcase_16 AC 157 ms
58,036 KB
testcase_17 AC 194 ms
58,220 KB
testcase_18 AC 188 ms
58,332 KB
testcase_19 AC 131 ms
57,468 KB
testcase_20 AC 158 ms
58,260 KB
testcase_21 AC 205 ms
59,300 KB
testcase_22 AC 161 ms
58,292 KB
testcase_23 AC 186 ms
58,168 KB
testcase_24 AC 168 ms
58,260 KB
testcase_25 AC 192 ms
58,908 KB
testcase_26 AC 199 ms
58,912 KB
testcase_27 AC 181 ms
58,552 KB
testcase_28 AC 181 ms
58,364 KB
testcase_29 AC 207 ms
59,160 KB
testcase_30 AC 160 ms
58,444 KB
testcase_31 AC 190 ms
58,116 KB
testcase_32 AC 205 ms
58,636 KB
testcase_33 AC 536 ms
60,444 KB
testcase_34 AC 553 ms
60,344 KB
testcase_35 AC 556 ms
60,468 KB
testcase_36 AC 574 ms
60,596 KB
testcase_37 AC 571 ms
60,640 KB
testcase_38 AC 539 ms
60,664 KB
testcase_39 AC 581 ms
60,496 KB
testcase_40 AC 557 ms
60,268 KB
testcase_41 AC 577 ms
60,364 KB
testcase_42 AC 528 ms
60,832 KB
testcase_43 AC 458 ms
60,364 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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)); }
}
0