結果
問題 | No.852 連続部分文字列 |
ユーザー | ziita |
提出日時 | 2019-07-26 21:47:42 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 287 ms / 3,153 ms |
コード長 | 4,183 bytes |
コンパイル時間 | 3,413 ms |
コンパイル使用メモリ | 78,808 KB |
実行使用メモリ | 80,296 KB |
最終ジャッジ日時 | 2023-09-15 01:04:01 |
合計ジャッジ時間 | 9,671 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 42 ms
49,480 KB |
testcase_01 | AC | 42 ms
47,164 KB |
testcase_02 | AC | 43 ms
49,280 KB |
testcase_03 | AC | 43 ms
49,548 KB |
testcase_04 | AC | 42 ms
49,080 KB |
testcase_05 | AC | 43 ms
49,292 KB |
testcase_06 | AC | 43 ms
49,492 KB |
testcase_07 | AC | 43 ms
49,192 KB |
testcase_08 | AC | 42 ms
49,228 KB |
testcase_09 | AC | 43 ms
49,292 KB |
testcase_10 | AC | 42 ms
49,320 KB |
testcase_11 | AC | 42 ms
49,320 KB |
testcase_12 | AC | 42 ms
49,288 KB |
testcase_13 | AC | 68 ms
50,556 KB |
testcase_14 | AC | 57 ms
50,160 KB |
testcase_15 | AC | 89 ms
50,812 KB |
testcase_16 | AC | 75 ms
50,716 KB |
testcase_17 | AC | 87 ms
51,000 KB |
testcase_18 | AC | 84 ms
50,824 KB |
testcase_19 | AC | 50 ms
49,844 KB |
testcase_20 | AC | 77 ms
50,744 KB |
testcase_21 | AC | 84 ms
51,372 KB |
testcase_22 | AC | 61 ms
50,084 KB |
testcase_23 | AC | 75 ms
51,568 KB |
testcase_24 | AC | 67 ms
50,352 KB |
testcase_25 | AC | 84 ms
50,392 KB |
testcase_26 | AC | 81 ms
51,108 KB |
testcase_27 | AC | 83 ms
51,436 KB |
testcase_28 | AC | 88 ms
51,204 KB |
testcase_29 | AC | 86 ms
49,392 KB |
testcase_30 | AC | 56 ms
50,368 KB |
testcase_31 | AC | 85 ms
51,400 KB |
testcase_32 | AC | 87 ms
51,640 KB |
testcase_33 | AC | 284 ms
79,780 KB |
testcase_34 | AC | 282 ms
77,784 KB |
testcase_35 | AC | 287 ms
77,684 KB |
testcase_36 | AC | 284 ms
79,508 KB |
testcase_37 | AC | 281 ms
77,716 KB |
testcase_38 | AC | 282 ms
77,868 KB |
testcase_39 | AC | 281 ms
77,876 KB |
testcase_40 | AC | 280 ms
77,316 KB |
testcase_41 | AC | 278 ms
78,224 KB |
testcase_42 | AC | 283 ms
80,296 KB |
testcase_43 | AC | 277 ms
78,032 KB |
ソースコード
import java.io.*; import java.util.*; import java.math.*; // import java.awt.Point; public class Main { InputStream is; PrintWriter out; String INPUT = ""; // static int mod = 1_000_000_007; int mod = 998244353; // long inf = Long.MAX_VALUE/2; int inf = Integer.MAX_VALUE/2; void solve(){ char[] s = ns().toCharArray(); int n = s.length; Deque<Integer>[] q = new ArrayDeque[26]; for(int i = 0; i < 26; i++){ q[i] = new ArrayDeque<>(); } long sum = 0; int num = 0; for(int i = 0; i < n; i++){ int c = s[i]-'a'; if(q[c].isEmpty()) num++; q[c].add(i); sum += num; } long ans = sum; for(int i = 0; i < n; i++){ int d = s[i]-'a'; q[d].pop(); if(q[d].isEmpty()){ sum -= (n-i); ans += sum; continue; } int next = q[d].peek(); sum -= (next-i); ans += sum; } out.println((double)ans/((long)n*(n+1)/2)); } 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"); } public static void main(String[] args) throws Exception { new Main().run(); } private byte[] inbuf = new byte[1024]; private 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) && 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 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[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private 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 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)); } }