#1031204 (D) No.2989 Fibonacci Prize

提出ソース

結果

問題	No.2989 Fibonacci Prize
ユーザー	👑 hos.lyric
提出日時	2024-12-14 00:15:08
言語	D (dmd 2.106.1)
結果	WA
実行時間	-
コード長	4,319 bytes
コンパイル時間	2,525 ms
コンパイル使用メモリ	119,948 KB
実行使用メモリ	7,296 KB
最終ジャッジ日時	2024-12-14 00:15:39
合計ジャッジ時間	3,802 ms
ジャッジサーバーID （参考情報）	judge5 / judge1

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 5,248 KB
testcase_01	WA	-
testcase_02	AC	11 ms 5,248 KB
testcase_03	WA	-
testcase_04	AC	1 ms 5,248 KB
testcase_05	AC	2 ms 5,248 KB
testcase_06	AC	1 ms 5,248 KB
testcase_07	AC	1 ms 5,248 KB
testcase_08	AC	1 ms 5,248 KB
testcase_09	AC	1 ms 5,248 KB
testcase_10	AC	2 ms 5,248 KB
testcase_11	AC	1 ms 5,248 KB
testcase_12	AC	1 ms 5,248 KB
testcase_13	AC	1 ms 5,248 KB
testcase_14	AC	1 ms 5,248 KB
testcase_15	WA	-
testcase_16	AC	1 ms 5,248 KB
testcase_17	AC	1 ms 5,248 KB
testcase_18	AC	1 ms 5,248 KB
testcase_19	AC	1 ms 5,248 KB
testcase_20	AC	1 ms 5,248 KB
testcase_21	AC	1 ms 5,248 KB
testcase_22	AC	1 ms 5,248 KB
testcase_23	AC	2 ms 5,248 KB
testcase_24	AC	11 ms 5,248 KB
testcase_25	AC	12 ms 5,248 KB
testcase_26	AC	2 ms 5,248 KB
testcase_27	AC	2 ms 5,248 KB
testcase_28	AC	5 ms 5,248 KB
testcase_29	AC	4 ms 5,248 KB
testcase_30	AC	2 ms 5,248 KB
testcase_31	AC	2 ms 5,248 KB
testcase_32	AC	1 ms 5,248 KB
testcase_33	WA	-
testcase_34	AC	4 ms 5,248 KB
testcase_35	WA	-
testcase_36	AC	11 ms 5,248 KB
testcase_37	WA	-
testcase_38	AC	3 ms 5,248 KB
testcase_39	WA	-
testcase_40	AC	3 ms 5,248 KB
testcase_41	WA	-
testcase_42	AC	11 ms 5,248 KB
testcase_43	AC	63 ms 7,296 KB
testcase_44	AC	60 ms 7,236 KB
testcase_45	WA	-
testcase_46	AC	41 ms 6,272 KB
testcase_47	AC	41 ms 6,272 KB
testcase_48	WA	-
testcase_49	AC	40 ms 6,144 KB
testcase_50	AC	40 ms 6,144 KB
testcase_51	WA	-
testcase_52	AC	40 ms 6,144 KB
testcase_53	AC	40 ms 6,016 KB
testcase_54	WA	-
testcase_55	AC	36 ms 5,760 KB
testcase_56	AC	35 ms 5,760 KB
testcase_57	WA	-
testcase_58	AC	40 ms 6,144 KB
testcase_59	AC	39 ms 6,144 KB
testcase_60	WA	-
testcase_61	AC	35 ms 5,632 KB
testcase_62	AC	34 ms 5,632 KB
testcase_63	WA	-
testcase_64	WA	-
testcase_65	WA	-
testcase_66	WA	-
testcase_67	WA	-
testcase_68	AC	1 ms 5,248 KB
testcase_69	AC	1 ms 5,248 KB
testcase_70	WA	-
testcase_71	AC	1 ms 5,248 KB
testcase_72	AC	2 ms 5,248 KB
testcase_73	AC	1 ms 5,248 KB
testcase_74	AC	1 ms 5,248 KB
testcase_75	WA	-
testcase_76	AC	1 ms 5,248 KB
testcase_77	AC	1 ms 5,248 KB
testcase_78	AC	1 ms 5,248 KB
testcase_79	AC	1 ms 5,248 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; }

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 N = readInt;
      const M = readLong;
      Mint.M = N;
      
      long per;
      {
        Mint a = 0, b = 1;
        for (; ; ) {
          ++per;
          swap(a, b);
          b += a;
          if (a == Mint(0) && b == Mint(1)) break;
        }
      }
      debug writeln("per = ", per);
      
      auto fib = new Mint[per + 2];
      fib[0] = 0;
      fib[1] = 1;
      foreach (i; 2 .. per + 2) {
        fib[i] = fib[i - 1] + fib[i - 2];
      }
      debug if (N <= 50) writeln("fib = ", fib);
      
      const quo = (M + 1) / per;
      const rem = (M + 1) % per;
      auto fs = new long[N];
      foreach (i; 0 .. per) fs[fib[i].x] += quo;
      foreach (i; 0 .. rem) fs[fib[i].x] += 1;
      fs[0 % N] -= 1;
      fs[1 % N] -= 1;
      debug if (N <= 50) writeln("fs = ", fs);
      
      long ans;
      foreach (u; 0 .. N) ans += fs[u] * (fs[u] - 1) / 2;
      
      // fib[M]
      // fib[M-1]
      // fib[M-1] + fib[M-2]
      // if (1 <= M     && !fib[ M      % per]) ans += 1;
      if (1 <= M - 1 && !fib[(M - 1) % per]) ans += 1;
      if (1 <= M - 2 && !fib[ M      % per]) ans += 1;
      
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}

yukicoder

結果

テストケース

ソースコード