結果

問題 No.1855 Intersected Lines
ユーザー 👑 hos.lyrichos.lyric
提出日時 2022-02-25 21:54:29
言語 D
(dmd 2.106.1)
結果
AC  
実行時間 206 ms / 2,000 ms
コード長 4,389 bytes
コンパイル時間 1,522 ms
コンパイル使用メモリ 155,912 KB
実行使用メモリ 7,124 KB
最終ジャッジ日時 2024-06-22 14:24:36
合計ジャッジ時間 7,817 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
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 1 ms
6,940 KB
testcase_04 AC 1 ms
6,940 KB
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 AC 188 ms
6,968 KB
testcase_09 AC 206 ms
6,996 KB
testcase_10 AC 192 ms
7,040 KB
testcase_11 AC 191 ms
6,972 KB
testcase_12 AC 190 ms
6,948 KB
testcase_13 AC 190 ms
7,044 KB
testcase_14 AC 195 ms
7,124 KB
testcase_15 AC 199 ms
7,088 KB
testcase_16 AC 192 ms
7,108 KB
testcase_17 AC 195 ms
7,104 KB
testcase_18 AC 189 ms
6,940 KB
testcase_19 AC 195 ms
6,944 KB
testcase_20 AC 193 ms
6,964 KB
testcase_21 AC 191 ms
7,052 KB
testcase_22 AC 196 ms
7,020 KB
testcase_23 AC 176 ms
7,104 KB
testcase_24 AC 176 ms
7,040 KB
testcase_25 AC 180 ms
7,044 KB
testcase_26 AC 180 ms
7,100 KB
testcase_27 AC 177 ms
6,944 KB
testcase_28 AC 1 ms
6,940 KB
testcase_29 AC 1 ms
6,944 KB
testcase_30 AC 1 ms
6,944 KB
testcase_31 AC 1 ms
6,940 KB
testcase_32 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(uint M_) {
  import std.conv : to;
  alias M = M_;
  uint x;
  this(ModInt a) { x = a.x; }
  this(uint x_) { x = x_ % M; }
  this(ulong x_) { x = x_ % M; }
  this(int x_) { x = ((x_ %= cast(int)(M)) < 0) ? (x_ + cast(int)(M)) : x_; }
  this(long x_) { x = cast(uint)(((x_ %= cast(long)(M)) < 0) ? (x_ + cast(long)(M)) : x_); }
  ref ModInt opAssign(T)(inout(T) a) if (is(T == uint) || is(T == ulong) || is(T == int) || is(T == long)) { return this = ModInt(a); }
  ref ModInt opOpAssign(string op, T)(T a) {
    static if (is(T == ModInt)) {
      static if (op == "+") { x = ((x += a.x) >= M) ? (x - M) : x; }
      else static if (op == "-") { x = ((x -= a.x) >= M) ? (x + M) : x; }
      else static if (op == "*") { x = cast(uint)((cast(ulong)(x) * a.x) % M); }
      else static if (op == "/") { this *= a.inv(); }
      else static assert(false);
      return this;
    } else static if (op == "^^") {
      if (a < 0) return this = inv()^^(-a);
      ModInt b = this, c = 1U;
      for (long e = a; e; e >>= 1) { if (e & 1) c *= b; b *= b; }
      return this = c;
    } else {
      return mixin("this " ~ op ~ "= ModInt(a)");
    }
  }
  ModInt inv() const {
    uint a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const q = a / b; const c = a - q * b; a = b; b = c; const w = y - cast(int)(q) * z; y = z; z = w; }
    assert(a == 1); return ModInt(y);
  }
  ModInt opUnary(string op)() const {
    static if (op == "+") { return this; }
    else static if (op == "-") { ModInt a; a.x = x ? (M - x) : 0U; return a; }
    else static assert(false);
  }
  ModInt opBinary(string op, T)(T a) const { return mixin("ModInt(this) " ~ op ~ "= a"); }
  ModInt opBinaryRight(string op, T)(T a) const { return mixin("ModInt(a) " ~ op ~ "= this"); }
  bool opCast(T: bool)() const { return (x != 0U); }
  string toString() const { return x.to!string; }
}

enum MO = 998244353;
alias Mint = ModInt!MO;




void main() {
  try {
    for (; ; ) {
      const L = readLong;
      const M = readInt;
      auto C = new char[M];
      auto V = new long[M];
      foreach (i; 0 .. M) {
        C[i] = readToken[0];
        V[i] = readLong;
      }
      
      long[2] as;
      foreach (i; 0 .. M) {
        const s = (C[i] == 'R') ? 0 : 1;
        as[s] += V[i];
      }
      debug {
        writeln("as = ", as);
      }
      foreach (s; 0 .. 2) {
        assert(as[s] % 2 == 0);
      }
      // (a-1)!! (b-1)!!
      
      Mint ans;
      
      // (1/((a-1)(a-3)) binom(a, 4)
      foreach (s; 0 .. 2) {
        ans += Mint(as[s]) * Mint(as[s] - 2) / 24;
      }
      
      // (1/((a-1)(b-1))) RBRB
      if (as[0] > 0 && as[1] > 0) {
        Mint[2] nows;
        Mint[2] sum1s, sum2s;
        Mint sum;
        foreach (i; 0 .. M) {
          const s = (C[i] == 'R') ? 0 : 1;
          sum += Mint(V[i]) * (sum1s[s] * nows[s] - sum2s[s]);
          sum1s[s] += Mint(V[i]) * nows[s];
          sum2s[s] += Mint(V[i]) * nows[s] * nows[s];
          nows[s ^ 1] += Mint(V[i]);
          debug {
            writefln("i = %s: sum = %s", i, sum);
          }
        }
        ans += sum / Mint(as[0] - 1) / Mint(as[1] - 1);
      }
      
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
0