結果

問題 No.3269 Leq-K Partition
ユーザー 👑 hos.lyric
提出日時 2025-09-13 06:59:11
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 428 ms / 6,000 ms
コード長 3,275 bytes
コンパイル時間 854 ms
コンパイル使用メモリ 106,092 KB
実行使用メモリ 26,472 KB
最終ジャッジ日時 2025-09-13 06:59:20
合計ジャッジ時間 7,584 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 27
権限があれば一括ダウンロードができます

ソースコード

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


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;
}

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


// 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 A = new int[N];
      foreach (i; 0 .. N) A[i] = readInt - 1;
      
      auto nxt = new int[N];
      auto poss = new int[N];
      poss[] = N;
      foreach_reverse (i; 0 .. N) {
        nxt[i] = poss[A[i]];
        poss[A[i]] = i;
      }
      auto bit = new int[N + 1];
      foreach (a; 0 .. N) bit.bAdd(poss[a], +1);
      
      auto ans = new int[N + 1];
      auto kss = new int[][N];
      foreach (k; 1 .. N + 1) kss[0] ~= k;
      foreach (i; 0 .. N) {
        foreach (k; kss[i]) {
          const j = bit.bBinarySearch!(sum => (sum >= k + 1)) - 1;
          debug writefln("k = %s: %s -> %s", k, i, j);
          assert(i < j);
          ++ans[k];
          if (j < N) kss[j] ~= k;
        }
        bit.bAdd(i, -1);
        bit.bAdd(nxt[i], +1);
      }
      
      foreach (k; 1 .. N + 1) {
        writeln(ans[k]);
      }
    }
  } catch (EOFException e) {
  }
}
0