結果

問題 No.992 最長増加部分列の数え上げ
ユーザー 👑 hos.lyrichos.lyric
提出日時 2020-02-16 01:21:47
言語 D
(dmd 2.106.1)
結果
AC  
実行時間 163 ms / 2,000 ms
コード長 4,285 bytes
コンパイル時間 3,820 ms
コンパイル使用メモリ 160,256 KB
実行使用メモリ 13,252 KB
最終ジャッジ日時 2024-06-12 01:26:55
合計ジャッジ時間 11,981 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 1 ms
5,248 KB
testcase_02 AC 1 ms
5,376 KB
testcase_03 AC 1 ms
5,376 KB
testcase_04 AC 57 ms
6,228 KB
testcase_05 AC 41 ms
5,376 KB
testcase_06 AC 72 ms
7,108 KB
testcase_07 AC 50 ms
5,852 KB
testcase_08 AC 26 ms
5,376 KB
testcase_09 AC 53 ms
5,876 KB
testcase_10 AC 71 ms
7,108 KB
testcase_11 AC 92 ms
8,092 KB
testcase_12 AC 18 ms
5,376 KB
testcase_13 AC 47 ms
5,676 KB
testcase_14 AC 48 ms
5,680 KB
testcase_15 AC 19 ms
5,376 KB
testcase_16 AC 142 ms
12,416 KB
testcase_17 AC 27 ms
5,376 KB
testcase_18 AC 47 ms
5,668 KB
testcase_19 AC 88 ms
8,064 KB
testcase_20 AC 159 ms
13,192 KB
testcase_21 AC 159 ms
13,188 KB
testcase_22 AC 160 ms
13,188 KB
testcase_23 AC 163 ms
13,192 KB
testcase_24 AC 161 ms
13,188 KB
testcase_25 AC 162 ms
13,188 KB
testcase_26 AC 160 ms
13,252 KB
testcase_27 AC 162 ms
13,056 KB
testcase_28 AC 163 ms
13,184 KB
testcase_29 AC 162 ms
13,184 KB
testcase_30 AC 124 ms
12,816 KB
testcase_31 AC 121 ms
12,816 KB
testcase_32 AC 122 ms
12,816 KB
testcase_33 AC 128 ms
12,816 KB
testcase_34 AC 121 ms
12,692 KB
testcase_35 AC 103 ms
12,812 KB
testcase_36 AC 104 ms
12,812 KB
testcase_37 AC 108 ms
12,820 KB
testcase_38 AC 103 ms
12,812 KB
testcase_39 AC 103 ms
12,812 KB
testcase_40 AC 129 ms
11,484 KB
testcase_41 AC 133 ms
11,476 KB
testcase_42 AC 131 ms
11,484 KB
testcase_43 AC 130 ms
11,476 KB
testcase_44 AC 134 ms
11,476 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)); }

void bAdd(T)(T[] bit, int pos, T val)
in {
  assert(0 <= pos && pos < bit.length, "bAdd: 0 <= pos < |bit| must hold");
}
do {
  for (int x = pos; x < bit.length; x |= x + 1) {
    bit[x] += val;
  }
}

// sum of [0, pos)
T bSum(T)(T[] bit, int pos)
in {
  assert(0 <= pos && pos <= bit.length, "bSum: 0 <= pos <= |bit| must hold");
}
do {
  T ret = 0;
  for (int x = pos - 1; x >= 0; x = (x & (x + 1)) - 1) {
    ret += bit[x];
  }
  return ret;
}


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;

struct Info {
  int len;
  Mint num;
  this(int len, Mint num) {
    this.len = len;
    this.num = num;
  }
  this(int) {
    len = 0;
    num = 0;
  }
  Info opBinary(string op)(const(Info) o) const if (op == "+") {
    return (len > o.len) ? this : (len < o.len) ? o : Info(len, num + o.num);
  }
  ref Info opOpAssign(string op)(const(Info) o) if (op == "+") {
    return this = this + o;
  }
}

void main() {
  try {
    for (; ; ) {
      const N = readInt();
      auto A = new int[N];
      foreach (i; 0 .. N) {
        A[i] = readInt();
      }
      
      auto as = A.dup;
      as = as.sort.uniq.array;
      const asLen = cast(int)(as.length);
      
      auto bit = new Info[asLen];
      foreach (i; 0 .. N) {
        const pos = as.lowerBound(A[i]);
        auto tmp = bit.bSum(pos);
        if (tmp.len == 0) {
          tmp.num = 1;
        }
        ++tmp.len;
        bit.bAdd(pos, tmp);
      }
      const ans = bit.bSum(asLen);
      debug {
        writeln("ans = ", ans);
      }
      writeln(ans.num);
    }
  } catch (EOFException e) {
  }
}
0