結果

問題 No.603 hel__world (2)
ユーザー uwiuwi
提出日時 2017-12-03 03:10:14
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 6,234 bytes
コンパイル時間 3,782 ms
コンパイル使用メモリ 83,672 KB
実行使用メモリ 99,856 KB
最終ジャッジ日時 2024-05-06 04:38:05
合計ジャッジ時間 11,277 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 52 ms
37,348 KB
testcase_01 AC 52 ms
37,320 KB
testcase_02 AC 54 ms
37,136 KB
testcase_03 AC 52 ms
37,268 KB
testcase_04 AC 50 ms
37,452 KB
testcase_05 AC 50 ms
37,144 KB
testcase_06 AC 52 ms
37,116 KB
testcase_07 AC 52 ms
37,080 KB
testcase_08 AC 55 ms
37,580 KB
testcase_09 AC 52 ms
37,388 KB
testcase_10 AC 50 ms
37,380 KB
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 AC 53 ms
37,348 KB
testcase_15 AC 53 ms
37,124 KB
testcase_16 AC 52 ms
36,892 KB
testcase_17 AC 51 ms
36,908 KB
testcase_18 AC 52 ms
37,356 KB
testcase_19 AC 52 ms
37,440 KB
testcase_20 WA -
testcase_21 WA -
testcase_22 AC 52 ms
37,360 KB
testcase_23 AC 53 ms
37,372 KB
testcase_24 AC 54 ms
37,168 KB
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 AC 545 ms
90,668 KB
testcase_29 WA -
testcase_30 AC 187 ms
47,108 KB
testcase_31 AC 54 ms
37,348 KB
testcase_32 AC 198 ms
47,484 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.math.MathContext;
import java.math.RoundingMode;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.List;

public class N603X2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		MathContext cx = new MathContext(100, RoundingMode.HALF_UP);
		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;
			}
			// (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
			
			// sum f*(c/(h-1)+c-1) = all
			// sum f*(cH+c-1) = all
			// sum fc*H + sum f*(c-1) = all
			int sumf = 0;
			for(int i = 0;i < r;i++)sumf += lfs[i];
			long hnum = a[c] - num + sumf;
			long hden = num;
			long all = 0;
			BigInteger maxnum = BigInteger.ZERO;
			BigInteger maxden = BigInteger.ONE;
			List<Integer> argjs = new ArrayList<>();
			int mod = 1000003;
			for(int j = 0;j < r;j++){
				long k = BigInteger.valueOf(lcs[j]).multiply(BigInteger.valueOf(hnum)).divide(BigInteger.valueOf(hden)).longValue()+lcs[j]-1;
				all += k * lfs[j];
				BigInteger lnum = BigInteger.valueOf(lcs[j]);
				BigInteger lden = BigInteger.valueOf(k);
				int comp = maxnum.multiply(lden).compareTo(maxden.multiply(lnum));
				if(comp < 0){
					maxnum = lnum;
					maxden = lden;
					argjs.clear();
					argjs.add(j);
				}else if(comp == 0){
					argjs.add(j);
				}
				ans = ans * pow(C(k, lcs[j], mod), lfs[j], mod) % mod;
			}
			for(int argj : argjs){
				long k = BigInteger.valueOf(lcs[argj]).multiply(BigInteger.valueOf(hnum)).divide(BigInteger.valueOf(hden)).longValue()+lcs[argj]-1;
				long rem = Math.min(lfs[argj], a[c] - all);
				all += rem;
				ans = ans * invl(pow(C(k, lcs[argj], mod), rem, mod), mod) % mod;
				ans = ans * pow(C(k+1, lcs[argj], mod), rem, 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 N603X2().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