結果

問題 No.2950 Max Min Product
ユーザー 👑 hos.lyrichos.lyric
提出日時 2024-10-25 22:12:42
言語 D
(dmd 2.106.1)
結果
AC  
実行時間 223 ms / 3,000 ms
コード長 4,866 bytes
コンパイル時間 3,394 ms
コンパイル使用メモリ 152,520 KB
実行使用メモリ 18,308 KB
最終ジャッジ日時 2024-10-25 23:30:35
合計ジャッジ時間 11,570 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,812 KB
testcase_01 AC 1 ms
6,820 KB
testcase_02 AC 1 ms
6,820 KB
testcase_03 AC 145 ms
13,444 KB
testcase_04 AC 162 ms
17,632 KB
testcase_05 AC 152 ms
14,624 KB
testcase_06 AC 212 ms
16,896 KB
testcase_07 AC 212 ms
17,132 KB
testcase_08 AC 210 ms
18,308 KB
testcase_09 AC 103 ms
10,308 KB
testcase_10 AC 184 ms
16,436 KB
testcase_11 AC 160 ms
17,528 KB
testcase_12 AC 208 ms
18,024 KB
testcase_13 AC 209 ms
17,800 KB
testcase_14 AC 209 ms
16,940 KB
testcase_15 AC 195 ms
16,912 KB
testcase_16 AC 138 ms
12,776 KB
testcase_17 AC 155 ms
17,388 KB
testcase_18 AC 211 ms
17,652 KB
testcase_19 AC 210 ms
16,868 KB
testcase_20 AC 209 ms
17,996 KB
testcase_21 AC 121 ms
10,276 KB
testcase_22 AC 161 ms
15,264 KB
testcase_23 AC 107 ms
9,088 KB
testcase_24 AC 214 ms
18,240 KB
testcase_25 AC 208 ms
17,072 KB
testcase_26 AC 212 ms
18,100 KB
testcase_27 AC 138 ms
13,056 KB
testcase_28 AC 200 ms
18,040 KB
testcase_29 AC 145 ms
12,444 KB
testcase_30 AC 209 ms
16,932 KB
testcase_31 AC 211 ms
17,344 KB
testcase_32 AC 206 ms
16,888 KB
testcase_33 AC 161 ms
15,204 KB
testcase_34 AC 107 ms
8,920 KB
testcase_35 AC 156 ms
16,232 KB
testcase_36 AC 223 ms
18,104 KB
testcase_37 AC 218 ms
16,936 KB
testcase_38 AC 220 ms
17,036 KB
testcase_39 AC 2 ms
6,820 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; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

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 N = readInt;
      auto A = new int[N];
      foreach (i; 0 .. N) {
        A[i] = readInt;
      }
      
      Mint ans;
      
      auto as = new int[N + 1];
      auto bs = new int[N + 1];
      auto cs = new int[N + 1];
      auto ds = new int[N + 1];
      auto ess = new Mint[4][N + 1];
      void rec(int l, int r) {
        if (l + 1 == r) {
          ans += Mint(A[l]) * Mint(A[l]);
        } else {
          const m = (l + r) / 2;
          rec(l, m);
          rec(m, r);
          as[m] = cs[m] = int.max;
          bs[m] = ds[m] = int.min;
          foreach (u; 0 .. 4) ess[m][u] = 0;
          foreach_reverse (i; l .. m) {
            as[i] = min(A[i], as[i + 1]);
            bs[i] = max(A[i], bs[i + 1]);
          }
          foreach (i; m .. r) {
            cs[i + 1] = min(cs[i], A[i]);
            ds[i + 1] = max(ds[i], A[i]);
            ess[i + 1][0] = ess[i][0] + 1;
            ess[i + 1][1] = ess[i][1] + cs[i + 1];
            ess[i + 1][2] = ess[i][2] + ds[i + 1];
            ess[i + 1][3] = ess[i][3] + Mint(cs[i + 1]) * Mint(ds[i + 1]);
          }
          int j = m, k = m;
          foreach_reverse (i; l .. m) {
            for (; j < r && as[i] <= cs[j + 1]; ++j) {}
            for (; k < r && bs[i] >= ds[k + 1]; ++k) {}
            debug writefln("[%s, %s) %s %s %s", l, r, i, j, k);
            ans += Mint(as[i]) * Mint(bs[i]) * ess[min(j, k)][0];
            if (j < k) ans += Mint(bs[i]) * (ess[k][1] - ess[j][1]);
            if (k < j) ans += Mint(as[i]) * (ess[j][2] - ess[k][2]);
            ans += (ess[r][3] - ess[max(j, k)][3]);
          }
        }
      }
      rec(0, N);
      
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
0