#348311 (D) No.376 立方体のN等分 (2)

• 問題: No.376 立方体のN等分 (2)
• ユーザー: 👑 hos.lyric
• 提出日時: 2019-05-24 18:56:26
• 言語: D (dmd 2.106.1)
• 結果: AC
• 実行時間: 107 ms / 5,000 ms
• コード長: 1,991 bytes
• コンパイル時間: 901 ms
• コンパイル使用メモリ: 125,456 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-06-22 01:20:38
• 合計ジャッジ時間: 4,675 ms
• ジャッジサーバーID （参考情報）: judge3 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,816 KB
testcase_01	AC	1 ms; 6,940 KB
testcase_02	AC	82 ms; 6,940 KB
testcase_03	AC	79 ms; 6,940 KB
testcase_04	AC	94 ms; 6,940 KB
testcase_05	AC	1 ms; 6,940 KB
testcase_06	AC	1 ms; 6,940 KB
testcase_07	AC	1 ms; 6,944 KB
testcase_08	AC	5 ms; 6,944 KB
testcase_09	AC	21 ms; 6,940 KB
testcase_10	AC	29 ms; 6,940 KB
testcase_11	AC	42 ms; 6,944 KB
testcase_12	AC	57 ms; 6,940 KB
testcase_13	AC	58 ms; 6,940 KB
testcase_14	AC	65 ms; 6,944 KB
testcase_15	AC	74 ms; 6,944 KB
testcase_16	AC	83 ms; 6,944 KB
testcase_17	AC	83 ms; 6,944 KB
testcase_18	AC	88 ms; 6,940 KB
testcase_19	AC	90 ms; 6,940 KB
testcase_20	AC	90 ms; 6,944 KB
testcase_21	AC	93 ms; 6,940 KB
testcase_22	AC	94 ms; 6,940 KB
testcase_23	AC	97 ms; 6,944 KB
testcase_24	AC	97 ms; 6,944 KB
testcase_25	AC	95 ms; 6,944 KB
testcase_26	AC	100 ms; 6,944 KB
testcase_27	AC	96 ms; 6,944 KB
testcase_28	AC	97 ms; 6,944 KB
testcase_29	AC	98 ms; 6,940 KB
testcase_30	AC	98 ms; 6,944 KB
testcase_31	AC	107 ms; 6,940 KB
testcase_32	AC	99 ms; 6,944 KB
testcase_33	AC	95 ms; 6,940 KB
testcase_34	AC	99 ms; 6,944 KB
testcase_35	AC	96 ms; 6,940 KB
testcase_36	AC	96 ms; 6,944 KB
testcase_37	AC	96 ms; 6,944 KB
testcase_38	AC	98 ms; 6,944 KB
testcase_39	AC	101 ms; 6,944 KB

ソースコード

import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


long N;

void main() {
  try {
    for (; ; ) {
      N = readLong();
      
      long[] ds;
      for (long d = 1; d * d <= N; ++d) {
        if (N % d == 0) {
          ds ~= d;
          if (d != N / d) {
            ds ~= N / d;
          }
        }
      }
      ds.sort;
      
      long ans = N - 1;
      foreach (d; ds) {
        if (d <= N / d / d) {
          const lim = cast(long)(sqrt(cast(real)(N / d))) + 10;
          const pos = ds.upperBound(lim);
          foreach_reverse (e; ds[0 .. pos]) {
            if (N / d % e == 0 && e <= N / d / e) {
              debug {
                writeln(" ", d, " ", e, " ", N / d / e);
              }
              chmin(ans, d + e + N / d / e - 3);
              break;
            }
          }
        }
      }
      writeln(ans, " ", N - 1);
    }
  } catch (EOFException e) {
  }
}