#362949 (Java21) No.856 増える演算

提出ソース

結果

問題	No.856 増える演算
ユーザー	uwi
提出日時	2019-07-26 23:13:52
言語	Java21 (openjdk 21)
結果	AC
実行時間	556 ms / 3,153 ms
コード長	10,577 bytes
コンパイル時間	6,072 ms
コンパイル使用メモリ	80,536 KB
実行使用メモリ	67,256 KB
最終ジャッジ日時	2023-09-15 04:18:31
合計ジャッジ時間	47,238 ms
ジャッジサーバーID （参考情報）	judge15 / judge12

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	294 ms 65,404 KB
testcase_01	AC	298 ms 64,912 KB
testcase_02	AC	309 ms 64,844 KB
testcase_03	AC	296 ms 65,040 KB
testcase_04	AC	357 ms 64,924 KB
testcase_05	AC	303 ms 65,420 KB
testcase_06	AC	311 ms 65,036 KB
testcase_07	AC	316 ms 65,084 KB
testcase_08	AC	314 ms 65,424 KB
testcase_09	AC	310 ms 65,152 KB
testcase_10	AC	302 ms 63,076 KB
testcase_11	AC	316 ms 65,644 KB
testcase_12	AC	322 ms 65,016 KB
testcase_13	AC	359 ms 65,332 KB
testcase_14	AC	333 ms 64,988 KB
testcase_15	AC	337 ms 65,060 KB
testcase_16	AC	341 ms 65,452 KB
testcase_17	AC	342 ms 65,180 KB
testcase_18	AC	324 ms 65,044 KB
testcase_19	AC	322 ms 65,324 KB
testcase_20	AC	318 ms 64,948 KB
testcase_21	AC	324 ms 65,080 KB
testcase_22	AC	331 ms 65,132 KB
testcase_23	AC	267 ms 65,196 KB
testcase_24	AC	332 ms 64,784 KB
testcase_25	AC	308 ms 64,844 KB
testcase_26	AC	315 ms 64,664 KB
testcase_27	AC	314 ms 65,180 KB
testcase_28	AC	299 ms 65,072 KB
testcase_29	AC	318 ms 65,076 KB
testcase_30	AC	359 ms 64,956 KB
testcase_31	AC	311 ms 64,884 KB
testcase_32	AC	273 ms 65,012 KB
testcase_33	AC	372 ms 65,436 KB
testcase_34	AC	414 ms 65,128 KB
testcase_35	AC	393 ms 65,008 KB
testcase_36	AC	434 ms 65,324 KB
testcase_37	AC	440 ms 65,432 KB
testcase_38	AC	332 ms 65,268 KB
testcase_39	AC	282 ms 64,980 KB
testcase_40	AC	363 ms 65,092 KB
testcase_41	AC	371 ms 65,132 KB
testcase_42	AC	402 ms 64,936 KB
testcase_43	AC	374 ms 64,992 KB
testcase_44	AC	346 ms 65,244 KB
testcase_45	AC	281 ms 65,120 KB
testcase_46	AC	365 ms 65,220 KB
testcase_47	AC	377 ms 64,812 KB
testcase_48	AC	435 ms 65,468 KB
testcase_49	AC	375 ms 65,064 KB
testcase_50	AC	430 ms 67,256 KB
testcase_51	AC	441 ms 65,388 KB
testcase_52	AC	400 ms 64,860 KB
testcase_53	AC	540 ms 65,156 KB
testcase_54	AC	455 ms 65,264 KB
testcase_55	AC	526 ms 65,732 KB
testcase_56	AC	447 ms 65,524 KB
testcase_57	AC	554 ms 65,396 KB
testcase_58	AC	515 ms 65,152 KB
testcase_59	AC	533 ms 66,004 KB
testcase_60	AC	513 ms 65,056 KB
testcase_61	AC	530 ms 65,220 KB
testcase_62	AC	532 ms 65,872 KB
testcase_63	AC	356 ms 65,120 KB
testcase_64	AC	548 ms 65,832 KB
testcase_65	AC	423 ms 65,400 KB
testcase_66	AC	503 ms 64,808 KB
testcase_67	AC	508 ms 65,248 KB
testcase_68	AC	549 ms 65,556 KB
testcase_69	AC	547 ms 65,576 KB
testcase_70	AC	537 ms 65,320 KB
testcase_71	AC	556 ms 65,800 KB
testcase_72	AC	544 ms 65,456 KB
testcase_73	AC	545 ms 65,412 KB
testcase_74	AC	545 ms 65,596 KB
testcase_75	AC	543 ms 65,424 KB
testcase_76	AC	547 ms 65,576 KB
testcase_77	AC	545 ms 63,612 KB
testcase_78	AC	546 ms 63,520 KB
testcase_79	AC	547 ms 65,544 KB
testcase_80	AC	546 ms 65,600 KB
testcase_81	AC	545 ms 65,616 KB
testcase_82	AC	463 ms 65,548 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

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

public class F {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int[] a = na(n);
		
		int min = Integer.MAX_VALUE;
		double best = Double.POSITIVE_INFINITY;
		int bi = a[0], bj = a[1];
		for(int i = n-1;i >= 0;i--) {
			double x = Math.log(a[i]+min) + min * Math.log(a[i]);
			if(x < best) {
				best = x;
				bi = a[i];
				bj = min;
			}
			if(a[i] < min) {
				min = a[i];
			}
		}
		
		int mod = 1000000007;
		long den = (bi+bj) * pow(bi, bj, mod) % mod;
		long E = invl(den, mod);
		
		long[] cum = new long[n+1];
		for(int i = 0;i < n;i++) {
			cum[i+1] = cum[i] + a[i];
		}
		for(int i = 0;i < n;i++) {
			E = E * pow(a[i], cum[n] - cum[i+1], mod) % mod;
		}
		
		long[] f = new long[100005];
		for(int v : a)f[v]++;
		
		long[] f2 = convolute(f, f);
		for(int i = 0;i < f.length;i++)f2[2*i] -= f[i];
		for(int i = 0;i < f2.length;i++) {
			if(f2[i] > 0) {
				E = E * pow(i, f2[i]/2, mod) % mod;
			}
		}
		out.println(E);
	}
	
	public static final int[] NTTPrimes = {1053818881, 1051721729, 1045430273, 1012924417, 1007681537, 1004535809, 998244353, 985661441, 976224257, 975175681};
	public static final int[] NTTPrimitiveRoots = {7, 6, 3, 5, 3, 3, 3, 3, 3, 17};
//	public static final int[] NTTPrimes = {1012924417, 1004535809, 998244353, 985661441, 975175681, 962592769, 950009857, 943718401, 935329793, 924844033};
//	public static final int[] NTTPrimitiveRoots = {5, 3, 3, 3, 17, 7, 7, 7, 3, 5};
	
	public static long[] convoluteSimply(long[] a, long[] b, int P, int g)
	{
		int m = Math.max(2, Integer.highestOneBit(Math.max(a.length, b.length)-1)<<2);
		long[] fa = nttmb(a, m, false, P, g);
		long[] fb = a == b ? fa : nttmb(b, m, false, P, g);
		for(int i = 0;i < m;i++){
			fa[i] = fa[i]*fb[i]%P;
		}
		return nttmb(fa, m, true, P, g);
	}
	
	public static long[] convolute(long[] a, long[] b)
	{
		int USE = 2;
		int m = Math.max(2, Integer.highestOneBit(Math.max(a.length, b.length)-1)<<2);
		long[][] fs = new long[USE][];
		for(int k = 0;k < USE;k++){
			int P = NTTPrimes[k], g = NTTPrimitiveRoots[k];
			long[] fa = nttmb(a, m, false, P, g);
			long[] fb = a == b ? fa : nttmb(b, m, false, P, g);
			for(int i = 0;i < m;i++){
				fa[i] = fa[i]*fb[i]%P;
			}
			fs[k] = nttmb(fa, m, true, P, g);
		}
		
		int[] mods = Arrays.copyOf(NTTPrimes, USE);
		long[] gammas = garnerPrepare(mods);
		int[] buf = new int[USE];
		for(int i = 0;i < fs[0].length;i++){
			for(int j = 0;j < USE;j++)buf[j] = (int)fs[j][i];
			long[] res = garnerBatch(buf, mods, gammas);
			long ret = 0;
			for(int j = res.length-1;j >= 0;j--)ret = ret * mods[j] + res[j];
			fs[0][i] = ret;
		}
		return fs[0];
	}
	
	public static long[] convolute(long[] a, long[] b, int USE, int mod)
	{
		int m = Math.max(2, Integer.highestOneBit(Math.max(a.length, b.length)-1)<<2);
		long[][] fs = new long[USE][];
		for(int k = 0;k < USE;k++){
			int P = NTTPrimes[k], g = NTTPrimitiveRoots[k];
			long[] fa = nttmb(a, m, false, P, g);
			long[] fb = a == b ? fa : nttmb(b, m, false, P, g);
			for(int i = 0;i < m;i++){
				fa[i] = fa[i]*fb[i]%P;
			}
			fs[k] = nttmb(fa, m, true, P, g);
		}
		
		int[] mods = Arrays.copyOf(NTTPrimes, USE);
		long[] gammas = garnerPrepare(mods);
		int[] buf = new int[USE];
		for(int i = 0;i < fs[0].length;i++){
			for(int j = 0;j < USE;j++)buf[j] = (int)fs[j][i];
			long[] res = garnerBatch(buf, mods, gammas);
			long ret = 0;
			for(int j = res.length-1;j >= 0;j--)ret = (ret * mods[j] + res[j]) % mod;
			fs[0][i] = ret;
		}
		return fs[0];
	}
	
	// static int[] wws = new int[270000]; // outer faster
	
	// Modifed Montgomery + Barrett
	private static long[] nttmb(long[] src, int n, boolean inverse, int P, int g)
	{
		long[] dst = Arrays.copyOf(src, n);
		
		int h = Integer.numberOfTrailingZeros(n);
		long K = Integer.highestOneBit(P)<<1;
		int H = Long.numberOfTrailingZeros(K)*2;
		long M = K*K/P;
		
		int[] wws = new int[1<<h-1];
		long dw = inverse ? pow(g, P-1-(P-1)/n, P) : pow(g, (P-1)/n, P);
		long w = (1L<<32)%P;
		for(int k = 0;k < 1<<h-1;k++){
			wws[k] = (int)w;
			w = modh(w*dw, M, H, P);
		}
		long J = invl(P, 1L<<32);
		for(int i = 0;i < h;i++){
			for(int j = 0;j < 1<<i;j++){
				for(int k = 0, s = j<<h-i, t = s|1<<h-i-1;k < 1<<h-i-1;k++,s++,t++){
					long u = (dst[s] - dst[t] + 2*P)*wws[k];
					dst[s] += dst[t];
					if(dst[s] >= 2*P)dst[s] -= 2*P;
//					long Q = (u&(1L<<32)-1)*J&(1L<<32)-1;
					long Q = (u<<32)*J>>>32;
					dst[t] = (u>>>32)-(Q*P>>>32)+P;
				}
			}
			if(i < h-1){
				for(int k = 0;k < 1<<h-i-2;k++)wws[k] = wws[k*2];
			}
		}
		for(int i = 0;i < n;i++){
			if(dst[i] >= P)dst[i] -= P;
		}
		for(int i = 0;i < n;i++){
			int rev = Integer.reverse(i)>>>-h;
			if(i < rev){
				long d = dst[i]; dst[i] = dst[rev]; dst[rev] = d;
			}
		}
		
		if(inverse){
			long in = invl(n, P);
			for(int i = 0;i < n;i++)dst[i] = modh(dst[i]*in, M, H, P);
		}
		
		return dst;
	}
	
	// Modified Shoup + Barrett
	private static long[] nttsb(long[] src, int n, boolean inverse, int P, int g)
	{
		long[] dst = Arrays.copyOf(src, n);
		
		int h = Integer.numberOfTrailingZeros(n);
		long K = Integer.highestOneBit(P)<<1;
		int H = Long.numberOfTrailingZeros(K)*2;
		long M = K*K/P;
		
		long dw = inverse ? pow(g, P-1-(P-1)/n, P) : pow(g, (P-1)/n, P);
		long[] wws = new long[1<<h-1];
		long[] ws = new long[1<<h-1];
		long w = 1;
		for(int k = 0;k < 1<<h-1;k++){
			wws[k] = (w<<32)/P;
			ws[k] = w;
			w = modh(w*dw, M, H, P);
		}
		for(int i = 0;i < h;i++){
			for(int j = 0;j < 1<<i;j++){
				for(int k = 0, s = j<<h-i, t = s|1<<h-i-1;k < 1<<h-i-1;k++,s++,t++){
					long ndsts = dst[s] + dst[t];
					if(ndsts >= 2*P)ndsts -= 2*P;
					long T = dst[s] - dst[t] + 2*P;
					long Q = wws[k]*T>>>32;
					dst[s] = ndsts;
					dst[t] = ws[k]*T-Q*P&(1L<<32)-1;
				}
			}
//			dw = dw * dw % P;
			if(i < h-1){
				for(int k = 0;k < 1<<h-i-2;k++){
					wws[k] = wws[k*2];
					ws[k] = ws[k*2];
				}
			}
		}
		for(int i = 0;i < n;i++){
			if(dst[i] >= P)dst[i] -= P;
		}
		for(int i = 0;i < n;i++){
			int rev = Integer.reverse(i)>>>-h;
			if(i < rev){
				long d = dst[i]; dst[i] = dst[rev]; dst[rev] = d;
			}
		}
		
		if(inverse){
			long in = invl(n, P);
			for(int i = 0;i < n;i++){
				dst[i] = modh(dst[i] * in, M, H, P);
			}
		}
		
		return dst;
	}
	
	static final long mask = (1L<<31)-1;
	
	public static long modh(long a, long M, int h, int mod)
	{
		long r = a-((M*(a&mask)>>>31)+M*(a>>>31)>>>h-31)*mod;
		return r < mod ? r : r-mod;
	}
	
	private static long[] garnerPrepare(int[] m)
	{
		int n = m.length;
		assert n == m.length;
		if(n == 0)return new long[0];
		long[] gamma = new long[n];
		for(int k = 1;k < n;k++){
			long prod = 1;
			for(int i = 0;i < k;i++){
				prod = prod * m[i] % m[k];
			}
			gamma[k] = invl(prod, m[k]);
		}
		return gamma;
	}
	
	private static long[] garnerBatch(int[] u, int[] m, long[] gamma)
	{
		int n = u.length;
		assert n == m.length;
		long[] v = new long[n];
		v[0] = u[0];
		for(int k = 1;k < n;k++){
			long temp = v[k-1];
			for(int j = k-2;j >= 0;j--){
				temp = (temp * m[j] + v[j]) % m[k];
			}
			v[k] = (u[k] - temp) * gamma[k] % m[k];
			if(v[k] < 0)v[k] += m[k];
		}
		return v;
	}


	
	
	
	
	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 F().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)); }
}

yukicoder

結果

テストケース

ソースコード