結果

問題 No.376 立方体のN等分 (2)
ユーザー uwiuwi
提出日時 2016-06-06 15:12:46
言語 Java21
(openjdk 21)
結果
AC  
実行時間 240 ms / 5,000 ms
コード長 6,269 bytes
コンパイル時間 4,431 ms
コンパイル使用メモリ 86,284 KB
実行使用メモリ 48,428 KB
最終ジャッジ日時 2024-11-06 22:10:58
合計ジャッジ時間 13,397 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 168 ms
47,036 KB
testcase_01 AC 168 ms
47,704 KB
testcase_02 AC 172 ms
46,732 KB
testcase_03 AC 170 ms
47,092 KB
testcase_04 AC 171 ms
47,112 KB
testcase_05 AC 167 ms
46,920 KB
testcase_06 AC 163 ms
47,068 KB
testcase_07 AC 163 ms
47,712 KB
testcase_08 AC 175 ms
46,908 KB
testcase_09 AC 162 ms
46,944 KB
testcase_10 AC 168 ms
47,100 KB
testcase_11 AC 189 ms
47,324 KB
testcase_12 AC 168 ms
46,828 KB
testcase_13 AC 169 ms
46,956 KB
testcase_14 AC 170 ms
47,104 KB
testcase_15 AC 183 ms
46,792 KB
testcase_16 AC 166 ms
46,824 KB
testcase_17 AC 165 ms
47,084 KB
testcase_18 AC 181 ms
47,100 KB
testcase_19 AC 166 ms
47,052 KB
testcase_20 AC 163 ms
48,124 KB
testcase_21 AC 185 ms
47,080 KB
testcase_22 AC 165 ms
46,800 KB
testcase_23 AC 175 ms
46,808 KB
testcase_24 AC 173 ms
47,096 KB
testcase_25 AC 159 ms
46,952 KB
testcase_26 AC 207 ms
48,428 KB
testcase_27 AC 231 ms
47,252 KB
testcase_28 AC 169 ms
46,964 KB
testcase_29 AC 197 ms
48,428 KB
testcase_30 AC 161 ms
47,364 KB
testcase_31 AC 185 ms
47,088 KB
testcase_32 AC 189 ms
47,332 KB
testcase_33 AC 197 ms
47,608 KB
testcase_34 AC 185 ms
46,816 KB
testcase_35 AC 240 ms
47,040 KB
testcase_36 AC 194 ms
47,464 KB
testcase_37 AC 202 ms
47,104 KB
testcase_38 AC 222 ms
47,028 KB
testcase_39 AC 169 ms
46,836 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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_6 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int[] primes = sieveEratosthenes(10000000);
		long n = nl();
		long[] divisors = enumDivisors(factor(n, primes), n);
		Arrays.sort(divisors);
		int ind = Arrays.binarySearch(divisors, (long)Math.cbrt(n)+1);
		if(ind < 0)ind = -ind-2;
		long ret = Long.MAX_VALUE;
		for(int i = ind;i >= 0;i--){
			long d = divisors[i];
			if(d + 2*Math.sqrt(n/d) >= ret)break;
			long[] lds = enumDivisors(n/d, primes);
			for(long ld : lds){
				ret = Math.min(ret, d+ld+n/d/ld);
			}
		}
		out.println((ret-3) + " " + (n-1));
	}
	
	public static long[][] factor(long n, int[] primes)
	{
		long[][] ret = new long[20][2];
		int rp = 0;
		for(int p : primes){
			if((long)p * p > n)break;
			int i;
			for(i = 0;n % p == 0;n /= p, i++);
			if(i > 0){
				ret[rp][0] = p;
				ret[rp][1] = i;
				rp++;
			}
		}
		if(n != 1){
			ret[rp][0] = n;
			ret[rp][1] = 1;
			rp++;
		}
		return Arrays.copyOf(ret, rp);
	}

	public static long[] enumDivisors(long[][] f, long n)
	{
		int m = 1;
		for(int j = 0;j < f.length;j++){
			m *= f[j][1]+1;
		}
		long[] divs = new long[m];
		int p = 1;
		divs[0] = 1;
		for(int j = 0;j < f.length;j++){
			for(int q = p-1;q >= 0;q--){
				long b = divs[q];
				for(int k = 0;k < f[j][1];k++){
					b *= f[j][0];
					if((long)b*b <= n)divs[p++] = b;
//					divs[p++] = b;
				}
			}
		}
		return Arrays.copyOf(divs, p);
	}
	

	public static long[] enumDivisors(long n, int[] primes)
	{
		int m = 1;
		long[] divs = {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){
				divs = Arrays.copyOf(divs, m*(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;
					}
				}
				m *= e+1;
			}
		}
		if(u > 1){
			long p = u;
			int e = 1;
			divs = Arrays.copyOf(divs, m*(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;
				}
			}
			m *= e+1;
		}
		
		return Arrays.copyOf(divs, 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_6().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)); }
}
0