結果
問題 | No.1633 Sorting Integers (Multiple of 2^K) |
ユーザー | 👑 hos.lyric |
提出日時 | 2021-07-30 21:53:42 |
言語 | D (dmd 2.107.1) |
結果 |
AC
|
実行時間 | 1,582 ms / 2,000 ms |
コード長 | 3,323 bytes |
コンパイル時間 | 922 ms |
コンパイル使用メモリ | 114,308 KB |
実行使用メモリ | 95,876 KB |
最終ジャッジ日時 | 2023-09-04 13:34:17 |
合計ジャッジ時間 | 19,380 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,376 KB |
testcase_02 | AC | 6 ms
4,380 KB |
testcase_03 | AC | 1 ms
4,380 KB |
testcase_04 | AC | 2 ms
4,380 KB |
testcase_05 | AC | 1 ms
4,376 KB |
testcase_06 | AC | 1 ms
4,380 KB |
testcase_07 | AC | 2 ms
4,380 KB |
testcase_08 | AC | 1 ms
4,376 KB |
testcase_09 | AC | 2 ms
4,376 KB |
testcase_10 | AC | 1 ms
4,376 KB |
testcase_11 | AC | 1 ms
4,380 KB |
testcase_12 | AC | 2 ms
4,376 KB |
testcase_13 | AC | 2 ms
4,376 KB |
testcase_14 | AC | 1 ms
4,376 KB |
testcase_15 | AC | 1 ms
4,380 KB |
testcase_16 | AC | 2 ms
4,384 KB |
testcase_17 | AC | 2 ms
4,376 KB |
testcase_18 | AC | 1 ms
4,380 KB |
testcase_19 | AC | 1 ms
4,376 KB |
testcase_20 | AC | 2 ms
4,380 KB |
testcase_21 | AC | 2 ms
4,376 KB |
testcase_22 | AC | 1 ms
4,376 KB |
testcase_23 | AC | 1,372 ms
69,220 KB |
testcase_24 | AC | 1,380 ms
95,812 KB |
testcase_25 | AC | 1,537 ms
95,824 KB |
testcase_26 | AC | 1,227 ms
73,212 KB |
testcase_27 | AC | 1,030 ms
73,276 KB |
testcase_28 | AC | 1,291 ms
73,272 KB |
testcase_29 | AC | 1,094 ms
95,876 KB |
testcase_30 | AC | 1,214 ms
73,692 KB |
testcase_31 | AC | 1,090 ms
73,220 KB |
testcase_32 | AC | 1,582 ms
95,704 KB |
testcase_33 | AC | 198 ms
14,220 KB |
testcase_34 | AC | 15 ms
4,384 KB |
testcase_35 | AC | 99 ms
11,424 KB |
testcase_36 | AC | 51 ms
5,684 KB |
testcase_37 | AC | 304 ms
21,676 KB |
testcase_38 | AC | 547 ms
48,352 KB |
testcase_39 | AC | 89 ms
11,924 KB |
testcase_40 | AC | 16 ms
4,380 KB |
testcase_41 | AC | 438 ms
24,688 KB |
testcase_42 | AC | 26 ms
4,380 KB |
testcase_43 | AC | 169 ms
10,772 KB |
testcase_44 | AC | 819 ms
37,812 KB |
testcase_45 | AC | 310 ms
19,800 KB |
testcase_46 | AC | 35 ms
6,452 KB |
testcase_47 | AC | 141 ms
12,344 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)); } enum B = 10; void main() { try { for (; ; ) { const N = readInt(); auto C = new int[B]; foreach (x; 1 .. B) { C[x] = readInt(); } int[] xs; foreach (x; 1 .. B) { foreach (_; 0 .. C[x]) { xs ~= x; } } assert(xs.length == N); const half = N / 2; long ten = 1; foreach (_; 0 .. half) { ten *= 10; } auto yss = new long[][][](2, 1 << N); void dfs(int s, int pos, int used, long y) { if (pos == (s ? (N - half) : half)) { yss[s][used] ~= y; } else { foreach (u; 0 .. N) { if (!(used & 1 << u)) { if (s == 0 && u - 1 >= 0 && xs[u - 1] == xs[u] && !(used & 1 << (u - 1))) continue; if (s == 1 && u + 1 < N && xs[u] == xs[u + 1] && !(used & 1 << (u + 1))) continue; dfs(s, pos + 1, used | 1 << u, y * 10 + xs[u]); } } } } dfs(0, 0, 0, 0); dfs(1, 0, 0, 0); foreach (p; 0 .. 1 << N) { yss[0][p] = yss[0][p].sort.uniq.array; } foreach (q; 0 .. 1 << N) { yss[1][q] = yss[1][q].sort.uniq.array; foreach (ref y; yss[1][q]) { y *= -ten; } } bool check(int e) { const mask = (1L << e) - 1; foreach (p; 0 .. 1 << N) { const q = ((1 << N) - 1) ^ p; auto ys0 = yss[0][p].dup; auto ys1 = yss[1][q].dup; foreach (ref y; ys0) y &= mask; foreach (ref y; ys1) y &= mask; ys0 = ys0.sort.uniq.array; ys1 = ys1.sort.uniq.array; const len = cast(int)(ys0.length); int pos; foreach (y; ys1) { for (; pos < len && ys0[pos] < y; ++pos) {} if (pos < len && ys0[pos] == y) { return true; } } } return false; } int lo = 0, hi = 47; for (; lo + 1 < hi; ) { const mid = (lo + hi) / 2; (check(mid) ? lo : hi) = mid; } writeln(lo); } } catch (EOFException e) { } }