結果

問題 No.1353 Limited Sequence
ユーザー 👑 hos.lyrichos.lyric
提出日時 2021-01-17 14:39:41
言語 D
(dmd 2.106.1)
結果
AC  
実行時間 245 ms / 2,000 ms
コード長 4,284 bytes
コンパイル時間 1,522 ms
コンパイル使用メモリ 153,240 KB
実行使用メモリ 25,348 KB
最終ジャッジ日時 2023-09-04 11:54:47
合計ジャッジ時間 8,581 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 13 ms
8,196 KB
testcase_01 AC 13 ms
7,944 KB
testcase_02 AC 14 ms
8,688 KB
testcase_03 AC 13 ms
8,116 KB
testcase_04 AC 14 ms
8,140 KB
testcase_05 AC 13 ms
8,120 KB
testcase_06 AC 14 ms
8,468 KB
testcase_07 AC 13 ms
8,040 KB
testcase_08 AC 13 ms
7,988 KB
testcase_09 AC 13 ms
8,044 KB
testcase_10 AC 13 ms
8,036 KB
testcase_11 AC 13 ms
8,052 KB
testcase_12 AC 115 ms
20,752 KB
testcase_13 AC 141 ms
15,856 KB
testcase_14 AC 37 ms
13,580 KB
testcase_15 AC 89 ms
17,132 KB
testcase_16 AC 19 ms
9,316 KB
testcase_17 AC 30 ms
11,740 KB
testcase_18 AC 131 ms
21,216 KB
testcase_19 AC 153 ms
22,364 KB
testcase_20 AC 52 ms
14,880 KB
testcase_21 AC 22 ms
10,148 KB
testcase_22 AC 28 ms
9,772 KB
testcase_23 AC 119 ms
14,772 KB
testcase_24 AC 99 ms
13,832 KB
testcase_25 AC 143 ms
21,540 KB
testcase_26 AC 82 ms
13,572 KB
testcase_27 AC 54 ms
11,532 KB
testcase_28 AC 48 ms
14,420 KB
testcase_29 AC 37 ms
8,752 KB
testcase_30 AC 104 ms
11,524 KB
testcase_31 AC 79 ms
14,472 KB
testcase_32 AC 55 ms
19,196 KB
testcase_33 AC 24 ms
13,352 KB
testcase_34 AC 76 ms
24,748 KB
testcase_35 AC 35 ms
14,032 KB
testcase_36 AC 35 ms
15,096 KB
testcase_37 AC 242 ms
24,616 KB
testcase_38 AC 224 ms
24,908 KB
testcase_39 AC 237 ms
25,252 KB
testcase_40 AC 241 ms
24,876 KB
testcase_41 AC 242 ms
24,660 KB
testcase_42 AC 229 ms
25,240 KB
testcase_43 AC 240 ms
24,508 KB
testcase_44 AC 239 ms
25,304 KB
testcase_45 AC 230 ms
24,992 KB
testcase_46 AC 245 ms
25,348 KB
testcase_47 AC 115 ms
24,932 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_) {
  import std.conv : to;
  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 == "^^") {
      if (a < 0) return (this = inv()^^(-a));
      ModInt t2 = this, te = ModInt(1);
      for (long e = a; e > 0; 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 { 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");
  }
  bool opCast(T: bool)() const { return (x != 0); }
  string toString() const { return x.to!string; }
}

enum MO = 998244353;
alias Mint = ModInt!MO;

enum LIM = 4 * 10^^5 + 10;
Mint[] inv, fac, invFac;
void prepare() {
  inv = new Mint[LIM];
  fac = new Mint[LIM];
  invFac = new Mint[LIM];
  inv[1] = 1;
  foreach (i; 2 .. LIM) {
    inv[i] = -(Mint.M / i) * inv[cast(size_t)(Mint.M % i)];
  }
  fac[0] = invFac[0] = 1;
  foreach (i; 1 .. LIM) {
    fac[i] = fac[i - 1] * i;
    invFac[i] = invFac[i - 1] * inv[i];
  }
}
Mint binom(long n, long k) {
  if (0 <= k && k <= n) {
    assert(n < LIM);
    return fac[cast(size_t)(n)] * invFac[cast(size_t)(k)] * invFac[cast(size_t)(n - k)];
  } else {
    return Mint(0);
  }
}


Mint calc(int x, int y) {
  return binom(x + y, x);
}

void main() {
  prepare;
  
  try {
    for (; ; ) {
      const N = readInt();
      const L = readInt();
      const R = readInt();
      auto A = new int[N + 1];
      foreach (i; 1 .. N + 1) {
        A[i] = readInt();
      }
      
      auto dp = new Mint[][](R + 1, N + 1);
      dp[0][0] = 1;
      foreach (s; 0 .. R) {
        const sum = dp[s].sum;
        foreach (i; 1 .. N + 1) {
          int ss = s;
          foreach (j; 1 .. A[i] + 1) {
            ss += i;
            if (ss > R) {
              break;
            }
            dp[ss][i] += (sum - dp[s][i]);
          }
        }
      }
      
      Mint ans;
      foreach (s; L .. R + 1) {
        ans += dp[s].sum;
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
0