結果
問題 | No.2182 KODOKU Stone |
ユーザー | 👑 hos.lyric |
提出日時 | 2023-01-06 22:44:11 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 859 ms / 2,000 ms |
コード長 | 3,083 bytes |
コンパイル時間 | 1,638 ms |
コンパイル使用メモリ | 166,316 KB |
実行使用メモリ | 49,840 KB |
最終ジャッジ日時 | 2023-09-04 19:35:50 |
合計ジャッジ時間 | 11,830 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,384 KB |
testcase_01 | AC | 1 ms
4,384 KB |
testcase_02 | AC | 1 ms
4,388 KB |
testcase_03 | AC | 2 ms
4,380 KB |
testcase_04 | AC | 1 ms
4,380 KB |
testcase_05 | AC | 1 ms
4,380 KB |
testcase_06 | AC | 2 ms
4,380 KB |
testcase_07 | AC | 2 ms
4,380 KB |
testcase_08 | AC | 2 ms
4,380 KB |
testcase_09 | AC | 2 ms
4,384 KB |
testcase_10 | AC | 2 ms
4,384 KB |
testcase_11 | AC | 572 ms
34,268 KB |
testcase_12 | AC | 807 ms
39,916 KB |
testcase_13 | AC | 37 ms
5,968 KB |
testcase_14 | AC | 38 ms
6,920 KB |
testcase_15 | AC | 859 ms
47,100 KB |
testcase_16 | AC | 635 ms
49,840 KB |
testcase_17 | AC | 31 ms
7,152 KB |
testcase_18 | AC | 523 ms
25,648 KB |
testcase_19 | AC | 232 ms
20,432 KB |
testcase_20 | AC | 410 ms
24,600 KB |
testcase_21 | AC | 53 ms
11,740 KB |
testcase_22 | AC | 40 ms
7,080 KB |
testcase_23 | AC | 170 ms
14,196 KB |
testcase_24 | AC | 102 ms
12,504 KB |
testcase_25 | AC | 27 ms
6,608 KB |
testcase_26 | AC | 25 ms
6,620 KB |
testcase_27 | AC | 25 ms
6,608 KB |
testcase_28 | AC | 343 ms
24,684 KB |
testcase_29 | AC | 460 ms
25,492 KB |
testcase_30 | AC | 564 ms
39,308 KB |
testcase_31 | AC | 343 ms
24,660 KB |
testcase_32 | AC | 323 ms
25,336 KB |
testcase_33 | AC | 435 ms
25,372 KB |
testcase_34 | AC | 80 ms
12,272 KB |
testcase_35 | AC | 459 ms
25,260 KB |
testcase_36 | AC | 56 ms
8,512 KB |
testcase_37 | AC | 575 ms
39,324 KB |
testcase_38 | AC | 2 ms
4,384 KB |
testcase_39 | AC | 1 ms
4,384 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 main() { try { for (; ; ) { const N = readInt; auto K = new int[N]; foreach (i; 0 .. N) { K[i] = readInt; } auto T = new int[N]; auto A = new int[][N]; foreach (j; 0 .. N) { T[j] = readInt; A[j] = new int[T[j]]; foreach (t; 0 .. T[j]) { A[j][t] = readInt; } } bool check(int thr) { auto bs0 = new RedBlackTree!(int, "a < b", true); auto bs1 = new RedBlackTree!(int, "a < b", true); foreach (j; 0 .. N) { const b = cast(int)(A[j].count!(a => (a >= thr))); ((b < T[j]) ? bs0 : bs1).insert(b); } debug { writeln(thr, ": ", bs0, " ", bs1); } int bad; int mx = -1; foreach_reverse (i; 0 .. N) { if (mx >= K[i]) { if (bad + 1 <= cast(int)(bs1.length)) { return true; } } auto ran0 = bs0.upperBound(K[i] - 1); auto ran1 = bs1.upperBound(K[i] - 1); if (!ran0.empty) { if (bad <= cast(int)(bs1.length)) { return true; } } else if (!ran1.empty) { if (bad + 1 <= cast(int)(bs1.length)) { return true; } } else { ran0 = bs0.upperBound(K[i] - 1 - 1); if (!ran0.empty) { chmax(mx, ran0.front); bs0.removeKey(ran0.front); } else { ++bad; } } } return false; } int[] as; foreach (j; 0 .. N) { as ~= A[j]; } as = as.sort.uniq.array; int lo = 0, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) / 2; (check(as[mid]) ? lo : hi) = mid; } writeln(as[lo]); } } catch (EOFException e) { } }