結果
問題 | No.295 hel__world |
ユーザー | uwi |
提出日時 | 2015-10-23 13:22:53 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 540 ms / 5,000 ms |
コード長 | 5,808 bytes |
コンパイル時間 | 4,162 ms |
コンパイル使用メモリ | 87,224 KB |
実行使用メモリ | 66,404 KB |
最終ジャッジ日時 | 2023-09-30 05:07:50 |
合計ジャッジ時間 | 15,328 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 44 ms
49,172 KB |
testcase_01 | AC | 44 ms
49,376 KB |
testcase_02 | AC | 45 ms
49,628 KB |
testcase_03 | AC | 45 ms
49,324 KB |
testcase_04 | AC | 46 ms
49,724 KB |
testcase_05 | AC | 44 ms
49,292 KB |
testcase_06 | AC | 44 ms
49,732 KB |
testcase_07 | AC | 43 ms
47,520 KB |
testcase_08 | AC | 44 ms
49,436 KB |
testcase_09 | AC | 43 ms
49,240 KB |
testcase_10 | AC | 43 ms
49,148 KB |
testcase_11 | AC | 44 ms
49,392 KB |
testcase_12 | AC | 44 ms
49,732 KB |
testcase_13 | AC | 45 ms
49,624 KB |
testcase_14 | AC | 45 ms
49,616 KB |
testcase_15 | AC | 44 ms
49,484 KB |
testcase_16 | AC | 44 ms
49,252 KB |
testcase_17 | AC | 44 ms
49,336 KB |
testcase_18 | AC | 44 ms
49,432 KB |
testcase_19 | AC | 46 ms
49,532 KB |
testcase_20 | AC | 45 ms
49,500 KB |
testcase_21 | AC | 44 ms
49,536 KB |
testcase_22 | AC | 45 ms
49,708 KB |
testcase_23 | AC | 46 ms
49,628 KB |
testcase_24 | AC | 45 ms
49,288 KB |
testcase_25 | AC | 50 ms
49,552 KB |
testcase_26 | AC | 49 ms
49,704 KB |
testcase_27 | AC | 333 ms
52,784 KB |
testcase_28 | AC | 532 ms
54,028 KB |
testcase_29 | AC | 532 ms
54,172 KB |
testcase_30 | AC | 45 ms
49,748 KB |
testcase_31 | AC | 46 ms
49,620 KB |
testcase_32 | AC | 394 ms
66,020 KB |
testcase_33 | AC | 442 ms
66,404 KB |
testcase_34 | AC | 386 ms
66,164 KB |
testcase_35 | AC | 44 ms
47,360 KB |
testcase_36 | AC | 44 ms
49,332 KB |
testcase_37 | AC | 44 ms
49,180 KB |
testcase_38 | AC | 45 ms
49,444 KB |
testcase_39 | AC | 45 ms
49,400 KB |
testcase_40 | AC | 44 ms
49,320 KB |
testcase_41 | AC | 44 ms
49,404 KB |
testcase_42 | AC | 45 ms
49,372 KB |
testcase_43 | AC | 442 ms
53,612 KB |
testcase_44 | AC | 445 ms
53,984 KB |
testcase_45 | AC | 441 ms
51,952 KB |
testcase_46 | AC | 441 ms
53,488 KB |
testcase_47 | AC | 538 ms
53,704 KB |
testcase_48 | AC | 532 ms
53,948 KB |
testcase_49 | AC | 540 ms
54,056 KB |
testcase_50 | AC | 50 ms
49,572 KB |
testcase_51 | AC | 218 ms
53,896 KB |
testcase_52 | AC | 148 ms
53,648 KB |
testcase_53 | AC | 143 ms
58,984 KB |
testcase_54 | AC | 150 ms
59,280 KB |
testcase_55 | AC | 279 ms
62,292 KB |
testcase_56 | AC | 291 ms
62,760 KB |
ソースコード
import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.Comparator; import java.util.InputMismatchException; import java.util.PriorityQueue; public class Q400U { InputStream is; PrintWriter out; String INPUT = ""; void solve() { long[] s = new long[26]; for(int i = 0;i < 26;i++){ s[i] = nl(); if(s[i] < 0 || s[i] > 1_000_000_000_000_000_000L)throw new RuntimeException("s[i] out of range"); } char[] t = ns().toCharArray(); if(t.length < 1 || t.length > 1_000_000)throw new RuntimeException("t out of range"); for(char c : t){ if(!('a' <= c && c <= 'z'))throw new RuntimeException("t invalid char"); } int n = t.length; // 0? int[] freq = new int[26]; for(char c : t){ freq[c-'a']++; } for(int i = 0;i < 26;i++){ if(s[i] < freq[i]){ out.println(0); return; } } long ret = 1; double retd = 1; int[] lens = new int[n+1]; for(char x = 'a';x <= 'z';x++){ int xi = x-'a'; int len = 0; int p = 0; for(int i = 0;i < n;i++){ if(t[i] == x){ len++; }else{ if(len > 0)lens[p++] = len; len = 0; } } if(len > 0)lens[p++] = len; if(p == 0)continue; if(p == 1 && lens[0] == 1){ // 1 ret *= s[xi]; retd *= s[xi]; if(retd > 3L<<61 || ret >= 1L<<62){ out.println("hel"); return; } continue; } if(p == 1 && lens[0] == 2){ // 2 if(s[xi] >= 5_000_000_000L){ out.println("hel"); return; } long w0 = s[xi]; long w1 = s[xi]-1; if(w0 % 2 == 0){ w0 /= 2; }else{ w1 /= 2; } ret *= w0 * w1; retd *= w0 * w1; if(retd > 3L<<61 || ret >= 1L<<62){ out.println("hel"); return; } continue; } if(p == 2 && lens[0] == 1 && lens[1] == 1){ // 1 1 long w0 = s[xi]/2; long w1 = (s[xi]+1)/2; if(w0 >= 3_000_000_000L){ out.println("hel"); return; } ret *= w0 * w1; retd *= w0 * w1; if(retd > 3L<<61 || ret >= 1L<<62){ out.println("hel"); return; } continue; } for(int i = 0;i < p;i++){ s[xi] -= lens[i]; } if(s[xi] < 0){ // impossible out.println(0); return; } // {v, d} PriorityQueue<int[]> pq = new PriorityQueue<>(10000, new Comparator<int[]>(){ public int compare(int[] a, int[] b){ // (v1+d1)/d1 >= (v2+d2)/d2 return -Long.compare((long)a[0]*(b[1]+1), (long)b[0]*(a[1]+1)); } }); for(int i = 0;i < p;i++){ pq.add(new int[]{lens[i], 0}); } double lretd = retd; while(!pq.isEmpty() && s[xi] > 0){ int[] cur = pq.poll(); cur[1]++; long g = gcd(cur[0]+cur[1], cur[1]); lretd = lretd * (cur[0] + cur[1]) / cur[1]; ret = ret / (cur[1]/g) * ((cur[0]+cur[1])/g); if(lretd >= 3L<<61 || ret >= 1L<<62){ out.println("hel"); return; } pq.add(cur); s[xi]--; } } out.println(ret); } public static long gcd(long a, long b) { while (b > 0) { long c = a; a = b; b = c % b; } return a; } 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 Q400U().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))){ // 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)); } }