#362670 (D) No.856 増える演算

提出ソース

結果

問題	No.856 増える演算
ユーザー	👑 hos.lyric
提出日時	2019-07-26 22:23:28
言語	D (dmd 2.106.1)
結果	WA
実行時間	-
コード長	4,343 bytes
コンパイル時間	2,966 ms
コンパイル使用メモリ	183,164 KB
実行使用メモリ	23,160 KB
最終ジャッジ日時	2024-06-22 02:00:21
合計ジャッジ時間	11,790 ms
ジャッジサーバーID （参考情報）	judge2 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	71 ms 20,344 KB
testcase_01	AC	70 ms 20,256 KB
testcase_02	AC	70 ms 19,620 KB
testcase_03	AC	71 ms 21,676 KB
testcase_04	AC	69 ms 19,568 KB
testcase_05	AC	72 ms 19,572 KB
testcase_06	AC	71 ms 20,112 KB
testcase_07	AC	69 ms 19,316 KB
testcase_08	AC	69 ms 19,856 KB
testcase_09	AC	69 ms 20,052 KB
testcase_10	AC	71 ms 19,880 KB
testcase_11	AC	74 ms 21,180 KB
testcase_12	AC	70 ms 20,364 KB
testcase_13	AC	71 ms 19,364 KB
testcase_14	AC	71 ms 19,692 KB
testcase_15	AC	70 ms 20,316 KB
testcase_16	AC	71 ms 19,884 KB
testcase_17	AC	71 ms 19,728 KB
testcase_18	AC	70 ms 19,700 KB
testcase_19	AC	71 ms 19,480 KB
testcase_20	AC	72 ms 20,484 KB
testcase_21	AC	72 ms 19,276 KB
testcase_22	AC	70 ms 19,356 KB
testcase_23	AC	74 ms 19,264 KB
testcase_24	AC	76 ms 20,988 KB
testcase_25	AC	72 ms 19,420 KB
testcase_26	AC	71 ms 20,240 KB
testcase_27	AC	74 ms 20,848 KB
testcase_28	AC	81 ms 20,792 KB
testcase_29	AC	73 ms 19,836 KB
testcase_30	AC	71 ms 20,264 KB
testcase_31	AC	70 ms 19,564 KB
testcase_32	AC	73 ms 19,520 KB
testcase_33	AC	76 ms 19,972 KB
testcase_34	AC	83 ms 21,308 KB
testcase_35	AC	85 ms 19,904 KB
testcase_36	AC	83 ms 20,732 KB
testcase_37	AC	79 ms 20,632 KB
testcase_38	AC	71 ms 19,336 KB
testcase_39	AC	74 ms 19,856 KB
testcase_40	AC	74 ms 21,632 KB
testcase_41	AC	72 ms 19,816 KB
testcase_42	AC	82 ms 20,016 KB
testcase_43	AC	77 ms 20,676 KB
testcase_44	AC	72 ms 19,908 KB
testcase_45	AC	76 ms 20,652 KB
testcase_46	AC	76 ms 19,560 KB
testcase_47	AC	78 ms 20,080 KB
testcase_48	AC	79 ms 20,780 KB
testcase_49	AC	75 ms 19,952 KB
testcase_50	AC	82 ms 20,616 KB
testcase_51	AC	81 ms 21,456 KB
testcase_52	AC	82 ms 20,976 KB
testcase_53	AC	117 ms 20,448 KB
testcase_54	AC	102 ms 20,500 KB
testcase_55	AC	119 ms 20,260 KB
testcase_56	AC	100 ms 20,648 KB
testcase_57	AC	121 ms 20,800 KB
testcase_58	AC	111 ms 21,264 KB
testcase_59	AC	135 ms 22,132 KB
testcase_60	AC	101 ms 20,776 KB
testcase_61	AC	130 ms 22,688 KB
testcase_62	AC	128 ms 22,200 KB
testcase_63	AC	76 ms 19,552 KB
testcase_64	AC	121 ms 20,488 KB
testcase_65	AC	92 ms 20,916 KB
testcase_66	AC	104 ms 20,756 KB
testcase_67	AC	109 ms 19,920 KB
testcase_68	AC	121 ms 21,564 KB
testcase_69	AC	123 ms 20,964 KB
testcase_70	AC	134 ms 22,592 KB
testcase_71	AC	127 ms 22,352 KB
testcase_72	AC	119 ms 20,232 KB
testcase_73	AC	137 ms 22,664 KB
testcase_74	AC	137 ms 22,968 KB
testcase_75	AC	144 ms 22,984 KB
testcase_76	AC	138 ms 22,736 KB
testcase_77	AC	141 ms 23,024 KB
testcase_78	AC	137 ms 23,160 KB
testcase_79	AC	138 ms 22,636 KB
testcase_80	AC	139 ms 22,708 KB
testcase_81	AC	137 ms 22,780 KB
testcase_82	WA	-

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

コンパイルメッセージ

Main.d(142): Deprecation: function `std.math.exponential.log` is deprecated - `std.math.exponential.log` called with argument types `(long)` matches both `log(real)`, `log(double)`, and `log(float)`. Cast argument to floating point type instead.
Main.d(142): Deprecation: function `std.math.exponential.log` is deprecated - `std.math.exponential.log` called with argument types `(long)` matches both `log(real)`, `log(double)`, and `log(float)`. Cast argument to floating point type instead.

ソースコード

raw source code

import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, 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(long M) {
  long x;
  this(in ModInt a) { x = a.x; }
  this(in long a) { x = a % M; if (x < 0) x += M; }
  ref ModInt opAssign(in long a) { return this = ModInt(a); }
  ref ModInt opOpAssign(string op)(in ModInt a) {
    static if (op == "+") { x += a.x; if (x >= M) x -= M; }
    else static if (op == "-") { x -= a.x; if (x < 0) x += M; }
    else static if (op == "*") { x *= a.x; x %= M; }
    else static assert(false);
    return this;
  }
  ref ModInt opOpAssign(string op)(in long a) { return mixin("this " ~ op ~ "= ModInt(a)"); }
  ModInt opUnary(string op)() const if (op == "-") { return ModInt(-x); }
  ModInt opBinary(string op, T)(in T a) const { return mixin("ModInt(this) " ~ op ~ "= a"); }
  ModInt opBinaryRight(string op)(in long a) const { return mixin("ModInt(a) " ~ op ~ "= this"); }
  string toString() const { return x.to!string; }
}


// a^-1 (mod m)
long modInv(long a, long m)
in {
  assert(m > 0, "modInv: m > 0 must hold");
}
do {
  long b = m, x = 1, y = 0, t;
  for (; ; ) {
    t = a / b;
    a -= t * b;
    if (a == 0) {
      assert(b == 1 || b == -1, "modInv: gcd(a, m) != 1");
      if (b == -1) {
        y = -y;
      }
      return (y < 0) ? (y + m) : y;
    }
    x -= t * y;
    t = b / a;
    b -= t * a;
    if (b == 0) {
      assert(a == 1 || a == -1, "modInv: gcd(a, m) != 1");
      if (a == -1) {
        x = -x;
      }
      return (x < 0) ? (x + m) : x;
    }
    y -= t * x;
  }
}


enum long MO = 1000000007;
alias Mint = ModInt!MO;

Mint power(Mint a, long e) {
  Mint x = a, y = 1;
  for (; e; e >>= 1) {
    if (e & 1) y *= x;
    x *= x;
  }
  return y;
}

enum L = 2^^18;

int N;
long[] A;

void main() {
  auto fft = new Fft(L);
  
  try {
    for (; ; ) {
      N = readInt();
assert(1<=N&&N<=10^^5);
      A = new long[N];
      foreach (i; 0 .. N) {
        A[i] = readInt();
      }
foreach(i;0..N)assert(1<=A[i]&&A[i]<=10^^5);
      
      auto f = new real[L];
      f[] = 0.0;
      foreach (i; 0 .. N) {
        f[cast(int)(A[i])] += 1;
      }
      auto ff = fft.fft(f);
      foreach (l; 0 .. L) {
        ff[l] = ff[l] * ff[l];
      }
      auto g = fft.inverseFft(ff);
      
      auto cnt = new int[L];
      foreach (l; 0 .. L) {
        cnt[l] = cast(int)(round(g[l].re));
      }
      foreach (i; 0 .. N) {
        --cnt[cast(int)(2 * A[i])];
      }
      cnt[] /= 2;
      debug {
        writeln("cnt = ", cnt[0 .. 20]);
      }
      
      Mint ans = 1;
      foreach (l; 0 .. L) {
        if (cnt[l] > 0) {
          ans *= power(Mint(l), cnt[l]);
        }
      }
      long ASum;
      foreach_reverse (i; 0 .. N) {
        ans *= power(Mint(A[i]), ASum);
        ASum += A[i];
        ASum %= (MO - 1);
      }
      
      long AMin = long.max;
      auto opt = tuple(real.infinity, 0L, 0L);
      foreach_reverse (i; 0 .. N) {
        if (i < N - 1) {
          chmin(opt, tuple(log(A[i] + AMin) + log(A[i]) * AMin, A[i], AMin));
        }
        chmin(AMin, A[i]);
      }
      debug {
        writeln("opt = ", opt);
      }
      Mint dnm = (opt[1] + opt[2]) * power(Mint(opt[1]), opt[2]);
      ans *= modInv(dnm.x, MO);
      
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード