結果

問題 No.956 Number of Unbalanced
ユーザー 👑 hos.lyric
提出日時 2019-12-19 00:19:20
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 1,194 ms / 2,000 ms
コード長 2,951 bytes
コンパイル時間 905 ms
コンパイル使用メモリ 125,672 KB
実行使用メモリ 13,180 KB
最終ジャッジ日時 2024-06-22 03:46:46
合計ジャッジ時間 6,968 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 6
other AC * 24
権限があれば一括ダウンロードができます

ソースコード

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;
}
void main() {
  try {
    for (; ; ) {
      const N = readInt();
      auto A = new int[N];
      foreach (i; 0 .. N) {
        A[i] = readInt();
      }
      
      const AMax = A.maxElement;
      auto xss = new int[][AMax + 1];
      foreach (i; 0 .. N) {
        xss[A[i]] ~= i;
      }
      
      long ans;
      auto bit = new int[2 * N + 1];
      foreach (a; 1 .. AMax + 1) {
        const len = cast(int)(xss[a].length);
        debug {
          writeln("a = ", a);
        }
        alias Interval = Tuple!(int, "l", int, "r");
        Interval[] ps;
        foreach (x; xss[a]) {
          const l = max(x + 1 - (2 * len - 1), 0);
          const r = min(x + (2 * len - 1), N);
          if (ps && ps[$ - 1].r >= l) {
            ps[$ - 1].r = r;
          } else {
            ps ~= Interval(l, r);
          }
        }
        debug {
          writeln("  ps = ", ps);
        }
        foreach (ref p; ps) {
          int now = N;
          foreach (i; p.l .. p.r) {
            bit.bAdd(now, +1);
            now += ((A[i] == a) ? +1 : -1);
            ans += bit.bSum(now);
          }
          now = N;
          foreach (i; p.l .. p.r) {
            bit.bAdd(now, -1);
            now += ((A[i] == a) ? +1 : -1);
          }
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0