結果

問題 No.1853 Many Operations
コンテスト
ユーザー hos.lyric
提出日時 2022-02-25 22:21:52
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 4,742 bytes
コンパイル時間 1,451 ms
コンパイル使用メモリ 154,356 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-06-22 14:24:49
合計ジャッジ時間 2,324 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 26
権限があれば一括ダウンロードができます

ソースコード

diff # 

import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, 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)); }


struct ModInt(uint M_) {
  import std.conv : to;
  alias M = M_;
  uint x;
  this(ModInt a) { x = a.x; }
  this(uint x_) { x = x_ % M; }
  this(ulong x_) { x = x_ % M; }
  this(int x_) { x = ((x_ %= cast(int)(M)) < 0) ? (x_ + cast(int)(M)) : x_; }
  this(long x_) { x = cast(uint)(((x_ %= cast(long)(M)) < 0) ? (x_ + cast(long)(M)) : x_); }
  ref ModInt opAssign(T)(inout(T) a) if (is(T == uint) || is(T == ulong) || is(T == int) || is(T == long)) { return this = ModInt(a); }
  ref ModInt opOpAssign(string op, T)(T a) {
    static if (is(T == ModInt)) {
      static if (op == "+") { x = ((x += a.x) >= M) ? (x - M) : x; }
      else static if (op == "-") { x = ((x -= a.x) >= M) ? (x + M) : x; }
      else static if (op == "*") { x = cast(uint)((cast(ulong)(x) * a.x) % M); }
      else static if (op == "/") { this *= a.inv(); }
      else static assert(false);
      return this;
    } else static if (op == "^^") {
      if (a < 0) return this = inv()^^(-a);
      ModInt b = this, c = 1U;
      for (long e = a; e; e >>= 1) { if (e & 1) c *= b; b *= b; }
      return this = c;
    } else {
      return mixin("this " ~ op ~ "= ModInt(a)");
    }
  }
  ModInt inv() const {
    uint a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const q = a / b; const c = a - q * b; a = b; b = c; const w = y - cast(int)(q) * z; y = z; z = w; }
    assert(a == 1); return ModInt(y);
  }
  ModInt opUnary(string op)() const {
    static if (op == "+") { return this; }
    else static if (op == "-") { ModInt a; a.x = x ? (M - x) : 0U; return a; }
    else static assert(false);
  }
  ModInt opBinary(string op, T)(T a) const { return mixin("ModInt(this) " ~ op ~ "= a"); }
  ModInt opBinaryRight(string op, T)(T a) const { return mixin("ModInt(a) " ~ op ~ "= this"); }
  bool opCast(T: bool)() const { return (x != 0U); }
  string toString() const { return x.to!string; }
}

enum MO = 998244353;
alias Mint = ModInt!MO;


Mint[long] cache;
Mint calc(long n) {
  assert(n >= 0);
  auto ptr = n in cache;
  if (ptr) return *ptr;
  Mint ret;
  if (n <= 3) {
    ret = [0, 1, 3, 6][cast(size_t)(n)];
  } else {
    ret = 6;
    // 2 k <= n, k >= 2
    {
      const k = n / 2;
      ret += (calc(k) - 1);
      ret += Mint(k - 1) * 1;
    }
    // 4 k + 1 <= n,  k >= 1
    {
      const k = (n - 1) / 4;
      ret += calc(k);
      ret += Mint(k) * 3;
    }
    // 4 k - 1 <= n,  k >= 2
    {
      const k = (n + 1) / 4;
      ret += (calc(k) - 1);
      ret += Mint(k - 1) * 3;
    }
  }
  debug {
    writefln("calc %s = %s", n, ret);
  }
  return cache[n] = ret;
}

void main() {
  debug {
    enum V = 2022 + 1;
    DList!int que;
    auto dist = new int[V];
    dist[] = -1;
    dist[0] = 0;
    que ~= 0;
    for (; !que.empty; ) {
      const u = que.front;
      que.removeFront;
      foreach (v; [u + 1, u - 1, u * 2]) if (0 <= v && v < V) {
        if (!~dist[v]) {
          dist[v] = dist[u] + 1;
          que ~= v;
        }
      }
    }
    writeln(dist[0 .. 256 + 1]);
    writeln(dist[0 .. 77 + 1].sum);
    writeln(dist[0 .. 2022 + 1].sum);
    foreach (e; 0 .. 8) {
      writeln(dist[1 << e .. 1 << (e + 1)]);
    }
    foreach (u; 4 .. 1 << 8) {
      int d;
      if (u % 2 == 0) {
        d = dist[u / 2] + 1;
      } else if (u % 4 == 1) {
        d = dist[u / 4] + 3;
      } else {
        d = dist[(u + 1) / 4] + 3;
      }
      assert(dist[u] == d, format("%s: %s %s", u, dist[u], d));
    }
  }
  
  try {
    for (; ; ) {
      const N = readLong;
      
      const ans = calc(N);
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
0