結果
問題 | No.2029 Swap Min Max Min |
ユーザー | 👑 hos.lyric |
提出日時 | 2022-08-05 22:20:15 |
言語 | D (dmd 2.107.1) |
結果 |
WA
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 3,513 bytes |
コンパイル時間 | 1,381 ms |
コンパイル使用メモリ | 107,820 KB |
実行使用メモリ | 20,568 KB |
最終ジャッジ日時 | 2023-09-04 18:03:12 |
合計ジャッジ時間 | 6,572 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,384 KB |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | AC | 18 ms
6,304 KB |
testcase_06 | AC | 39 ms
10,900 KB |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | AC | 11 ms
5,532 KB |
testcase_11 | WA | - |
testcase_12 | AC | 25 ms
7,636 KB |
testcase_13 | WA | - |
testcase_14 | AC | 60 ms
13,464 KB |
testcase_15 | WA | - |
testcase_16 | AC | 59 ms
13,372 KB |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | AC | 60 ms
13,500 KB |
testcase_20 | AC | 60 ms
13,992 KB |
testcase_21 | AC | 59 ms
14,404 KB |
testcase_22 | AC | 59 ms
13,924 KB |
testcase_23 | AC | 69 ms
19,904 KB |
testcase_24 | AC | 70 ms
19,220 KB |
testcase_25 | AC | 54 ms
15,604 KB |
testcase_26 | AC | 55 ms
16,144 KB |
testcase_27 | AC | 2 ms
4,380 KB |
testcase_28 | AC | 2 ms
4,384 KB |
testcase_29 | AC | 1 ms
4,380 KB |
testcase_30 | AC | 1 ms
4,384 KB |
testcase_31 | AC | 1 ms
4,380 KB |
testcase_32 | WA | - |
testcase_33 | AC | 1 ms
4,384 KB |
testcase_34 | AC | 2 ms
4,380 KB |
testcase_35 | AC | 1 ms
4,384 KB |
testcase_36 | AC | 1 ms
4,380 KB |
testcase_37 | AC | 2 ms
4,380 KB |
testcase_38 | AC | 65 ms
14,840 KB |
testcase_39 | AC | 54 ms
14,092 KB |
testcase_40 | AC | 50 ms
13,864 KB |
testcase_41 | AC | 67 ms
17,716 KB |
testcase_42 | AC | 67 ms
16,912 KB |
testcase_43 | AC | 52 ms
13,772 KB |
testcase_44 | AC | 73 ms
20,468 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; } long solve(const(int[]) A, const(int[]) B) { const N = cast(int)(A.length); auto pos = new int[N]; foreach (i; 0 .. N) { pos[B[i]] = i; } long cost; auto bit = new long[N]; foreach (i; 0 .. N) { const x = pos[A[i]]; cost += (i - bit.bSum(x)); bit.bAdd(x, 1); } return cost; } void main() { /* debug { foreach (n; 1 .. 8 + 1) { int mn = int.max; int[][] pmss; auto ps = iota(n).array; do { int mx; foreach (i; 0 .. n - 1) { chmax(mx, min(ps[i], ps[i + 1])); } if (chmin(mn, mx)) { pmss = []; } if (mn == mx) { pmss ~= ps.dup; } } while (ps.nextPermutation); stderr.writeln(n, ": ", mn, " ", pmss.length); stderr.flush; foreach (pms; pmss) { writeln(pms); } stdout.flush; } return; } */ try { for (; ; ) { const N = readInt; auto A = new int[N]; foreach (i; 0 .. N) { A[i] = readInt - 1; } const thr = (N - 2) / 2; int[] smalls, larges; foreach (a; A) { if (a <= thr) { smalls ~= a; } else { larges ~= a; } } long ans = long.max; if (N % 2 != 0) { int[] bs; foreach (i; 0 .. N / 2) { bs ~= larges[i]; bs ~= smalls[i]; } bs ~= larges[N / 2]; chmin(ans, solve(A, bs)); } else { foreach (s; 0 .. 2) { int[] bs; foreach (i; 0 .. N / 2) { if (s) { bs ~= larges[i]; bs ~= smalls[i]; } else { bs ~= smalls[i]; bs ~= larges[i]; } } chmin(ans, solve(A, bs)); } } writeln(thr + 1, " ", ans); } } catch (EOFException e) { } }