結果
問題 | No.404 部分門松列 |
ユーザー | 👑 hos.lyric |
提出日時 | 2019-05-03 06:07:49 |
言語 | D (dmd 2.107.1) |
結果 |
AC
|
実行時間 | 568 ms / 2,000 ms |
コード長 | 3,532 bytes |
コンパイル時間 | 844 ms |
コンパイル使用メモリ | 119,036 KB |
実行使用メモリ | 28,884 KB |
最終ジャッジ日時 | 2023-09-04 01:02:38 |
合計ジャッジ時間 | 14,083 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 1 ms
4,376 KB |
testcase_02 | AC | 2 ms
4,380 KB |
testcase_03 | AC | 1 ms
4,380 KB |
testcase_04 | AC | 2 ms
4,380 KB |
testcase_05 | AC | 2 ms
4,376 KB |
testcase_06 | AC | 2 ms
4,376 KB |
testcase_07 | AC | 2 ms
4,376 KB |
testcase_08 | AC | 2 ms
4,376 KB |
testcase_09 | AC | 2 ms
4,380 KB |
testcase_10 | AC | 2 ms
4,376 KB |
testcase_11 | AC | 2 ms
4,376 KB |
testcase_12 | AC | 1 ms
4,380 KB |
testcase_13 | AC | 250 ms
10,380 KB |
testcase_14 | AC | 280 ms
19,820 KB |
testcase_15 | AC | 298 ms
18,076 KB |
testcase_16 | AC | 227 ms
14,928 KB |
testcase_17 | AC | 355 ms
13,984 KB |
testcase_18 | AC | 205 ms
14,540 KB |
testcase_19 | AC | 119 ms
7,848 KB |
testcase_20 | AC | 382 ms
24,944 KB |
testcase_21 | AC | 331 ms
24,744 KB |
testcase_22 | AC | 251 ms
13,744 KB |
testcase_23 | AC | 462 ms
28,884 KB |
testcase_24 | AC | 568 ms
24,884 KB |
testcase_25 | AC | 508 ms
20,140 KB |
testcase_26 | AC | 513 ms
28,488 KB |
testcase_27 | AC | 165 ms
6,792 KB |
testcase_28 | AC | 326 ms
16,008 KB |
testcase_29 | AC | 384 ms
17,444 KB |
testcase_30 | AC | 375 ms
19,048 KB |
testcase_31 | AC | 91 ms
12,244 KB |
testcase_32 | AC | 309 ms
14,764 KB |
testcase_33 | AC | 357 ms
19,996 KB |
testcase_34 | AC | 463 ms
19,996 KB |
ソースコード
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; int[] A; int Q; int[] L, H; void main() { try { for (; ; ) { N = readInt(); A = new int[N]; foreach (i; 0 .. N) { A[i] = readInt(); } Q = readInt(); L = new int[Q]; H = new int[Q]; foreach (i; 0 .. Q) { L[i] = readInt(); H[i] = readInt(); } auto kadomatsu = new long[N]; auto as = new Tuple!(int, int)[N]; foreach (i; 0 .. N) { as[i] = tuple(A[i], i); } foreach (h; 0 .. 2) { if (h == 0) { as.sort; } else { as.sort!((a, b) => ([-a[0], a[1]] < [-b[0], b[1]])); } auto bitCnt = new long[N]; auto bitSame = new long[N + 1]; for (int i = 0, j; i < N; i = j) { for (; j < N && as[i][0] == as[j][0]; ++j) {} debug { writeln(as[i .. j]); } foreach (k; i .. j) { const cntL = bitCnt.bSum(as[k][1]); const cntR = i - cntL; const same = bitSame.bSum(as[k][1] + 1); debug { writefln(" %s: %s * %s - %s", as[k][1], cntL, cntR, same); } kadomatsu[as[k][1]] += (cntL * cntR - same); } foreach (k; i .. j) { bitCnt.bAdd(as[k][1], +1); } foreach (k; i .. j - 1) { // add to range (as[k][1], as[k + 1][1]) long prod = 1L * (k - i + 1) * (j - 1 - k); bitSame.bAdd(as[k][1] + 1, +prod); bitSame.bAdd(as[k + 1][1], -prod); } } } as.sort; auto sum = new long[N + 1]; foreach (i; 0 .. N) { sum[i + 1] = sum[i] + kadomatsu[as[i][1]]; } foreach (q; 0 .. Q) { long ans; ans -= sum[as.lowerBound(tuple(L[q], -1))]; ans += sum[as.lowerBound(tuple(H[q], N))]; writeln(ans); } } } catch (EOFException e) { } }