#96575 (Java21) No.376 立方体のN等分 (2)

提出ソース

結果

問題	No.376 立方体のN等分 (2)
ユーザー	uwi
提出日時	2016-06-06 15:25:52
言語	Java21 (openjdk 21)
結果	AC
実行時間	239 ms / 5,000 ms
コード長	6,995 bytes
コンパイル時間	4,257 ms
コンパイル使用メモリ	90,696 KB
実行使用メモリ	50,680 KB
最終ジャッジ日時	2024-11-06 22:13:05
合計ジャッジ時間	14,135 ms
ジャッジサーバーID （参考情報）	judge1 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	194 ms 48,004 KB
testcase_01	AC	220 ms 49,504 KB
testcase_02	AC	194 ms 49,288 KB
testcase_03	AC	197 ms 49,360 KB
testcase_04	AC	200 ms 49,392 KB
testcase_05	AC	177 ms 49,576 KB
testcase_06	AC	197 ms 49,352 KB
testcase_07	AC	204 ms 48,220 KB
testcase_08	AC	227 ms 50,168 KB
testcase_09	AC	200 ms 49,036 KB
testcase_10	AC	181 ms 47,520 KB
testcase_11	AC	214 ms 49,396 KB
testcase_12	AC	202 ms 49,400 KB
testcase_13	AC	187 ms 50,352 KB
testcase_14	AC	196 ms 50,136 KB
testcase_15	AC	207 ms 47,572 KB
testcase_16	AC	212 ms 49,404 KB
testcase_17	AC	198 ms 49,360 KB
testcase_18	AC	211 ms 50,372 KB
testcase_19	AC	173 ms 49,832 KB
testcase_20	AC	182 ms 47,724 KB
testcase_21	AC	221 ms 50,680 KB
testcase_22	AC	192 ms 48,264 KB
testcase_23	AC	189 ms 47,784 KB
testcase_24	AC	200 ms 48,224 KB
testcase_25	AC	202 ms 49,176 KB
testcase_26	AC	210 ms 50,404 KB
testcase_27	AC	239 ms 47,912 KB
testcase_28	AC	194 ms 49,404 KB
testcase_29	AC	211 ms 49,104 KB
testcase_30	AC	182 ms 47,720 KB
testcase_31	AC	207 ms 48,004 KB
testcase_32	AC	235 ms 49,448 KB
testcase_33	AC	234 ms 49,216 KB
testcase_34	AC	233 ms 49,400 KB
testcase_35	AC	233 ms 47,916 KB
testcase_36	AC	224 ms 47,556 KB
testcase_37	AC	224 ms 48,860 KB
testcase_38	AC	236 ms 48,916 KB
testcase_39	AC	195 ms 49,436 KB

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

ソースコード

raw source code

package q5xx;

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 Q547_7 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int[] primes = sieveAtkin2(10000000);
		long n = nl();
		
		long[] gdivs = new long[9000];
		int glen = enumDivisors(n, primes, gdivs);
		Arrays.sort(gdivs, 0, glen);
		int ind = Arrays.binarySearch(gdivs, 0, glen, (long)Math.cbrt(n)+1);
		if(ind < 0)ind = -ind-2;
		long ret = Long.MAX_VALUE;
		long[] divs = new long[9000];
		for(int i = ind;i >= 0;i--){
			long d = gdivs[i];
			if(d + 2*Math.sqrt(n/d) >= ret)break;
			int len = enumDivisors(n/d, primes, divs);
			for(int j = 0;j < len;j++){
				long ld = divs[j];
				ret = Math.min(ret, d+ld+n/d/ld);
			}
		}
		out.println((ret-3) + " " + (n-1));
	}
	
	public static int[] sieveAtkin2(int n)
	{
		int sqn = (int)Math.sqrt(n);
		int[] isp = new int[(n>>>5)+1];
		int b;
		for (int z = 1; z <= 5; z += 4) {
			for (int y = z; y <= sqn; y += 6) {
//				for (int x = 1; x <= sqn && (b = 4 * x * x + y * y) <= n; ++x)isp[b>>>5] ^= 1<<b;
				for (int x = 1; (b = 4 * x * x + y * y) <= n; ++x)isp[b>>>5] ^= 1<<b;
				for (int x = y + 1; x <= sqn && (b = 3 * x * x - y * y) <= n; x += 2)isp[b>>>5] ^= 1<<b;
			}
		}
		for (int z = 2; z <= 4; z += 2) {
			for (int y = z; y <= sqn; y += 6) {
//				for (int x = 1; x <= sqn && (b = 3 * x * x + y * y) <= n; x += 2)isp[b>>>5] ^= 1<<b;
				for (int x = 1; (b = 3 * x * x + y * y) <= n; x += 2)isp[b>>>5] ^= 1<<b;
				for (int x = y + 1; x <= sqn && (b = 3 * x * x - y * y) <= n; x += 2)isp[b>>>5] ^= 1<<b;
			}
		}
		for (int y = 3; y <= sqn; y += 6) {
			for (int z = 1; z <= 2; ++z) {
//				for (int x = z; x <= sqn && (b = 4 * x * x + y * y) <= n; x += 3)isp[b>>>5] ^= 1<<b;
				for (int x = z; (b = 4 * x * x + y * y) <= n; x += 3)isp[b>>>5] ^= 1<<b;
			}
		}
		int[] ret = new int[(int)(n / Math.log(n)) + (int)(n / (Math.log(n)*Math.log(n))*1.5)];
		ret[0] = 2;
		ret[1] = 3;
		ret[2] = 5;
		for (int l = 25; l <= n; l += 25)isp[l>>>5] &= ~(1<<l);
		
		int pos = 3;
		isp[0] &= ~63;
		for(int i = 0;i < isp.length;i++){
			for(int j = isp[i];j != 0;j&=j-1){
				int k = Integer.numberOfTrailingZeros(j)|i<<5;
				if(k > n)break;
				ret[pos++] = k;
				if(k <= sqn){
					int zz = k*k;
					for (int l = zz; l <= n; l += zz)isp[l>>>5] &= ~(1<<l);
				}
			}
		}
		return Arrays.copyOf(ret, pos);
	}
	
	public static int enumDivisors(long n, int[] primes, long[] divs)
	{
		divs[0] = 1L;
		int t = 1;
		long u = n;
		for(int p : primes){
			if((long)p*p > u)break;
			int e = 0;
			while(u % p == 0){
				u /= p;
				e++;
			}
			if(e > 0){
				for(int q = t-1;q >= 0;q--){
					long b = divs[q];
					for(int k = 0;k < e;k++){
						b *= p;
						if((long)b*b <= n)divs[t++] = b;
					}
				}
			}
		}
		if(u > 1){
			long p = u;
			int e = 1;
			for(int q = t-1;q >= 0;q--){
				long b = divs[q];
				for(int k = 0;k < e;k++){
					b *= p;
					if((long)b*b <= n)divs[t++] = b;
				}
			}
		}
		
		return t;
	}
	
	public static int[] sieveEratosthenes(int n) {
		if (n <= 32) {
			int[] primes = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 };
			for (int i = 0; i < primes.length; i++) {
				if (n < primes[i]) {
					return Arrays.copyOf(primes, i);
				}
			}
			return primes;
		}

		int u = n + 32;
		double lu = Math.log(u);
		int[] ret = new int[(int) (u / lu + u / lu / lu * 1.5)];
		ret[0] = 2;
		int pos = 1;

		int[] isnp = new int[(n + 1) / 32 / 2 + 1];
		int sup = (n + 1) / 32 / 2 + 1;

		int[] tprimes = { 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 };
		for (int tp : tprimes) {
			ret[pos++] = tp;
			int[] ptn = new int[tp];
			for (int i = (tp - 3) / 2; i < tp << 5; i += tp)
				ptn[i >> 5] |= 1 << (i & 31);
			for (int j = 0; j < sup; j += tp) {
				for (int i = 0; i < tp && i + j < sup; i++) {
					isnp[j + i] |= ptn[i];
				}
			}
		}

		// 3,5,7
		// 2x+3=n
		int[] magic = { 0, 1, 23, 2, 29, 24, 19, 3, 30, 27, 25, 11, 20, 8, 4, 13, 31, 22, 28, 18, 26, 10, 7, 12, 21, 17,
				9, 6, 16, 5, 15, 14 };
		int h = n / 2;
		for (int i = 0; i < sup; i++) {
			for (int j = ~isnp[i]; j != 0; j &= j - 1) {
				int pp = i << 5 | magic[(j & -j) * 0x076be629 >>> 27];
				int p = 2 * pp + 3;
				if (p > n)
					break;
				ret[pos++] = p;
				if ((long) p * p > n)
					continue;
				for (int q = (p * p - 3) / 2; q <= h; q += p)
					isnp[q >> 5] |= 1 << q;
			}
		}

		return Arrays.copyOf(ret, pos);
	}

	
	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");
	}
	
	public static void main(String[] args) throws Exception { new Q547_7().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 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[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private int ni()
	{
		int num = 0, 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 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

結果

テストケース

ソースコード