結果

問題 No.603 hel__world (2)
ユーザー uwiuwi
提出日時 2017-12-03 17:46:40
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 5,874 bytes
コンパイル時間 4,267 ms
コンパイル使用メモリ 92,872 KB
実行使用メモリ 54,612 KB
最終ジャッジ日時 2024-05-06 09:07:53
合計ジャッジ時間 9,413 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 58 ms
37,532 KB
testcase_01 AC 60 ms
37,644 KB
testcase_02 AC 60 ms
37,668 KB
testcase_03 AC 68 ms
37,616 KB
testcase_04 AC 61 ms
37,432 KB
testcase_05 AC 59 ms
37,528 KB
testcase_06 AC 51 ms
37,184 KB
testcase_07 AC 61 ms
37,532 KB
testcase_08 AC 59 ms
37,008 KB
testcase_09 AC 59 ms
37,368 KB
testcase_10 AC 63 ms
37,544 KB
testcase_11 AC 232 ms
52,404 KB
testcase_12 AC 227 ms
53,224 KB
testcase_13 AC 230 ms
53,260 KB
testcase_14 AC 61 ms
37,416 KB
testcase_15 AC 59 ms
37,644 KB
testcase_16 AC 61 ms
37,268 KB
testcase_17 AC 59 ms
37,788 KB
testcase_18 AC 60 ms
37,600 KB
testcase_19 AC 60 ms
37,140 KB
testcase_20 AC 231 ms
44,028 KB
testcase_21 AC 239 ms
46,276 KB
testcase_22 AC 60 ms
37,296 KB
testcase_23 AC 60 ms
37,308 KB
testcase_24 AC 60 ms
37,480 KB
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 AC 224 ms
54,612 KB
testcase_29 AC 191 ms
43,772 KB
testcase_30 AC 191 ms
44,776 KB
testcase_31 AC 60 ms
37,752 KB
testcase_32 AC 180 ms
43,724 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.PriorityQueue;

// O(n+W√nlog n). W=26
public class N603 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	long muldiv(long x, long m, long d)
	{
		return x/d*m+x%d*m/d;
	}
	
	void solve()
	{
		long[] a = new long[26];
		for(int i = 0;i < 26;i++){
			a[i] = nl();
		}
		char[] t = ns().toCharArray();
		int[] fps = new int[26];
		int[][] fs = new int[26][];
		for(int i = 0;i < t.length;){
			int j = i;
			while(j < t.length && t[j] == t[i])j++;
			fps[t[i]-'a']++;
			i = j;
		}
		for(int i = 0;i < 26;i++){
			fs[i] = new int[fps[i]];
			fps[i] = 0;
		}
		
		for(int i = 0;i < t.length;){
			int j = i;
			while(j < t.length && t[j] == t[i])j++;
			fs[t[i]-'a'][fps[t[i]-'a']++] = j-i;
			i = j;
		}
		
		long ans = 1;
		int mod = 1000003;
		
		for(int c = 0;c < 26;c++){
			int[] b = fs[c];
			int q = b.length;
			if(q == 0)continue;
			Arrays.sort(b, 0, q);
			int[] lens = new int[q];
			int[] freqs = 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++;
				lens[r] = b[i];
				freqs[r] = j-i;
				num += lens[r] * (j-i);
				r++;
				i = j;
			}
			if(a[c] < num){
				out.println(0);
				return;
			}
			
			long X = a[c];
			
			// x[0]/x[1] > y[0]/y[1]
			PriorityQueue<long[]> pq = new PriorityQueue<>(
					(x, y) -> {
						double val = (double)x[0]/x[1] - (double)y[0]/y[1];
						if(Math.abs(val) > 1e-9)return -(int)Math.signum(val);
						return -Long.signum(x[0] * y[1] - y[0] * x[1]);
					}
					);
			long rem = X;
			for(int i = 0;i < r;i++){
				long k = muldiv(X, lens[i], num);
				// (k+1)/(k-c+1)
				pq.add(new long[]{k+1, k-lens[i]+1, i});
				rem -= k*freqs[i];
			}
			
			while(rem > 0){
				long[] cur = pq.poll();
				long curf = freqs[(int)cur[2]];
				long use = Math.min(rem, curf);
				rem -= use;
				if(use == curf){
					cur[0]++; cur[1]++;
					pq.add(cur);
				}else{
					ans = ans * pow(C(cur[0]-1, lens[(int)cur[2]], mod), curf - use, mod) % mod;
					ans = ans * pow(C(cur[0], lens[(int)cur[2]], mod), use, mod) % mod;
					break;
				}
			}
			
			for(long[] cur : pq){
				ans = ans * pow(C(cur[0]-1, lens[(int)cur[2]], mod), freqs[(int)cur[2]], mod) % mod;
			}
		}
		out.println(ans);
	}
	
	static long C(long n, long r, int 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 N603().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