結果

問題 No.376 立方体のN等分 (2)
ユーザー uwiuwi
提出日時 2016-06-06 15:33:12
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 6,629 bytes
コンパイル時間 3,743 ms
コンパイル使用メモリ 88,604 KB
実行使用メモリ 60,108 KB
最終ジャッジ日時 2024-10-08 16:37:43
合計ジャッジ時間 11,434 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 154 ms
58,168 KB
testcase_01 AC 148 ms
58,120 KB
testcase_02 AC 138 ms
58,148 KB
testcase_03 AC 136 ms
57,976 KB
testcase_04 WA -
testcase_05 AC 160 ms
60,108 KB
testcase_06 AC 146 ms
58,128 KB
testcase_07 AC 163 ms
58,288 KB
testcase_08 AC 143 ms
58,124 KB
testcase_09 AC 151 ms
58,392 KB
testcase_10 AC 144 ms
57,936 KB
testcase_11 AC 164 ms
58,380 KB
testcase_12 AC 141 ms
58,136 KB
testcase_13 AC 147 ms
58,004 KB
testcase_14 WA -
testcase_15 AC 153 ms
58,284 KB
testcase_16 AC 158 ms
58,104 KB
testcase_17 AC 145 ms
58,020 KB
testcase_18 AC 176 ms
59,132 KB
testcase_19 AC 138 ms
57,948 KB
testcase_20 AC 164 ms
58,180 KB
testcase_21 AC 147 ms
57,944 KB
testcase_22 AC 156 ms
58,216 KB
testcase_23 AC 152 ms
58,112 KB
testcase_24 AC 139 ms
58,040 KB
testcase_25 AC 140 ms
58,040 KB
testcase_26 AC 148 ms
58,104 KB
testcase_27 AC 201 ms
58,060 KB
testcase_28 AC 141 ms
57,944 KB
testcase_29 WA -
testcase_30 AC 143 ms
58,088 KB
testcase_31 AC 158 ms
58,224 KB
testcase_32 AC 169 ms
58,220 KB
testcase_33 WA -
testcase_34 AC 168 ms
58,248 KB
testcase_35 AC 190 ms
58,268 KB
testcase_36 AC 175 ms
58,280 KB
testcase_37 AC 166 ms
58,264 KB
testcase_38 AC 191 ms
58,440 KB
testcase_39 WA -
権限があれば一括ダウンロードができます

ソースコード

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_7 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int[] primes = sieveEratosthenes(10000000);
		long n = nl();
		
		long[] gdivs = new long[9000];
		int glen = enumDivisors3(n, primes, gdivs);
		Arrays.sort(gdivs, 0, glen);
		long ret = Long.MAX_VALUE;
		long[] divs = new long[9000];
		for(int i = glen-1;i >= 0;i--){
			long d = gdivs[i];
			if(d + 2*Math.sqrt(n/d) >= ret)break;
			long ld = maxOfDivisors(n/d, primes, divs);
			ret = Math.min(ret, d+ld+n/d/ld);
		}
		out.println((ret-3) + " " + (n-1));
	}
	
	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 long maxOfDivisors(long n, int[] primes, long[] divs)
	{
		divs[0] = 1L;
		int t = 1;
		long u = n;
		long max = 1;
		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(b > max)max = 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;
						if(b > max)max = b;
					}
				}
			}
		}
		
		return max;
	}
	
	public static int enumDivisors3(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 && (long)b*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 && (long)b*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)); }
}
0