結果

問題 No.995 タピオカオイシクナーレ
ユーザー 👑 hos.lyrichos.lyric
提出日時 2020-02-21 21:30:59
言語 D
(dmd 2.106.1)
結果
AC  
実行時間 58 ms / 2,000 ms
コード長 4,136 bytes
コンパイル時間 1,779 ms
コンパイル使用メモリ 155,304 KB
実行使用メモリ 13,404 KB
最終ジャッジ日時 2024-06-22 05:28:55
合計ジャッジ時間 2,996 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,812 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 1 ms
6,944 KB
testcase_03 AC 1 ms
6,944 KB
testcase_04 AC 2 ms
6,940 KB
testcase_05 AC 1 ms
6,940 KB
testcase_06 AC 1 ms
6,944 KB
testcase_07 AC 1 ms
6,944 KB
testcase_08 AC 1 ms
6,940 KB
testcase_09 AC 1 ms
6,944 KB
testcase_10 AC 1 ms
6,940 KB
testcase_11 AC 1 ms
6,944 KB
testcase_12 AC 2 ms
6,944 KB
testcase_13 AC 1 ms
6,944 KB
testcase_14 AC 2 ms
6,944 KB
testcase_15 AC 2 ms
6,944 KB
testcase_16 AC 58 ms
11,740 KB
testcase_17 AC 58 ms
13,404 KB
testcase_18 AC 56 ms
11,784 KB
testcase_19 AC 55 ms
11,740 KB
testcase_20 AC 58 ms
13,388 KB
testcase_21 AC 57 ms
13,064 KB
testcase_22 AC 56 ms
11,716 KB
testcase_23 AC 57 ms
11,692 KB
testcase_24 AC 56 ms
11,704 KB
testcase_25 AC 57 ms
11,692 KB
権限があれば一括ダウンロードができます

ソースコード

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(int M_) {
  alias M = M_;
  int x;
  this(ModInt a) { x = a.x; }
  this(long a) { x = cast(int)(a % M); if (x < 0) x += M; }
  ref ModInt opAssign(long a) { return (this = ModInt(a)); }
  ref ModInt opOpAssign(string op)(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 = cast(int)((cast(long)(x) * a.x) % M); }
    else static if (op == "/") { this *= a.inv(); }
    else static assert(false);
    return this;
  }
  ref ModInt opOpAssign(string op)(long a) {
    static if (op == "^^") {
      ModInt t2 = this, te = ModInt(1);
      for (long e = a; e; e >>= 1) {
        if (e & 1) te *= t2;
        t2 *= t2;
      }
      x = cast(int)(te.x);
      return this;
    } else return mixin("this " ~ op ~ "= ModInt(a)");
  }
  ModInt inv() const {
    int a = x, b = M, y = 1, z = 0, t;
    for (; ; ) {
      t = a / b; a -= t * b;
      if (a == 0) {
        assert(b == 1 || b == -1);
        return ModInt(b * z);
      }
      y -= t * z;
      t = b / a; b -= t * a;
      if (b == 0) {
        assert(a == 1 || a == -1);
        return ModInt(a * y);
      }
      z -= t * y;
    }
  }
  ModInt opUnary(string op)() const if (op == "-") { return ModInt(-x); }
  ModInt opBinary(string op, T)(T a) const { return mixin("ModInt(this) " ~ op ~ "= a"); }
  ModInt opBinaryRight(string op)(long a) const { return mixin("ModInt(a) " ~ op ~ "= this"); }
  string toString() const { return x.to!string; }
}

enum MO = 10^^9 + 7;
alias Mint = ModInt!MO;


// square matrices
Mint[][] mul(Mint[][] a, Mint[][] b) {
  const size = cast(int)(a.length);
  auto c = new Mint[][](size, size);
  foreach (i; 0 .. size) foreach (k; 0 .. size) foreach (j; 0 .. size) {
    c[i][j] += a[i][k] * b[k][j];
  }
  return c;
}
Mint[] mul(Mint[][] a, Mint[] x) {
  const size = cast(int)(a.length);
  auto y = new Mint[size];
  foreach (i; 0 .. size) foreach (j; 0 .. size) {
    y[i] += a[i][j] * x[j];
  }
  return y;
}
Mint[][] power(Mint[][] a, long e) {
  const size = cast(int)(a.length);
  auto b = new Mint[][](size, size), c = new Mint[][](size, size);
  foreach (i; 0 .. size) foreach (j; 0 .. size) b[i][j] = a[i][j];
  foreach (i; 0 .. size) foreach (j; 0 .. size) c[i][j] = (i == j) ? 1 : 0;
  for (; e; e >>= 1) {
    if (e & 1) c = mul(c, b);
    b = mul(b, b);
  }
  return c;
}


void main() {
  try {
    for (; ; ) {
      const N = readInt();
      const M = readInt();
      const K = readLong();
      const P = readLong();
      const Q = readLong();
      auto B = new long[N];
      foreach (i; 0 .. N) {
        B[i] = readLong();
      }
      
      const p = Mint(P) / Mint(Q);
      Mint[][] a = [[1 - p, p], [p, 1 - p]];
      Mint[][] aa = a.power(K);
      Mint ans;
      foreach (i; 0 .. N) {
        ans += aa[1][(i < M) ? 1 : 0] * B[i];
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
0