結果
問題 | No.404 部分門松列 |
ユーザー |
👑 |
提出日時 | 2019-05-03 06:07:49 |
言語 | D (dmd 2.109.1) |
結果 |
AC
|
実行時間 | 571 ms / 2,000 ms |
コード長 | 3,532 bytes |
コンパイル時間 | 1,244 ms |
コンパイル使用メモリ | 134,880 KB |
実行使用メモリ | 29,736 KB |
最終ジャッジ日時 | 2024-06-22 01:10:34 |
合計ジャッジ時間 | 14,020 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 31 |
ソースコード
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) {}}