結果

問題 No.2847 Birthday Attack
ユーザー 👑 hos.lyrichos.lyric
提出日時 2024-08-23 21:25:15
言語 D
(dmd 2.106.1)
結果
AC  
実行時間 664 ms / 3,000 ms
コード長 3,947 bytes
コンパイル時間 1,824 ms
コンパイル使用メモリ 154,320 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-08-23 21:25:22
合計ジャッジ時間 6,950 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,816 KB
testcase_01 AC 2 ms
6,816 KB
testcase_02 AC 1 ms
6,944 KB
testcase_03 AC 42 ms
6,944 KB
testcase_04 AC 1 ms
6,940 KB
testcase_05 AC 664 ms
6,944 KB
testcase_06 AC 327 ms
6,944 KB
testcase_07 AC 561 ms
6,944 KB
testcase_08 AC 140 ms
6,940 KB
testcase_09 AC 340 ms
6,940 KB
testcase_10 AC 211 ms
6,944 KB
testcase_11 AC 126 ms
6,940 KB
testcase_12 AC 524 ms
6,940 KB
testcase_13 AC 575 ms
6,940 KB
testcase_14 AC 403 ms
6,940 KB
testcase_15 AC 284 ms
6,944 KB
testcase_16 AC 286 ms
6,944 KB
testcase_17 AC 250 ms
6,940 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/numeric.d(2999): Warning: cannot inline function `std.numeric.gcdImpl!ulong.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; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

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 {
  static int M;
  import std.conv : to;
  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; }
}

alias Mint = ModInt;


void main() {
  try {
    for (; ; ) {
      const X = readLong;
      const Y = readLong;
      Mint.M = readInt;
      
      Mint ans;
      void check(long a, long b) {
        ans += Mint(X - 2 * a) * Mint(Y - 2 * b);
      }
      for (long m = 1; m^^2 <= max(X, Y); ++m) {
        for (long n = (m & 1) + 1; n < m; n += 2) if (gcd(m, n) == 1) {
          const a = m^^2 - n^^2;
          const b = 2 * m * n;
          const c = m^^2 + n^^2;
          debug if (X <= 100 && Y <= 100) writeln([a, b, c]);
          foreach (k; 1 .. min(X / a, Y / b) / 2 + 1) check(k * a, k * b);
          foreach (k; 1 .. min(X / b, Y / a) / 2 + 1) check(k * b, k * a);
        }
      }
      ans *= 2;
      foreach (x; 1 .. X / 2 + 1) check(x, 0);
      foreach (y; 1 .. Y / 2 + 1) check(0, y);
      ans *= 2;
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
0