結果

問題 No.1222 -101
ユーザー 👑 hos.lyrichos.lyric
提出日時 2020-09-04 22:44:16
言語 D
(dmd 2.106.1)
結果
AC  
実行時間 163 ms / 2,000 ms
コード長 4,544 bytes
コンパイル時間 2,454 ms
コンパイル使用メモリ 152,396 KB
実行使用メモリ 18,488 KB
最終ジャッジ日時 2023-09-04 09:48:34
合計ジャッジ時間 5,959 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 4 ms
4,924 KB
testcase_01 AC 5 ms
4,944 KB
testcase_02 AC 4 ms
4,884 KB
testcase_03 AC 4 ms
4,884 KB
testcase_04 AC 4 ms
4,824 KB
testcase_05 AC 4 ms
4,980 KB
testcase_06 AC 4 ms
4,808 KB
testcase_07 AC 5 ms
6,396 KB
testcase_08 AC 5 ms
4,920 KB
testcase_09 AC 4 ms
4,992 KB
testcase_10 AC 12 ms
8,000 KB
testcase_11 AC 11 ms
7,968 KB
testcase_12 AC 161 ms
18,396 KB
testcase_13 AC 163 ms
18,292 KB
testcase_14 AC 163 ms
17,356 KB
testcase_15 AC 90 ms
18,264 KB
testcase_16 AC 127 ms
18,272 KB
testcase_17 AC 154 ms
17,992 KB
testcase_18 AC 88 ms
17,664 KB
testcase_19 AC 109 ms
16,500 KB
testcase_20 AC 135 ms
18,248 KB
testcase_21 AC 128 ms
16,896 KB
testcase_22 AC 4 ms
4,928 KB
testcase_23 AC 4 ms
4,912 KB
testcase_24 AC 5 ms
6,736 KB
testcase_25 AC 4 ms
6,388 KB
testcase_26 AC 4 ms
4,948 KB
testcase_27 AC 4 ms
4,884 KB
testcase_28 AC 4 ms
4,892 KB
testcase_29 AC 4 ms
4,884 KB
testcase_30 AC 4 ms
4,948 KB
testcase_31 AC 5 ms
6,704 KB
testcase_32 AC 158 ms
17,672 KB
testcase_33 AC 160 ms
17,972 KB
testcase_34 AC 159 ms
18,488 KB
testcase_35 AC 157 ms
17,904 KB
testcase_36 AC 161 ms
18,236 KB
testcase_37 AC 158 ms
17,476 KB
testcase_38 AC 155 ms
18,204 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;

enum LIM = 2 * 10^^5 + 10;
enum INV2 = Mint(2).inv;

void main() {
  auto two = new Mint[LIM];
  auto invTwo = new Mint[LIM];
  two[0] = invTwo[0] = 1;
  foreach (i; 1 .. LIM) {
    two[i] = two[i - 1] * 2;
    invTwo[i] = invTwo[i - 1] * INV2;
  }
  
  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 fs = new int[N + 1];
      auto cons = new int[N + 2];
      cons[] = -1;
      int num;
      foreach (i; 0 .. M) {
        if (P[i] == 0) {
          cons[R[i]] = i;
        } else {
          ++fs[L[i]];
          --fs[R[i]];
          ++num;
        }
      }
      foreach (x; 0 .. N) {
        fs[x + 1] += fs[x];
      }
      debug {
        writeln("fs = ", fs);
      }
      
      auto dp = new Mint[N + 2];
      auto dpSum = new Mint[N + 2 + 1];
      dp[0] = 1;
      dpSum[1] = dpSum[0] + dp[0] * invTwo[0];
      int maxL = -1;
      foreach (x; 0 .. N + 1) {
        if (fs[x] == 0) {
          debug {
            writefln("x = %s: maxL = %s", x, maxL);
          }
          dp[x + 1] = (dpSum[x + 1] - dpSum[maxL + 1]) * two[x];
        }
        dpSum[x + 1 + 1] = dpSum[x + 1] + dp[x + 1] * invTwo[x + 1];
        const i = cons[x + 1];
        if (i != -1) {
          chmax(maxL, L[i]);
        }
      }
      debug {
        writeln("dp = ", dp);
      }
      
      Mint ans = dp[N + 1];
      ans *= invTwo[num];
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
0