結果

問題 No.2077 Get Minimum Algorithm
ユーザー 👑 hos.lyrichos.lyric
提出日時 2022-09-16 21:46:38
言語 D
(dmd 2.106.1)
結果
AC  
実行時間 247 ms / 3,000 ms
コード長 3,860 bytes
コンパイル時間 920 ms
コンパイル使用メモリ 122,572 KB
実行使用メモリ 14,284 KB
最終ジャッジ日時 2024-06-22 16:14:46
合計ジャッジ時間 11,608 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,812 KB
testcase_01 AC 1 ms
6,940 KB
testcase_02 AC 1 ms
6,940 KB
testcase_03 AC 7 ms
6,940 KB
testcase_04 AC 15 ms
6,940 KB
testcase_05 AC 8 ms
6,944 KB
testcase_06 AC 9 ms
6,944 KB
testcase_07 AC 7 ms
6,944 KB
testcase_08 AC 17 ms
6,940 KB
testcase_09 AC 18 ms
6,940 KB
testcase_10 AC 9 ms
6,940 KB
testcase_11 AC 17 ms
6,940 KB
testcase_12 AC 237 ms
11,864 KB
testcase_13 AC 247 ms
11,724 KB
testcase_14 AC 233 ms
11,352 KB
testcase_15 AC 239 ms
11,724 KB
testcase_16 AC 238 ms
14,284 KB
testcase_17 AC 241 ms
11,472 KB
testcase_18 AC 240 ms
11,776 KB
testcase_19 AC 237 ms
11,092 KB
testcase_20 AC 243 ms
11,352 KB
testcase_21 AC 245 ms
13,272 KB
testcase_22 AC 212 ms
11,348 KB
testcase_23 AC 212 ms
13,372 KB
testcase_24 AC 211 ms
10,968 KB
testcase_25 AC 221 ms
11,220 KB
testcase_26 AC 216 ms
11,580 KB
testcase_27 AC 225 ms
13,464 KB
testcase_28 AC 220 ms
8,744 KB
testcase_29 AC 208 ms
8,972 KB
testcase_30 AC 232 ms
11,120 KB
testcase_31 AC 216 ms
8,796 KB
testcase_32 AC 203 ms
9,756 KB
testcase_33 AC 216 ms
11,476 KB
testcase_34 AC 195 ms
8,680 KB
testcase_35 AC 184 ms
9,272 KB
testcase_36 AC 206 ms
11,480 KB
testcase_37 AC 240 ms
11,220 KB
testcase_38 AC 1 ms
6,944 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)); }


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 ret = 0;
  for (int x = pos - 1; x >= 0; x = (x & (x + 1)) - 1) {
    ret += bit[x];
  }
  return ret;
}

// min pos s.t. pred(sum of [0, pos))
//   assume pred(sum of [0, pos)) is non-decreasing
int bBinarySearch(alias pred, T)(T[] bit) {
  import core.bitop : bsr;
  import std.functional : unaryFun;
  alias predFun = unaryFun!pred;
  if (predFun(0)) return 0;
  int pos = 0;
  T sum = 0;
  foreach_reverse (e; 0 .. bsr(bit.length) + 1) {
    const x = (pos | 1 << e) - 1;
    if (x < bit.length && !predFun(sum + bit[x])) {
      pos |= 1 << e;
      sum += bit[x];
    }
  }
  return pos + 1;
}


void main() {
  try {
    for (; ; ) {
      const N = readInt;
      auto P = new int[N];
      foreach (i; 0 .. N) {
        P[i] = readInt - 1;
      }
      const Q = readInt;
      auto X = new int[Q];
      auto Y = new int[Q];
      foreach (q; 0 .. Q) {
        X[q] = readInt;
        Y[q] = readInt - 1;
      }
      
      auto invP = new int[N];
      foreach (i; 0 .. N) {
        invP[P[i]] = i;
      }
      auto keep = new int[N];
      {
        auto bit = new int[N];
        foreach (i; 0 .. N) {
          keep[i] = bit.bSum(P[i]);
          bit.bAdd(P[i], 1);
        }
      }
      debug {
        writeln("keep = ", keep);
      }
      
      auto qss = new int[][N];
      foreach (q; 0 .. Q) {
        qss[Y[q]] ~= q;
      }
      
      auto ans = new int[Q];
      ans[] = -1;
      {
        auto bit = new int[N];
        foreach (y; 0 .. N) {
          const i = invP[y];
          const head = bit.bSum(i);
          foreach (q; qss[y]) {
            if (X[q] <= keep[i]) {
              ans[q] = i;
            } else {
              const tar = head + (X[q] - keep[i]);
              ans[q] = bit.bBinarySearch!(sum => (sum >= tar)) - 1;
            }
          }
          bit.bAdd(i, 1);
        }
      }
      foreach (q; 0 .. Q) {
        writeln(ans[q] + 1);
      }
      
      debug {
        auto brt = new int[][](N + 1, N);
        brt[0][] = P[];
        foreach (k; 1 .. N + 1) {
          brt[k][] = brt[k - 1][];
          int x = N;
          foreach (i; 0 .. N) {
            if (x > brt[k][i]) {
              swap(x, brt[k][i]);
            }
          }
        }
        foreach (k; 0 .. N + 1) {
          writeln(brt[k]);
        }
      }
    }
  } catch (EOFException e) {
  }
}
0