結果
問題 | No.1867 Partitions and Inversions |
ユーザー | 👑 hos.lyric |
提出日時 | 2022-03-04 22:13:18 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 2,238 ms / 5,000 ms |
コード長 | 3,456 bytes |
コンパイル時間 | 719 ms |
コンパイル使用メモリ | 107,460 KB |
実行使用メモリ | 77,516 KB |
最終ジャッジ日時 | 2023-09-04 16:16:04 |
合計ジャッジ時間 | 86,949 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,380 KB |
testcase_01 | AC | 2 ms
4,380 KB |
testcase_02 | AC | 2,155 ms
75,796 KB |
testcase_03 | AC | 2,146 ms
75,820 KB |
testcase_04 | AC | 2,170 ms
75,900 KB |
testcase_05 | AC | 2,191 ms
77,144 KB |
testcase_06 | AC | 2,214 ms
76,552 KB |
testcase_07 | AC | 2,157 ms
77,516 KB |
testcase_08 | AC | 2,187 ms
75,796 KB |
testcase_09 | AC | 2,186 ms
75,860 KB |
testcase_10 | AC | 2,107 ms
76,228 KB |
testcase_11 | AC | 2,123 ms
76,104 KB |
testcase_12 | AC | 2,193 ms
77,052 KB |
testcase_13 | AC | 2,176 ms
75,976 KB |
testcase_14 | AC | 2,209 ms
76,924 KB |
testcase_15 | AC | 2,238 ms
76,600 KB |
testcase_16 | AC | 2,160 ms
76,908 KB |
testcase_17 | AC | 2,149 ms
76,568 KB |
testcase_18 | AC | 2,192 ms
75,840 KB |
testcase_19 | AC | 2,225 ms
76,188 KB |
testcase_20 | AC | 2,140 ms
77,140 KB |
testcase_21 | AC | 2,114 ms
75,744 KB |
testcase_22 | AC | 2,148 ms
76,616 KB |
testcase_23 | AC | 2,090 ms
75,916 KB |
testcase_24 | AC | 2,144 ms
75,588 KB |
testcase_25 | AC | 2,180 ms
76,212 KB |
testcase_26 | AC | 2,179 ms
75,672 KB |
testcase_27 | AC | 2,156 ms
76,460 KB |
testcase_28 | AC | 2,101 ms
75,852 KB |
testcase_29 | AC | 2,190 ms
76,512 KB |
testcase_30 | AC | 2,165 ms
75,804 KB |
testcase_31 | AC | 2,170 ms
76,212 KB |
testcase_32 | AC | 2 ms
4,380 KB |
testcase_33 | AC | 1 ms
4,376 KB |
testcase_34 | AC | 1 ms
4,376 KB |
testcase_35 | AC | 1 ms
4,380 KB |
testcase_36 | AC | 1 ms
4,376 KB |
testcase_37 | AC | 2 ms
4,376 KB |
testcase_38 | AC | 37 ms
4,896 KB |
testcase_39 | AC | 37 ms
6,412 KB |
testcase_40 | AC | 37 ms
4,956 KB |
testcase_41 | AC | 36 ms
4,900 KB |
testcase_42 | AC | 36 ms
5,008 KB |
testcase_43 | AC | 857 ms
37,312 KB |
testcase_44 | AC | 856 ms
35,448 KB |
testcase_45 | AC | 855 ms
35,640 KB |
testcase_46 | AC | 873 ms
35,636 KB |
testcase_47 | AC | 878 ms
35,708 KB |
testcase_48 | AC | 844 ms
36,844 KB |
testcase_49 | AC | 851 ms
35,496 KB |
testcase_50 | AC | 867 ms
35,632 KB |
testcase_51 | AC | 897 ms
35,772 KB |
testcase_52 | AC | 880 ms
36,080 KB |
testcase_53 | AC | 857 ms
35,884 KB |
testcase_54 | AC | 840 ms
36,468 KB |
testcase_55 | AC | 871 ms
36,952 KB |
testcase_56 | AC | 842 ms
36,020 KB |
testcase_57 | AC | 848 ms
35,884 KB |
testcase_58 | AC | 875 ms
36,328 KB |
testcase_59 | AC | 869 ms
36,892 KB |
testcase_60 | AC | 869 ms
37,068 KB |
testcase_61 | AC | 857 ms
35,500 KB |
testcase_62 | AC | 864 ms
35,768 KB |
testcase_63 | AC | 972 ms
76,812 KB |
testcase_64 | AC | 1 ms
4,376 KB |
testcase_65 | AC | 1 ms
4,380 KB |
testcase_66 | AC | 1 ms
4,376 KB |
testcase_67 | AC | 261 ms
75,988 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; } enum INF = 10^^9; void main() { try { for (; ; ) { const N = readInt; auto P = new int[N]; foreach (i; 0 .. N) { P[i] = readInt - 1; } auto score = new int[][](N + 1, N + 1); { auto bit = new int[N]; foreach (i; 0 .. N) { bit[] = 0; foreach (j; i .. N) { score[i][j + 1] = score[i][j] + ((j - i) - bit.bSum(P[j])); bit.bAdd(P[j], 1); } } } debug { writeln("score = ", score); } auto dp = new int[][](N + 1, N + 1); foreach (k; 0 .. N + 1) { dp[k][] = -INF; } dp[0][0] = 0; int len; auto que = new int[N + 1]; foreach (k; 0 .. N) { len = 0; foreach (i; 0 .. N + 1) { int calc(int j) { return dp[k][j] + score[j][i]; } bool check(int j2, int j1) { int lo = i, hi = N + 1; for (; lo + 1 < hi; ) { const mid = (lo + hi) / 2; ((dp[k][j1] + score[j1][mid] >= dp[k][i] + score[i][mid]) ? hi : lo) = mid; } return (hi > N || dp[k][j2] + score[j2][hi] >= dp[k][j1] + score[j1][hi]); } for (; len >= 2 && calc(que[len - 2]) >= calc(que[len - 1]); --len) {} if (len >= 1) { dp[k + 1][i] = calc(que[len - 1]); } if (len == 0 || calc(que[len - 1]) < calc(i)) { for (; len >= 2 && check(que[len - 2], que[len - 1]); --len) {} que[len++] = i; } } debug { writefln("dp[%s] = %s", k + 1, dp[k + 1]); } } foreach (k; 1 .. N + 1) { writeln(score[0][N] - dp[k][N]); } } } catch (EOFException e) { } }