結果

問題 No.877 Range ReLU Query
ユーザー 👑 hos.lyric
提出日時 2019-09-06 21:46:03
言語 D
(dmd 2.109.1)
結果
RE  
実行時間 -
コード長 2,819 bytes
コンパイル時間 1,103 ms
コンパイル使用メモリ 132,092 KB
実行使用メモリ 25,744 KB
最終ジャッジ日時 2024-06-22 02:27:45
合計ジャッジ時間 4,494 ms
ジャッジサーバーID
(参考情報)
judge1 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample RE * 1
other RE * 20
権限があれば一括ダウンロードができます

ソースコード

diff #

import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, 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)); }


void bAdd(T)(T[] bit, int pos, T val)
in {
  assert(0 <= pos && pos < bit.length, "bAdd: 0 <= pos < |bit| must hold");
}
do {
  for (int x = pos; x < bit.length; x |= x + 1) {
    bit[x] += val;
  }
}

// sum of [0, pos)
T bSum(T)(T[] bit, int pos)
in {
  assert(0 <= pos && pos <= bit.length, "bSum: 0 <= pos <= |bit| must hold");
}
do {
  T sum = 0;
  for (int x = pos - 1; x >= 0; x = (x & (x + 1)) - 1) {
    sum += bit[x];
  }
  return sum;
}


int N, Q;
long[] A;
int[] L, R;
long[] X;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      Q = readInt();
      A = new long[N];
      foreach (i; 0 .. N) {
        A[i] = readLong();
      }
      L = new int[Q];
      R = new int[Q];
      X = new long[Q];
      foreach (q; 0 .. Q) {
        assert(1 == readInt());
        L[q] = readInt() - 1;
        R[q] = readInt();
        X[q] = readLong();
      }
      
      Tuple!(long, int)[] events;
      foreach (i; 0 .. N) {
        events ~= tuple(A[i], i);
      }
      foreach (q; 0 .. Q) {
        events ~= tuple(X[q], N + q);
      }
      sort(events);
      reverse(events);
      
      auto ans = new long[Q];
      auto bit0 = new long[N];
      auto bit1 = new long[N];
      foreach (event; events) {
        if (event[1] < N) {
          const i = event[1];
          bit0.bAdd(i, 1);
          bit1.bAdd(i, A[i]);
        } else {
          const q = event[1] - N;
          const res0 = bit0.bSum(R[q]) - bit0.bSum(L[q]);
          const res1 = bit1.bSum(R[q]) - bit1.bSum(L[q]);
          ans[q] = res1 - X[q] * res0;
        }
      }
      foreach (q; 0 .. Q) {
        writeln(ans[q]);
      }
    }
  } catch (EOFException e) {
  }
}
0