#790267 (D) No.2045 Two Reflections

提出ソース

結果

問題	No.2045 Two Reflections
ユーザー	👑 hos.lyric
提出日時	2022-08-19 22:04:49
言語	D (dmd 2.106.1)
結果	AC
実行時間	9 ms / 2,000 ms
コード長	4,333 bytes
コンパイル時間	1,637 ms
コンパイル使用メモリ	161,276 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-06-22 16:02:40
合計ジャッジ時間	2,614 ms
ジャッジサーバーID （参考情報）	judge5 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 6,812 KB
testcase_01	AC	1 ms 6,944 KB
testcase_02	AC	4 ms 6,944 KB
testcase_03	AC	4 ms 6,940 KB
testcase_04	AC	4 ms 6,940 KB
testcase_05	AC	1 ms 6,940 KB
testcase_06	AC	1 ms 6,944 KB
testcase_07	AC	4 ms 6,944 KB
testcase_08	AC	4 ms 6,940 KB
testcase_09	AC	1 ms 6,940 KB
testcase_10	AC	1 ms 6,940 KB
testcase_11	AC	2 ms 6,944 KB
testcase_12	AC	1 ms 6,940 KB
testcase_13	AC	1 ms 6,944 KB
testcase_14	AC	1 ms 6,940 KB
testcase_15	AC	1 ms 6,940 KB
testcase_16	AC	1 ms 6,944 KB
testcase_17	AC	1 ms 6,940 KB
testcase_18	AC	1 ms 6,940 KB
testcase_19	AC	1 ms 6,944 KB
testcase_20	AC	9 ms 6,944 KB
testcase_21	AC	4 ms 6,944 KB
testcase_22	AC	4 ms 6,940 KB
testcase_23	AC	4 ms 6,940 KB
testcase_24	AC	5 ms 6,944 KB
testcase_25	AC	4 ms 6,944 KB
testcase_26	AC	3 ms 6,940 KB
testcase_27	AC	3 ms 6,944 KB
testcase_28	AC	3 ms 6,940 KB
testcase_29	AC	4 ms 6,944 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

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;


Mint solve(int N, int P, int Q) {
  Mint ans;
  if (P == 1 && Q == 1) {
    ans = 1;
  } else if (P == 1 || Q == 1) {
    ans = 2;
  } else if (P + Q <= N) {
    ans = 4;
  } else {
    auto ps = iota(N).array;
    auto qs = iota(N).array;
    ps[0 .. P].reverse;
    qs[N - Q .. N].reverse;
    int[] cs;
    auto vis = new bool[N];
    foreach (u; 0 .. N) if (!vis[u]) {
      int c;
      for (int v = u; ; ) {
        vis[v] = true;
        ++c;
        v = qs[ps[v]];
        if (v == u) {
          break;
        }
      }
      cs ~= c;
    }
    cs = cs.sort.uniq.array;
    debug {
      writeln("cs = ", cs);
    }
    
    auto mxs = new int[N + 1];
    foreach (c; cs) {
      int cc = c;
      for (int p = 2; p <= cc; ++p) if (cc % p == 0) {
        int e;
        do {
          ++e;
          cc /= p;
        } while (cc % p == 0);
        chmax(mxs[p], e);
      }
    }
    ans = 1;
    foreach (p; 2 .. N + 1) if (mxs[p]) {
      ans *= Mint(p)^^mxs[p];
    }
    ans *= 2;
  }
  return ans;
}

void main() {
  try {
    for (; ; ) {
      const N = readInt;
      const P = readInt;
      const Q = readInt;
      
      const ans = solve(N, P, Q);
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}

yukicoder

結果

テストケース

ソースコード