結果

問題 No.2229 Treasure Searching Rod (Hard)
ユーザー 👑 hos.lyrichos.lyric
提出日時 2023-02-24 21:57:24
言語 D
(dmd 2.106.1)
結果
AC  
実行時間 171 ms / 2,000 ms
コード長 3,832 bytes
コンパイル時間 1,504 ms
コンパイル使用メモリ 149,836 KB
実行使用メモリ 21,420 KB
最終ジャッジ日時 2023-09-04 19:54:10
合計ジャッジ時間 9,068 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 2 ms
4,376 KB
testcase_03 AC 1 ms
4,380 KB
testcase_04 AC 1 ms
4,380 KB
testcase_05 AC 2 ms
4,380 KB
testcase_06 AC 2 ms
4,380 KB
testcase_07 AC 162 ms
20,208 KB
testcase_08 AC 164 ms
9,356 KB
testcase_09 AC 162 ms
21,000 KB
testcase_10 AC 159 ms
19,276 KB
testcase_11 AC 155 ms
21,420 KB
testcase_12 AC 87 ms
14,144 KB
testcase_13 AC 85 ms
13,560 KB
testcase_14 AC 77 ms
6,596 KB
testcase_15 AC 165 ms
8,352 KB
testcase_16 AC 171 ms
19,328 KB
testcase_17 AC 163 ms
9,608 KB
testcase_18 AC 163 ms
8,428 KB
testcase_19 AC 164 ms
10,520 KB
testcase_20 AC 163 ms
8,360 KB
testcase_21 AC 166 ms
10,192 KB
testcase_22 AC 163 ms
8,420 KB
testcase_23 AC 67 ms
10,220 KB
testcase_24 AC 89 ms
14,056 KB
testcase_25 AC 105 ms
14,016 KB
testcase_26 AC 39 ms
4,820 KB
testcase_27 AC 14 ms
4,380 KB
testcase_28 AC 141 ms
15,072 KB
testcase_29 AC 129 ms
7,276 KB
testcase_30 AC 20 ms
4,376 KB
testcase_31 AC 36 ms
4,724 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; }

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 = cast(uint)(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 H = readLong;
      const W = readInt;
      const K = readInt;
      auto X = new long[K];
      auto Y = new long[K];
      auto V = new long[K];
      foreach (k; 0 .. K) {
        X[k] = readInt;
        Y[k] = readInt;
        V[k] = readInt;
      }
      
      Mint ans;
      foreach (k; 0 .. K) {
        long area;
        const m = X[k];
        const l = max(m - (Y[k] - 1), 0);
        const r = max(m - (W - Y[k]), 0);
        area += m;
        area += (l + m - 1) * (m - l) / 2;
        area += (r + m - 1) * (m - r) / 2;
        debug {
          writeln(X[k], " ", Y[k], ": ", [l, m, r], " ", area);
        }
        ans += V[k] * area;
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
0