結果
問題 | No.956 Number of Unbalanced |
ユーザー | 👑 hos.lyric |
提出日時 | 2019-12-19 00:19:20 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 1,390 ms / 2,000 ms |
コード長 | 2,951 bytes |
コンパイル時間 | 863 ms |
コンパイル使用メモリ | 111,436 KB |
実行使用メモリ | 13,552 KB |
最終ジャッジ日時 | 2023-09-04 04:13:19 |
合計ジャッジ時間 | 8,954 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 1 ms
4,380 KB |
testcase_03 | AC | 1 ms
4,384 KB |
testcase_04 | AC | 1 ms
4,376 KB |
testcase_05 | AC | 2 ms
4,376 KB |
testcase_06 | AC | 67 ms
9,496 KB |
testcase_07 | AC | 126 ms
8,552 KB |
testcase_08 | AC | 64 ms
8,652 KB |
testcase_09 | AC | 50 ms
7,264 KB |
testcase_10 | AC | 373 ms
8,640 KB |
testcase_11 | AC | 232 ms
9,632 KB |
testcase_12 | AC | 67 ms
12,756 KB |
testcase_13 | AC | 18 ms
6,300 KB |
testcase_14 | AC | 86 ms
13,200 KB |
testcase_15 | AC | 25 ms
6,776 KB |
testcase_16 | AC | 50 ms
8,624 KB |
testcase_17 | AC | 22 ms
6,844 KB |
testcase_18 | AC | 85 ms
13,552 KB |
testcase_19 | AC | 23 ms
6,224 KB |
testcase_20 | AC | 85 ms
13,124 KB |
testcase_21 | AC | 21 ms
9,088 KB |
testcase_22 | AC | 21 ms
6,696 KB |
testcase_23 | AC | 50 ms
8,520 KB |
testcase_24 | AC | 24 ms
6,204 KB |
testcase_25 | AC | 1,362 ms
7,884 KB |
testcase_26 | AC | 45 ms
7,260 KB |
testcase_27 | AC | 1,390 ms
7,240 KB |
testcase_28 | AC | 1,313 ms
6,972 KB |
testcase_29 | AC | 82 ms
12,340 KB |
ソースコード
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) { } }