結果
問題 | No.1838 Modulo Straight |
ユーザー | 👑 hos.lyric |
提出日時 | 2022-02-12 22:10:07 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 194 ms / 2,000 ms |
コード長 | 2,789 bytes |
コンパイル時間 | 925 ms |
コンパイル使用メモリ | 108,216 KB |
実行使用メモリ | 43,472 KB |
最終ジャッジ日時 | 2023-09-04 15:57:42 |
合計ジャッジ時間 | 10,420 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,380 KB |
testcase_01 | AC | 2 ms
4,380 KB |
testcase_02 | AC | 1 ms
4,376 KB |
testcase_03 | AC | 2 ms
4,376 KB |
testcase_04 | AC | 3 ms
4,376 KB |
testcase_05 | AC | 3 ms
4,380 KB |
testcase_06 | AC | 3 ms
4,384 KB |
testcase_07 | AC | 2 ms
4,380 KB |
testcase_08 | AC | 3 ms
4,380 KB |
testcase_09 | AC | 2 ms
4,376 KB |
testcase_10 | AC | 2 ms
4,380 KB |
testcase_11 | AC | 193 ms
41,732 KB |
testcase_12 | AC | 194 ms
42,132 KB |
testcase_13 | AC | 192 ms
43,472 KB |
testcase_14 | AC | 192 ms
42,592 KB |
testcase_15 | AC | 192 ms
40,780 KB |
testcase_16 | AC | 186 ms
26,672 KB |
testcase_17 | AC | 186 ms
26,136 KB |
testcase_18 | AC | 183 ms
26,372 KB |
testcase_19 | AC | 175 ms
25,400 KB |
testcase_20 | AC | 165 ms
24,288 KB |
testcase_21 | AC | 169 ms
24,092 KB |
testcase_22 | AC | 73 ms
21,348 KB |
testcase_23 | AC | 76 ms
21,192 KB |
testcase_24 | AC | 102 ms
19,732 KB |
testcase_25 | AC | 121 ms
21,180 KB |
testcase_26 | AC | 128 ms
21,616 KB |
testcase_27 | AC | 148 ms
22,472 KB |
testcase_28 | AC | 152 ms
22,308 KB |
testcase_29 | AC | 151 ms
24,580 KB |
testcase_30 | AC | 152 ms
23,260 KB |
testcase_31 | AC | 165 ms
23,496 KB |
testcase_32 | AC | 161 ms
21,728 KB |
testcase_33 | AC | 169 ms
26,408 KB |
testcase_34 | AC | 167 ms
26,428 KB |
testcase_35 | AC | 174 ms
26,228 KB |
testcase_36 | AC | 162 ms
22,236 KB |
testcase_37 | AC | 156 ms
24,132 KB |
testcase_38 | AC | 149 ms
23,704 KB |
testcase_39 | AC | 48 ms
14,324 KB |
testcase_40 | AC | 1 ms
4,376 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; } void main() { try { for (; ; ) { const M = readInt; const K = readInt; auto A = new int[M * K]; foreach (i; 0 .. M * K) { A[i] = readInt; } auto B = new int[M * K]; { auto cnt = new int[M]; foreach (i; 0 .. M * K) { B[i] = cnt[A[i]]++; } } auto posss = new int[][M]; { auto cnt = new int[K]; foreach (i; 0 .. M * K) { posss[A[i]] ~= cnt[B[i]]++; } } debug { writeln("A = ", A); writeln("B = ", B); writeln("posss = ", posss); } auto anss = new long[M]; auto bit = new int[M * K]; foreach (i; 0 .. M * K) { const val = B[i] * M + A[i]; anss[0] += (i - bit.bSum(val)); bit.bAdd(val, 1); } foreach (a; 0 .. M - 1) { long sum = anss[a]; foreach (pos; posss[a]) { sum += (M - 1 - 2 * pos); } anss[a + 1] = sum; } debug { writeln("anss = ", anss); } const ans = anss.minElement; writeln(ans); } } catch (EOFException e) { } }