結果
問題 | No.2338 Range AtCoder Query |
ユーザー | 👑 hos.lyric |
提出日時 | 2023-06-02 23:19:59 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 468 ms / 4,000 ms |
コード長 | 3,005 bytes |
コンパイル時間 | 1,929 ms |
コンパイル使用メモリ | 104,588 KB |
実行使用メモリ | 25,748 KB |
最終ジャッジ日時 | 2023-09-04 20:32:15 |
合計ジャッジ時間 | 17,454 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 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,376 KB |
testcase_04 | AC | 1 ms
4,384 KB |
testcase_05 | AC | 1 ms
4,376 KB |
testcase_06 | AC | 3 ms
4,376 KB |
testcase_07 | AC | 4 ms
4,376 KB |
testcase_08 | AC | 3 ms
4,380 KB |
testcase_09 | AC | 4 ms
4,380 KB |
testcase_10 | AC | 3 ms
4,380 KB |
testcase_11 | AC | 337 ms
21,848 KB |
testcase_12 | AC | 329 ms
22,300 KB |
testcase_13 | AC | 348 ms
23,512 KB |
testcase_14 | AC | 307 ms
22,828 KB |
testcase_15 | AC | 385 ms
23,956 KB |
testcase_16 | AC | 461 ms
24,408 KB |
testcase_17 | AC | 467 ms
24,468 KB |
testcase_18 | AC | 468 ms
24,480 KB |
testcase_19 | AC | 465 ms
24,448 KB |
testcase_20 | AC | 462 ms
24,476 KB |
testcase_21 | AC | 462 ms
24,404 KB |
testcase_22 | AC | 458 ms
24,480 KB |
testcase_23 | AC | 459 ms
24,472 KB |
testcase_24 | AC | 456 ms
24,464 KB |
testcase_25 | AC | 461 ms
24,456 KB |
testcase_26 | AC | 159 ms
21,252 KB |
testcase_27 | AC | 160 ms
21,128 KB |
testcase_28 | AC | 158 ms
21,260 KB |
testcase_29 | AC | 445 ms
24,568 KB |
testcase_30 | AC | 461 ms
24,464 KB |
testcase_31 | AC | 444 ms
24,420 KB |
testcase_32 | AC | 441 ms
24,404 KB |
testcase_33 | AC | 426 ms
25,748 KB |
testcase_34 | AC | 427 ms
25,720 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; } 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; const M = readInt; const Q = readInt; auto P = new int[N]; auto S = new string[N]; foreach (i; 0 .. N) { P[i] = readInt - 1; S[i] = readToken; } auto L = new int[Q]; auto R = new int[Q]; foreach (q; 0 .. Q) { L[q] = readInt - 1; R[q] = readInt; } auto qss = new int[][N]; auto ans0 = new int[Q]; auto ans1 = new int[Q]; foreach (q; 0 .. Q) { qss[L[q]] ~= q; } auto ac = new int[M]; auto wa = new int[M]; ac[] = -1; auto bit0 = new int[N]; auto bit1 = new int[N]; foreach_reverse (i; 0 .. N) { const p = P[i]; final switch (S[i]) { case "AC": { if (~ac[p]) { bit0.bAdd(ac[p], -1); bit1.bAdd(ac[p], -wa[p]); } ac[p] = i; wa[p] = 0; bit0.bAdd(ac[p], +1); } break; case "WA": { if (~ac[p]) { wa[p] += 1; bit1.bAdd(ac[p], +1); } } break; } foreach (q; qss[i]) { ans0[q] = bit0.bSum(R[q]); ans1[q] = bit1.bSum(R[q]); } } foreach (q; 0 .. Q) { writeln(ans0[q], " ", ans1[q]); } } } catch (EOFException e) { } }