結果

問題 No.2128 Round up!!
ユーザー 👑 hos.lyrichos.lyric
提出日時 2022-11-18 21:57:08
言語 D
(dmd 2.106.1)
結果
AC  
実行時間 1,444 ms / 2,000 ms
コード長 4,506 bytes
コンパイル時間 1,308 ms
コンパイル使用メモリ 132,140 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-06-22 16:44:12
合計ジャッジ時間 12,854 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,816 KB
testcase_01 AC 276 ms
6,812 KB
testcase_02 AC 1 ms
6,944 KB
testcase_03 AC 335 ms
6,940 KB
testcase_04 AC 471 ms
6,940 KB
testcase_05 AC 798 ms
6,944 KB
testcase_06 AC 1,436 ms
6,944 KB
testcase_07 AC 1,432 ms
6,944 KB
testcase_08 AC 1,444 ms
6,944 KB
testcase_09 AC 336 ms
6,940 KB
testcase_10 AC 1,291 ms
6,940 KB
testcase_11 AC 1,236 ms
6,940 KB
testcase_12 AC 1,373 ms
6,940 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/numeric.d(3130): Warning: cannot inline function `std.numeric.gcdImpl!(BigInt).gcdImpl`

ソースコード

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 = cast(uint)(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;



void main() {
  try {
    for (; ; ) {
      const numCases = readInt;
      foreach (caseId; 0 .. numCases) {
        BigInt X = readLong;
        BigInt A = readLong;
        BigInt B = readLong;
        if (A > B) {
          swap(A, B);
        }
        const XSave = X;
        
        const G = gcd(A, B);
        const L = A / G * B;
        X %= L;
        if (X != 0) {
          X = L - X;
        }
        
        BigInt ans;
        if (A == B) {
          ans += 1;
          if (X % A != 0) {
            ans += 1;
          }
        } else {
          const k = X / B;
          const p = X / A * A;
          const q = X / B * B;
          // X
          if (p < X && q < X) {
            ans += 1;
          }
          // A
          ans += k;
          if (q < p) {
            ans += 1;
          }
          // B
          ans += (k + 1);
        }
        writeln(ans % MO);
        
        debug {
          if (L <= 10^^5) {
            bool[BigInt] vis;
            void dfs(BigInt x) {
              if (x !in vis) {
                vis[x] = true;
                dfs((x + A - 1) / A * A);
                dfs((x + B - 1) / B * B);
              }
            }
            dfs(XSave);
            const brt = cast(int)(vis.length);
            writeln("brt = ", brt);
            assert(brt == ans);
          }
        }
      }
    }
  } catch (EOFException e) {
  }
}
0