結果

問題 No.603 hel__world (2)
ユーザー uwiuwi
提出日時 2017-12-03 15:48:11
言語 Java21
(openjdk 21)
結果
AC  
実行時間 708 ms / 3,000 ms
コード長 6,744 bytes
コンパイル時間 5,158 ms
コンパイル使用メモリ 92,736 KB
実行使用メモリ 99,988 KB
最終ジャッジ日時 2024-05-07 23:53:03
合計ジャッジ時間 13,582 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 89 ms
39,088 KB
testcase_01 AC 77 ms
38,468 KB
testcase_02 AC 72 ms
38,164 KB
testcase_03 AC 86 ms
38,364 KB
testcase_04 AC 87 ms
38,508 KB
testcase_05 AC 73 ms
38,408 KB
testcase_06 AC 52 ms
37,056 KB
testcase_07 AC 80 ms
38,868 KB
testcase_08 AC 64 ms
38,280 KB
testcase_09 AC 66 ms
37,780 KB
testcase_10 AC 76 ms
38,216 KB
testcase_11 AC 701 ms
88,692 KB
testcase_12 AC 645 ms
88,680 KB
testcase_13 AC 708 ms
99,988 KB
testcase_14 AC 69 ms
38,084 KB
testcase_15 AC 72 ms
37,852 KB
testcase_16 AC 81 ms
38,408 KB
testcase_17 AC 74 ms
38,312 KB
testcase_18 AC 67 ms
38,120 KB
testcase_19 AC 68 ms
38,496 KB
testcase_20 AC 529 ms
52,996 KB
testcase_21 AC 545 ms
52,692 KB
testcase_22 AC 106 ms
39,864 KB
testcase_23 AC 113 ms
39,988 KB
testcase_24 AC 115 ms
40,012 KB
testcase_25 AC 696 ms
89,036 KB
testcase_26 AC 639 ms
99,204 KB
testcase_27 AC 703 ms
96,308 KB
testcase_28 AC 594 ms
92,712 KB
testcase_29 AC 234 ms
48,568 KB
testcase_30 AC 194 ms
44,472 KB
testcase_31 AC 64 ms
38,080 KB
testcase_32 AC 168 ms
48,076 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.math.MathContext;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.PriorityQueue;

public class N603X {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		MathContext cx = MathContext.DECIMAL64;
		long[] a = new long[26];
		for(int i = 0;i < 26;i++){
			a[i] = nl();
		}
		char[] t = ns().toCharArray();
		int m = t.length;
		int[][] fs = new int[m][];
		int p = 0;
		for(int i = 0;i < t.length;){
			int j = i;
			while(j < t.length && t[j] == t[i])j++;
			fs[p++] = new int[]{t[i]-'a', j-i};
			i = j;
		}
		
		long ans = 1;
		int[] b = new int[p];
		for(int c = 0;c < 26;c++){
			int q = 0;
			for(int i = 0;i < p;i++){
				if(fs[i][0] == c){
					b[q++] = fs[i][1];
				}
			}
			if(q == 0)continue;
			Arrays.sort(b, 0, q);
			int[] lcs = new int[q];
			int[] lfs = new int[q];
			int r = 0;
			int num = 0;
			for(int i = 0;i < q;){
				int j = i;
				while(j < q && b[j] == b[i])j++;
				lcs[r] = b[i];
				lfs[r] = j-i;
				num += (long)b[i] * (j-i);
				r++;
				i = j;
			}
			if(a[c] < num){
				out.println(0);
				return;
			}
			BigDecimal low = BigDecimal.valueOf(1e-7);
			BigDecimal high = BigDecimal.valueOf(1e19);
			for(int rep = 0;rep < 100;rep++){
				BigDecimal h = low.add(high).divide(BigDecimal.valueOf(2), cx);
				// (x+1)/(x-c+1) >= h
				// 1+c/(x-c+1) >= h
				// c/(x-c+1) >= h-1
				// x-c+1 <= c/(h-1)
				// x <= c/(h-1)+c-1
				double alld = 0;
				long all = 0;
				for(int j = 0;j < r;j++){
					BigDecimal z = BigDecimal.valueOf(lcs[j]).multiply(h, cx).add(BigDecimal.valueOf(lcs[j]));
					long k = z.longValue();
					alld += z.doubleValue() * lfs[j];
					all += k * lfs[j];
				}
				if(all <= a[c] && alld <= 2e18){
					low = h;
				}else{
					high = h;
				}
			}
			BigDecimal h = high;
			long all = 0;
			int mod = 1000003;
			// x2*(y2-y0) - (x2-x0)*y2
			// -x2*y0+x0*y2
			PriorityQueue<BigInteger[]> pq = new PriorityQueue<>(1000, 
					(x, y) -> {
						return -x[2].multiply(y[0])
								.compareTo(x[0].multiply(y[2]));
					});
			long[] ks = new long[r];
			for(int j = 0;j < r;j++){
				long k = BigDecimal.valueOf(lcs[j]).multiply(h, cx).add(BigDecimal.valueOf(lcs[j])).longValue();
				all += k * lfs[j];
				BigInteger lc = BigInteger.valueOf(lcs[j]);
				BigInteger lf = BigInteger.valueOf(lfs[j]);
				BigInteger lk = BigInteger.valueOf(k);
				pq.add(new BigInteger[]{lc, lf, lk});
				ks[j] = k;
			}
			assert all > a[c];
			while(all > a[c]){
				BigInteger[] cur = pq.poll();
				long need = Math.min(all - a[c], cur[1].longValue());
				all -= need;
				if(need == cur[1].longValue()){
					cur[2] = cur[2].subtract(BigInteger.ONE);
					pq.add(cur);
				}else{
					ans = ans * pow(C(cur[2].longValue(), cur[0].longValue(), mod), cur[1].longValue() - need, mod) % mod;
					ans = ans * pow(C(cur[2].longValue()-1, cur[0].longValue(), mod), need, mod) % mod;
				}
			}
			while(!pq.isEmpty()){
				BigInteger[] cur = pq.poll();
				ans = ans * pow(C(cur[2].longValue(), cur[0].longValue(), mod), cur[1].longValue(), mod) % mod;
			}
		}
		out.println(ans);
	}
	
	static long C(long n, long r, int mod)
	{
		n %= mod;
		if(n < 0 || r < 0 || r > n)return 0;
		long ret = 1;
		long den = 1;
		for(int i = 1;i <= r;i++){
			ret = ret * (n-i+1) % mod;
			den = den * i % mod;
		}
		return ret * invl(den, mod) % mod;
	}
	
	public static long invl(long a, long mod) {
		long b = mod;
		long p = 1, q = 0;
		while (b > 0) {
			long c = a / b;
			long d;
			d = a;
			a = b;
			b = d % b;
			d = p;
			p = q;
			q = d - c * q;
		}
		return p < 0 ? p + mod : p;
	}

	
	public static long pow(long a, long n, long mod) {
				a %= mod;
		long ret = 1;
		int x = 63 - Long.numberOfLeadingZeros(n);
		for (; x >= 0; x--) {
			ret = ret * ret % mod;
			if (n << 63 - x < 0)
				ret = ret * a % mod;
		}
		return ret;
	}

	
	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 N603X().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