結果

問題 No.2170 Left Addition Machine
ユーザー 👑 hos.lyrichos.lyric
提出日時 2022-12-25 20:48:34
言語 D
(dmd 2.107.1)
結果
AC  
実行時間 287 ms / 2,000 ms
コード長 4,244 bytes
コンパイル時間 3,422 ms
コンパイル使用メモリ 152,568 KB
実行使用メモリ 14,960 KB
最終ジャッジ日時 2023-09-04 19:28:43
合計ジャッジ時間 43,838 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,384 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 254 ms
13,476 KB
testcase_04 AC 117 ms
6,328 KB
testcase_05 AC 166 ms
7,324 KB
testcase_06 AC 158 ms
10,772 KB
testcase_07 AC 237 ms
11,568 KB
testcase_08 AC 30 ms
6,600 KB
testcase_09 AC 206 ms
6,936 KB
testcase_10 AC 33 ms
4,384 KB
testcase_11 AC 119 ms
9,808 KB
testcase_12 AC 279 ms
14,000 KB
testcase_13 AC 278 ms
13,988 KB
testcase_14 AC 279 ms
14,088 KB
testcase_15 AC 286 ms
13,996 KB
testcase_16 AC 284 ms
14,624 KB
testcase_17 AC 282 ms
14,072 KB
testcase_18 AC 282 ms
14,052 KB
testcase_19 AC 287 ms
14,064 KB
testcase_20 AC 284 ms
13,992 KB
testcase_21 AC 205 ms
6,088 KB
testcase_22 AC 205 ms
5,356 KB
testcase_23 AC 207 ms
6,076 KB
testcase_24 AC 206 ms
5,308 KB
testcase_25 AC 207 ms
6,080 KB
testcase_26 AC 205 ms
5,344 KB
testcase_27 AC 206 ms
6,364 KB
testcase_28 AC 205 ms
6,308 KB
testcase_29 AC 206 ms
6,592 KB
testcase_30 AC 280 ms
14,404 KB
testcase_31 AC 277 ms
14,036 KB
testcase_32 AC 282 ms
14,560 KB
testcase_33 AC 284 ms
14,120 KB
testcase_34 AC 277 ms
14,400 KB
testcase_35 AC 276 ms
13,988 KB
testcase_36 AC 279 ms
13,732 KB
testcase_37 AC 276 ms
13,972 KB
testcase_38 AC 279 ms
14,960 KB
testcase_39 AC 207 ms
6,816 KB
testcase_40 AC 207 ms
6,360 KB
testcase_41 AC 207 ms
5,308 KB
testcase_42 AC 207 ms
6,572 KB
testcase_43 AC 207 ms
6,560 KB
testcase_44 AC 208 ms
6,332 KB
testcase_45 AC 207 ms
6,372 KB
testcase_46 AC 207 ms
5,240 KB
testcase_47 AC 208 ms
5,380 KB
testcase_48 AC 277 ms
14,516 KB
testcase_49 AC 280 ms
14,004 KB
testcase_50 AC 284 ms
14,032 KB
testcase_51 AC 282 ms
13,780 KB
testcase_52 AC 280 ms
14,036 KB
testcase_53 AC 280 ms
13,976 KB
testcase_54 AC 274 ms
13,968 KB
testcase_55 AC 277 ms
13,972 KB
testcase_56 AC 275 ms
14,432 KB
testcase_57 AC 280 ms
13,760 KB
testcase_58 AC 276 ms
14,372 KB
testcase_59 AC 276 ms
14,728 KB
testcase_60 AC 280 ms
14,232 KB
testcase_61 AC 277 ms
14,112 KB
testcase_62 AC 279 ms
13,720 KB
testcase_63 AC 283 ms
13,760 KB
testcase_64 AC 282 ms
13,788 KB
testcase_65 AC 283 ms
13,864 KB
testcase_66 AC 76 ms
4,716 KB
testcase_67 AC 254 ms
13,944 KB
testcase_68 AC 283 ms
13,800 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 = 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;
      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];
      foreach (q; 0 .. Q) {
        L[q] = readInt - 1;
        R[q] = readInt;
      }
      
      const INV2 = Mint(2).inv;
      auto two = new Mint[N + 1];
      auto invTwo = new Mint[N + 1];
      two[0] = invTwo[0] = 1;
      foreach (i; 1 .. N + 1) {
        two[i] = two[i - 1] * 2;
        invTwo[i] = invTwo[i - 1] * INV2;
      }
      
      auto ls = new int[N];
      foreach (i; 0 .. N) {
        ls[i] = (i - 1 >= 0 && A[i - 1] < A[i]) ? ls[i - 1] : i;
      }
      auto sums = new Mint[N + 1];
      foreach (i; 0 .. N) {
        sums[i + 1] = sums[i] + two[i] * A[i];
      }
      
      foreach (q; 0 .. Q) {
        const r = R[q];
        const l = max(L[q], ls[r - 1]);
        Mint ans;
        ans += A[l];
        ans += invTwo[l + 1] * (sums[r] - sums[l + 1]);
        writeln(ans);
      }
      debug {
        writeln("========");
      }
    }
  } catch (EOFException e) {
  }
}
0