結果
問題 | No.375 立方体のN等分 (1) |
ユーザー | uwi |
提出日時 | 2016-06-05 15:37:34 |
言語 | Java19 (openjdk 21) |
結果 |
AC
|
実行時間 | 94 ms / 5,000 ms |
コード長 | 3,243 bytes |
コンパイル時間 | 3,857 ms |
コンパイル使用メモリ | 90,548 KB |
実行使用メモリ | 54,036 KB |
最終ジャッジ日時 | 2023-08-02 01:38:43 |
合計ジャッジ時間 | 6,891 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 61 ms
50,908 KB |
testcase_01 | AC | 63 ms
50,576 KB |
testcase_02 | AC | 60 ms
50,828 KB |
testcase_03 | AC | 58 ms
50,880 KB |
testcase_04 | AC | 61 ms
50,656 KB |
testcase_05 | AC | 70 ms
52,860 KB |
testcase_06 | AC | 62 ms
50,744 KB |
testcase_07 | AC | 67 ms
53,024 KB |
testcase_08 | AC | 58 ms
50,648 KB |
testcase_09 | AC | 76 ms
50,308 KB |
testcase_10 | AC | 68 ms
52,732 KB |
testcase_11 | AC | 88 ms
53,916 KB |
testcase_12 | AC | 90 ms
53,972 KB |
testcase_13 | AC | 90 ms
53,724 KB |
testcase_14 | AC | 61 ms
50,944 KB |
testcase_15 | AC | 59 ms
51,068 KB |
testcase_16 | AC | 59 ms
50,744 KB |
testcase_17 | AC | 60 ms
50,872 KB |
testcase_18 | AC | 58 ms
51,156 KB |
testcase_19 | AC | 94 ms
53,872 KB |
testcase_20 | AC | 68 ms
51,680 KB |
testcase_21 | AC | 62 ms
50,924 KB |
testcase_22 | AC | 65 ms
52,572 KB |
testcase_23 | AC | 93 ms
53,940 KB |
testcase_24 | AC | 61 ms
50,860 KB |
testcase_25 | AC | 62 ms
50,628 KB |
testcase_26 | AC | 58 ms
50,832 KB |
testcase_27 | AC | 94 ms
53,688 KB |
testcase_28 | AC | 69 ms
52,732 KB |
testcase_29 | AC | 60 ms
51,008 KB |
testcase_30 | AC | 91 ms
54,036 KB |
testcase_31 | AC | 92 ms
53,808 KB |
testcase_32 | AC | 78 ms
52,520 KB |
testcase_33 | AC | 76 ms
50,520 KB |
ソースコード
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 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { long n = nl(); long min = Long.MAX_VALUE / 2; long max = n-1; int s3 = (int)Math.cbrt(n)+1; while((long)s3*s3*s3 > n)s3--; for(int c = s3;c >= 1;c--){ if(n % c == 0){ if(c-1 + 2*(Math.sqrt(n/c)-1) >= min+5)continue; int s = (int)Math.sqrt(n/c)+1; while((long)s*s > n)s--; for(int b = s;b >= c;b--){ if(n/c%b == 0){ min = Math.min(min, c-1+(b-1)+(n/c/b-1)); break; } } } } out.println(min + " " + max); } 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().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)); } }