結果

問題 No.1331 Moving Penguin
ユーザー 👑 hos.lyrichos.lyric
提出日時 2021-01-08 21:51:14
言語 D
(dmd 2.107.1)
結果
AC  
実行時間 312 ms / 1,500 ms
コード長 3,692 bytes
コンパイル時間 1,594 ms
コンパイル使用メモリ 151,988 KB
実行使用メモリ 7,356 KB
最終ジャッジ日時 2023-09-04 11:47:33
合計ジャッジ時間 15,836 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 16 ms
4,384 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 2 ms
4,384 KB
testcase_04 AC 187 ms
6,272 KB
testcase_05 AC 283 ms
6,784 KB
testcase_06 AC 282 ms
5,984 KB
testcase_07 AC 283 ms
6,016 KB
testcase_08 AC 182 ms
6,008 KB
testcase_09 AC 184 ms
6,128 KB
testcase_10 AC 184 ms
5,796 KB
testcase_11 AC 185 ms
5,824 KB
testcase_12 AC 186 ms
6,952 KB
testcase_13 AC 185 ms
6,968 KB
testcase_14 AC 192 ms
6,016 KB
testcase_15 AC 192 ms
5,928 KB
testcase_16 AC 192 ms
6,236 KB
testcase_17 AC 184 ms
5,944 KB
testcase_18 AC 183 ms
5,808 KB
testcase_19 AC 184 ms
6,124 KB
testcase_20 AC 183 ms
5,892 KB
testcase_21 AC 183 ms
5,948 KB
testcase_22 AC 184 ms
6,976 KB
testcase_23 AC 186 ms
6,004 KB
testcase_24 AC 187 ms
5,960 KB
testcase_25 AC 186 ms
6,232 KB
testcase_26 AC 192 ms
6,572 KB
testcase_27 AC 193 ms
6,320 KB
testcase_28 AC 193 ms
6,316 KB
testcase_29 AC 187 ms
7,188 KB
testcase_30 AC 65 ms
5,380 KB
testcase_31 AC 110 ms
6,148 KB
testcase_32 AC 58 ms
4,380 KB
testcase_33 AC 86 ms
6,268 KB
testcase_34 AC 131 ms
5,340 KB
testcase_35 AC 309 ms
7,216 KB
testcase_36 AC 309 ms
6,368 KB
testcase_37 AC 309 ms
6,364 KB
testcase_38 AC 69 ms
4,428 KB
testcase_39 AC 187 ms
6,844 KB
testcase_40 AC 97 ms
6,072 KB
testcase_41 AC 286 ms
6,212 KB
testcase_42 AC 312 ms
6,356 KB
testcase_43 AC 312 ms
7,356 KB
testcase_44 AC 311 ms
6,192 KB
testcase_45 AC 310 ms
6,300 KB
testcase_46 AC 310 ms
6,640 KB
testcase_47 AC 311 ms
6,192 KB
testcase_48 AC 182 ms
5,872 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 = 10^^9 + 7;
alias Mint = ModInt!MO;

debug {
  enum L = 3;
} else {
  enum L = 300;
}

void main() {
  try {
    for (; ; ) {
      const N = readInt();
      auto A = new int[N + 1];
      foreach (i; 1 .. N + 1) {
        A[i] = readInt();
      }
      
      auto sums = new Mint[][](L, L);
      
      auto dp = new Mint[N + 1];
      foreach (i; 1 .. N + 1) {
        if (i == 1) {
          dp[i] += 1;
        }
        foreach (m; 1 .. L) {
          dp[i] += sums[m][i % m];
        }
        //
        if (A[i] != 1 && i + 1 <= N) {
          dp[i + 1] += dp[i];
        }
        if (A[i] < L) {
          sums[A[i]][i % A[i]] += dp[i];
        } else {
          for (int j = i; (j += A[i]) <= N; ) {
            dp[j] += dp[i];
          }
        }
      }
      writeln(dp[N]);
    }
  } catch (EOFException e) {
  }
}
0