結果

問題 No.757 チャンパーノウン定数 (2)
ユーザー 👑 hos.lyrichos.lyric
提出日時 2019-06-13 14:45:22
言語 D
(dmd 2.092.1)
結果
AC  
実行時間 39 ms / 2,000 ms
コード長 3,462 Byte
コンパイル時間 4,693 ms
使用メモリ 8,944 KB
最終ジャッジ日時 2020-07-11 19:56:00

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 3 ms
8,936 KB
testcase_01 AC 3 ms
8,940 KB
testcase_02 AC 3 ms
6,896 KB
testcase_03 AC 3 ms
6,896 KB
testcase_04 AC 2 ms
6,892 KB
testcase_05 AC 2 ms
6,896 KB
testcase_06 AC 3 ms
8,936 KB
testcase_07 AC 2 ms
8,896 KB
testcase_08 AC 2 ms
8,940 KB
testcase_09 AC 2 ms
6,892 KB
testcase_10 AC 2 ms
6,896 KB
testcase_11 AC 3 ms
8,940 KB
testcase_12 AC 2 ms
8,940 KB
testcase_13 AC 3 ms
6,896 KB
testcase_14 AC 3 ms
8,940 KB
testcase_15 AC 3 ms
8,944 KB
testcase_16 AC 2 ms
6,892 KB
testcase_17 AC 2 ms
8,936 KB
testcase_18 AC 3 ms
8,940 KB
testcase_19 AC 2 ms
8,940 KB
testcase_20 AC 2 ms
6,896 KB
testcase_21 AC 2 ms
6,896 KB
testcase_22 AC 2 ms
8,940 KB
testcase_23 AC 3 ms
8,936 KB
testcase_24 AC 3 ms
6,900 KB
testcase_25 AC 2 ms
6,900 KB
testcase_26 AC 2 ms
8,940 KB
testcase_27 AC 2 ms
8,940 KB
testcase_28 AC 39 ms
8,944 KB
testcase_29 AC 26 ms
6,892 KB
testcase_30 AC 3 ms
6,896 KB
testcase_31 AC 5 ms
8,940 KB
testcase_32 AC 2 ms
6,900 KB
testcase_33 AC 8 ms
8,940 KB
testcase_34 AC 16 ms
8,900 KB
testcase_35 AC 5 ms
6,896 KB
testcase_36 AC 5 ms
8,940 KB
testcase_37 AC 27 ms
8,900 KB
testcase_38 AC 32 ms
8,936 KB
testcase_39 AC 37 ms
8,936 KB
testcase_40 AC 35 ms
6,896 KB
testcase_41 AC 34 ms
6,896 KB
testcase_42 AC 35 ms
8,940 KB
testcase_43 AC 37 ms
6,896 KB
testcase_44 AC 37 ms
8,936 KB
testcase_45 AC 34 ms
6,892 KB
testcase_46 AC 36 ms
8,936 KB
testcase_47 AC 35 ms
8,940 KB
testcase_48 AC 37 ms
8,936 KB
testcase_49 AC 36 ms
8,940 KB
testcase_50 AC 3 ms
6,896 KB
testcase_51 AC 3 ms
8,936 KB
testcase_52 AC 3 ms
8,944 KB
testcase_53 AC 2 ms
8,896 KB
権限があれば一括ダウンロードができます

ソースコード

diff #
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)); }


int B;
string D;

int L;

void normalize(int[] a) {
  foreach (i; 0 .. L + 10) {
    int q = a[i] / B, r = a[i] % B;
    if (r < 0) {
      --q;
      r += B;
    }
    a[i + 1] += q;
    a[i] = r;
  }
}

void main() {
  try {
    for (; ; ) {
      B = readInt();
      D = readToken();
      
      L = cast(int)(D.length);
      auto d = new int[L + 20];
      foreach (i; 0 .. L) {
        d[i] = D[L - 1 - i] - '0';
      }
      debug {
        writeln("d = ", d);
      }
      
      /*
        min n s.t. d <= Sum[1 <= k <= n] k (B - 1) B^(k-1)
          <=> (B - 1) d <= n B^(n+1) - (n + 1) B^n + 1
      */
      
      // d *= (B - 1)
      foreach_reverse (i; 0 .. L) {
        d[i + 1] += d[i];
        d[i] *= -1;
      }
      d.normalize;
      debug {
        writeln("d = ", d);
      }
      
      int lo = 0, hi = L + 1;
      for (; lo + 1 < hi; ) {
        const mid = (lo + hi) / 2;
        auto e = new int[L + 20];
        e[0] += 1;
        e[mid] -= (mid + 1);
        e[mid + 1] += mid;
        e.normalize;
        int s;
        foreach_reverse (i; 0 .. L + 10) {
          if (d[i] != e[i]) {
            s = sgn(d[i] - e[i]);
            break;
          }
        }
        ((s <= 0) ? hi : lo) = mid;
      }
      const n = hi;
      debug {
        writeln("n = ", n);
      }
      
      foreach (k; 1 .. n) {
        // d -= (B - 1) . k (B - 1) B^(k-1)
        d[k - 1] -= (B - 1) * k * (B - 1);
      }
      d.normalize;
      debug {
        writeln("d = ", d);
      }
      
      int rem;
      
      // f = d / (B - 1)
      auto f = new int[L + 20];
      rem = 0;
      foreach_reverse (i; 0 .. L + 10) {
        rem = rem * B + d[i];
        f[i] = rem / (B - 1);
        rem %= (B - 1);
      }
      assert(rem == 0);
      debug {
        writeln("f = ", f);
      }
      
      // f -= 1, g = d / n
      --f[0];
      f.normalize;
      auto g = new int[L + 20];
      rem = 0;
      foreach_reverse (i; 0 .. L + 10) {
        rem = rem * B + f[i];
        g[i] = rem / n;
        rem %= n;
      }
      debug {
        writeln("g = ", g);
        writeln("rem = ", rem);
      }
      
      // rem-th (0-based) significant digit of B^(n-1) + g
      g[n - 1] += 1;
      const ans = g[n - 1 - rem];
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
0