結果

問題 No.1067 #いろいろな色 / Red and Blue and more various colors (Middle)
ユーザー 👑 hos.lyrichos.lyric
提出日時 2020-05-29 21:49:20
言語 D
(dmd 2.106.1)
結果
AC  
実行時間 428 ms / 2,000 ms
コード長 4,136 bytes
コンパイル時間 1,127 ms
コンパイル使用メモリ 126,788 KB
実行使用メモリ 86,088 KB
最終ジャッジ日時 2024-06-22 07:13:32
合計ジャッジ時間 5,521 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,816 KB
testcase_01 AC 1 ms
6,944 KB
testcase_02 AC 1 ms
6,940 KB
testcase_03 AC 2 ms
6,944 KB
testcase_04 AC 1 ms
6,944 KB
testcase_05 AC 1 ms
6,940 KB
testcase_06 AC 1 ms
6,944 KB
testcase_07 AC 1 ms
6,944 KB
testcase_08 AC 1 ms
6,940 KB
testcase_09 AC 1 ms
6,940 KB
testcase_10 AC 1 ms
6,940 KB
testcase_11 AC 254 ms
55,692 KB
testcase_12 AC 166 ms
36,360 KB
testcase_13 AC 341 ms
75,284 KB
testcase_14 AC 186 ms
44,984 KB
testcase_15 AC 77 ms
20,124 KB
testcase_16 AC 70 ms
16,420 KB
testcase_17 AC 15 ms
6,944 KB
testcase_18 AC 201 ms
47,144 KB
testcase_19 AC 207 ms
48,256 KB
testcase_20 AC 100 ms
22,040 KB
testcase_21 AC 428 ms
84,624 KB
testcase_22 AC 428 ms
84,720 KB
testcase_23 AC 425 ms
86,088 KB
testcase_24 AC 1 ms
6,940 KB
testcase_25 AC 1 ms
6,940 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;


void main() {
  try {
    for (; ; ) {
      const N = readInt();
      const Q = readInt();
      auto A = new int[N];
      foreach (i; 0 .. N) {
        A[i] = readInt();
      }
      auto L = new int[Q];
      auto R = new int[Q];
      auto P = new int[Q];
      foreach (q; 0 .. Q) {
        L[q] = readInt();
        R[q] = readInt();
        P[q] = readInt();
      }
      
      A.sort.reverse;
      debug {
        writeln("A = ", A);
      }
      
      auto dp = new Mint[][N + 1];
      dp[0] = [Mint(1)];
      foreach (i; 0 .. N) {
        dp[i + 1] = new Mint[i + 1 + 1];
        foreach (j; 0 .. i + 1) {
          dp[i + 1][j] += dp[i][j] * (A[i] - 1);
          dp[i + 1][j + 1] += dp[i][j];
        }
      }
      
      auto rs = new Mint[N + 1];
      rs[N] = 1;
      foreach_reverse (i; 0 .. N) {
        rs[i] = A[i] * rs[i + 1];
      }
      
      foreach (q; 0 .. Q) {
        long ans;
        foreach (j; L[q] .. R[q] + 1) {
          const n = A.binarySearch!(a => (a < j));
          debug {
            writeln(j, ": ", n);
          }
          if (P[q] <= n) {
            ans ^= (dp[n][P[q]] * rs[n]).x;
          }
        }
        writeln(ans % MO);
      }
    }
  } catch (EOFException e) {
  }
}
0