#547425 (D) No.1222 -101

提出ソース

結果

問題	No.1222 -101
ユーザー	👑 hos.lyric
提出日時	2020-09-04 21:41:55
言語	D (dmd 2.106.1)
結果	WA
実行時間	-
コード長	6,232 bytes
コンパイル時間	1,430 ms
コンパイル使用メモリ	161,960 KB
実行使用メモリ	22,176 KB
最終ジャッジ日時	2024-06-22 08:51:42
合計ジャッジ時間	22,040 ms
ジャッジサーバーID （参考情報）	judge4 / judge1

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 6,816 KB
testcase_01	AC	1 ms 6,940 KB
testcase_02	AC	1 ms 6,944 KB
testcase_03	AC	1 ms 6,944 KB
testcase_04	WA	-
testcase_05	AC	1 ms 6,944 KB
testcase_06	AC	1 ms 6,940 KB
testcase_07	AC	1 ms 6,940 KB
testcase_08	WA	-
testcase_09	AC	1 ms 6,940 KB
testcase_10	WA	-
testcase_11	AC	772 ms 10,748 KB
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	WA	-
testcase_20	WA	-
testcase_21	WA	-
testcase_22	AC	1 ms 6,944 KB
testcase_23	AC	1 ms 6,940 KB
testcase_24	AC	1 ms 6,940 KB
testcase_25	AC	1 ms 6,944 KB
testcase_26	WA	-
testcase_27	AC	1 ms 6,948 KB
testcase_28	WA	-
testcase_29	WA	-
testcase_30	AC	1 ms 6,940 KB
testcase_31	AC	1 ms 6,944 KB
testcase_32	WA	-
testcase_33	WA	-
testcase_34	AC	865 ms 20,588 KB
testcase_35	AC	886 ms 21,456 KB
testcase_36	WA	-
testcase_37	WA	-
testcase_38	WA	-

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

ソースコード

raw source code

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;


// T, S: monoid
// opTT: T * T -> T
// opST: S * T * int -> T
//   (s t_a) ... (s t_{b-1}) = opST(s, t_a ... t_{b-1}, b - a)
// opSS: S * S -> S
// query(a, b, s): t_a <- s t_a, ..., t_{b-1} <- s t_{b-1};
//   returns t_a ... t_{b-1}
class SegmentTree(T, S, alias opTT, alias opST, alias opSS) {
  import std.functional : binaryFun;
  alias opTTFun = binaryFun!opTT;
  alias opSTFun = opST;
  alias opSSFun = binaryFun!opSS;
  const(T) idT;
  const(S) idS;

  int n;
  T[] ts;
  S[] ss;
  this(int n_, const(T) idT, const(S) idS) {
    this.idT = idT;
    this.idS = idS;
    for (n = 1; n < n_; n <<= 1) {}
    ts = new T[n << 1];
    ss = new S[n << 1];
    ts[] = idT;
    ss[] = idS;
  }
  ref T at(int a) {
    return ts[n + a];
  }
  void build() {
    foreach_reverse (a; 1 .. n) ts[a] = opTTFun(ts[a << 1], ts[a << 1 | 1]);
  }
  T query(int a, int b, const(S) s) {
    return query(1, 0, n, a, b, s);
  }

 private:
  T query(int u, int l, int r, int a, int b, const(S) s) {
    if (a < l) a = l;
    if (b > r) b = r;
    if (a >= b) return idT;
    if (a == l && b == r) {
      ts[u] = opSTFun(s, ts[u], r - l);
      ss[u] = opSSFun(s, ss[u]);
      return ts[u];
    }
    const int uL = u << 1, uR = u << 1 | 1;
    const int mid = (l + r) >> 1;
    // speed-up: if (ss[u] != idS)
    {
      ts[uL] = opSTFun(ss[u], ts[uL], mid - l);
      ts[uR] = opSTFun(ss[u], ts[uR], r - mid);
      ss[uL] = opSSFun(ss[u], ss[uL]);
      ss[uR] = opSSFun(ss[u], ss[uR]);
      ss[u] = idS;
    }
    const T resL = query(uL, l, mid, a, b, s);
    const T resR = query(uR, mid, r, a, b, s);
    ts[u] = opTTFun(ts[uL], ts[uR]);
    return opTTFun(resL, resR);
  }
}


void main() {
  alias Affine = Tuple!(Mint, "b", Mint, "c");
  const opTT = (Mint t0, Mint t1) {
    return t0 + t1;
  };
  const opST = (Affine s, Mint t, int sz) {
    return s.b * t + s.c * sz;
  };
  const opSS = (Affine s0, Affine s1) {
    return Affine(s0.b * s1.b, s0.b * s1.c + s0.c);
  };
  enum ID_S = Affine(Mint(1), Mint(0));
  
  try {
    for (; ; ) {
      const N = readInt();
      const M = readInt();
      auto L = new int[M];
      auto R = new int[M];
      auto P = new int[M];
      foreach (i; 0 .. M) {
        L[i] = readInt() - 1;
        R[i] = readInt();
        P[i] = readInt();
      }
      
      auto cons = new int[N + 1];
      cons[] = -1;
      foreach (i; 0 .. M) {
        cons[R[i]] = i;
      }
      
      auto seg = new SegmentTree!(Mint, Affine, "a + b",
          (s, t, sz) => s.b * t + s.c * sz,
          (s0, s1) => Affine(s0.b * s1.b, s0.b * s1.c + s0.c))
          (N, Mint(0), Affine(Mint(1), Mint(0)));
      seg.query(0, 1, Affine(Mint(1), Mint(1)));
      foreach (x; 0 .. N) {
        const all = seg.query(0, x + 1, ID_S);
        const i = cons[x + 1];
        if (i == -1) {
          seg.query(0, x + 1, Affine(Mint(2), Mint(0)));
          seg.query(x + 1, x + 2, Affine(Mint(1), all));
        } else if (P[i] == 0) {
          seg.query(0, L[i], Affine(Mint(0), Mint(0)));
          seg.query(L[i] + 1, x + 1, Affine(Mint(2), Mint(0)));
          seg.query(x + 1, x + 2, Affine(Mint(1), all));
        } else {
          seg.query(L[i] + 1, x + 1, Affine(Mint(0), Mint(0)));
        }
      }
      const ans = seg.query(0, N + 1, ID_S);
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}

yukicoder

結果

テストケース

ソースコード