#828472 (D) No.2170 Left Addition Machine

提出ソース

結果

問題	No.2170 Left Addition Machine
ユーザー	👑 hos.lyric
提出日時	2022-12-25 20:48:34
言語	D (dmd 2.106.1)
結果	AC
実行時間	263 ms / 2,000 ms
コード長	4,244 bytes
コンパイル時間	1,517 ms
コンパイル使用メモリ	154,368 KB
実行使用メモリ	17,260 KB
最終ジャッジ日時	2024-06-22 17:09:57
合計ジャッジ時間	26,364 ms
ジャッジサーバーID （参考情報）	judge2 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 5,248 KB
testcase_01	AC	1 ms 5,376 KB
testcase_02	AC	2 ms 5,376 KB
testcase_03	AC	248 ms 12,196 KB
testcase_04	AC	96 ms 5,376 KB
testcase_05	AC	133 ms 7,048 KB
testcase_06	AC	156 ms 16,568 KB
testcase_07	AC	206 ms 17,260 KB
testcase_08	AC	27 ms 6,100 KB
testcase_09	AC	170 ms 6,188 KB
testcase_10	AC	27 ms 5,376 KB
testcase_11	AC	105 ms 15,228 KB
testcase_12	AC	249 ms 12,432 KB
testcase_13	AC	263 ms 12,428 KB
testcase_14	AC	247 ms 12,428 KB
testcase_15	AC	259 ms 12,432 KB
testcase_16	AC	245 ms 12,436 KB
testcase_17	AC	239 ms 12,400 KB
testcase_18	AC	251 ms 12,416 KB
testcase_19	AC	234 ms 12,432 KB
testcase_20	AC	234 ms 12,428 KB
testcase_21	AC	183 ms 5,376 KB
testcase_22	AC	173 ms 5,376 KB
testcase_23	AC	184 ms 5,376 KB
testcase_24	AC	181 ms 5,376 KB
testcase_25	AC	183 ms 5,376 KB
testcase_26	AC	166 ms 5,376 KB
testcase_27	AC	166 ms 5,376 KB
testcase_28	AC	169 ms 5,376 KB
testcase_29	AC	163 ms 5,376 KB
testcase_30	AC	222 ms 12,432 KB
testcase_31	AC	229 ms 12,428 KB
testcase_32	AC	221 ms 12,300 KB
testcase_33	AC	219 ms 12,432 KB
testcase_34	AC	220 ms 12,432 KB
testcase_35	AC	226 ms 12,276 KB
testcase_36	AC	221 ms 12,428 KB
testcase_37	AC	226 ms 12,304 KB
testcase_38	AC	231 ms 12,304 KB
testcase_39	AC	172 ms 5,376 KB
testcase_40	AC	209 ms 5,376 KB
testcase_41	AC	186 ms 5,376 KB
testcase_42	AC	171 ms 5,376 KB
testcase_43	AC	172 ms 5,376 KB
testcase_44	AC	173 ms 5,376 KB
testcase_45	AC	168 ms 5,376 KB
testcase_46	AC	165 ms 5,376 KB
testcase_47	AC	186 ms 5,376 KB
testcase_48	AC	230 ms 12,420 KB
testcase_49	AC	240 ms 12,420 KB
testcase_50	AC	235 ms 12,424 KB
testcase_51	AC	221 ms 12,436 KB
testcase_52	AC	225 ms 12,432 KB
testcase_53	AC	223 ms 12,380 KB
testcase_54	AC	236 ms 12,432 KB
testcase_55	AC	237 ms 12,432 KB
testcase_56	AC	256 ms 12,428 KB
testcase_57	AC	257 ms 12,452 KB
testcase_58	AC	246 ms 12,456 KB
testcase_59	AC	263 ms 12,452 KB
testcase_60	AC	259 ms 12,452 KB
testcase_61	AC	234 ms 12,432 KB
testcase_62	AC	240 ms 12,428 KB
testcase_63	AC	228 ms 12,300 KB
testcase_64	AC	227 ms 12,384 KB
testcase_65	AC	226 ms 12,448 KB
testcase_66	AC	63 ms 5,376 KB
testcase_67	AC	207 ms 12,428 KB
testcase_68	AC	224 ms 12,296 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

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) {
  }
}

yukicoder

結果

テストケース

ソースコード