結果
問題 | No.1051 PQ Permutation |
ユーザー | 👑 hos.lyric |
提出日時 | 2020-05-08 21:55:39 |
言語 | D (dmd 2.107.1) |
結果 |
AC
|
実行時間 | 149 ms / 2,000 ms |
コード長 | 2,739 bytes |
コンパイル時間 | 861 ms |
コンパイル使用メモリ | 115,028 KB |
実行使用メモリ | 13,784 KB |
最終ジャッジ日時 | 2023-09-04 07:44:27 |
合計ジャッジ時間 | 7,813 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 2 ms
4,380 KB |
testcase_03 | AC | 1 ms
4,380 KB |
testcase_04 | AC | 1 ms
4,380 KB |
testcase_05 | AC | 1 ms
4,376 KB |
testcase_06 | AC | 2 ms
4,376 KB |
testcase_07 | AC | 1 ms
4,376 KB |
testcase_08 | AC | 2 ms
4,376 KB |
testcase_09 | AC | 1 ms
4,380 KB |
testcase_10 | AC | 1 ms
4,380 KB |
testcase_11 | AC | 1 ms
4,380 KB |
testcase_12 | AC | 2 ms
4,376 KB |
testcase_13 | AC | 1 ms
4,376 KB |
testcase_14 | AC | 2 ms
4,380 KB |
testcase_15 | AC | 149 ms
12,396 KB |
testcase_16 | AC | 146 ms
12,092 KB |
testcase_17 | AC | 120 ms
13,784 KB |
testcase_18 | AC | 119 ms
12,100 KB |
testcase_19 | AC | 120 ms
12,160 KB |
testcase_20 | AC | 138 ms
13,120 KB |
testcase_21 | AC | 138 ms
12,688 KB |
testcase_22 | AC | 119 ms
12,092 KB |
testcase_23 | AC | 137 ms
12,272 KB |
testcase_24 | AC | 135 ms
12,616 KB |
testcase_25 | AC | 12 ms
4,380 KB |
testcase_26 | AC | 7 ms
4,380 KB |
testcase_27 | AC | 3 ms
4,380 KB |
testcase_28 | AC | 18 ms
4,380 KB |
testcase_29 | AC | 7 ms
4,380 KB |
testcase_30 | AC | 13 ms
4,376 KB |
testcase_31 | AC | 4 ms
4,376 KB |
testcase_32 | AC | 12 ms
4,380 KB |
testcase_33 | AC | 4 ms
4,376 KB |
testcase_34 | AC | 3 ms
4,376 KB |
testcase_35 | AC | 59 ms
6,080 KB |
testcase_36 | AC | 60 ms
6,428 KB |
testcase_37 | AC | 30 ms
11,972 KB |
testcase_38 | AC | 123 ms
12,916 KB |
testcase_39 | AC | 32 ms
13,484 KB |
testcase_40 | AC | 116 ms
12,760 KB |
testcase_41 | AC | 116 ms
13,404 KB |
testcase_42 | AC | 2 ms
4,376 KB |
testcase_43 | AC | 1 ms
4,380 KB |
testcase_44 | AC | 1 ms
4,380 KB |
testcase_45 | AC | 2 ms
4,380 KB |
testcase_46 | AC | 1 ms
4,384 KB |
testcase_47 | AC | 1 ms
4,380 KB |
testcase_48 | AC | 31 ms
12,212 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(); const P = readInt(); const Q = readInt(); auto A = new int[N]; foreach (i; 0 .. N) { A[i] = readInt(); } int[] as = A.dup; int posP = -1, posQ = -1; if (!as.nextPermutation) { as = null; goto done; } foreach (i; 0 .. N) { if (as[i] == P) posP = i; if (as[i] == Q) posQ = i; } if (posP < posQ) { goto done; } as[posQ + 1 .. N].sort.reverse; if (!as.nextPermutation) { as = null; goto done; } foreach (i; 0 .. N) { if (as[i] == P) posP = i; if (as[i] == Q) posQ = i; } if (posP < posQ) { goto done; } as[posQ + 1 .. N].sort.reverse; if (!as.nextPermutation) { as = null; goto done; } foreach (i; 0 .. N) { if (as[i] == P) posP = i; if (as[i] == Q) posQ = i; } if (posP < posQ) { goto done; } debug { writeln("! ", as, " ", posP, " ", posQ); } if (Q > P) { as = null; goto done; } as = as[0 .. posQ] ~ as[posQ + 1 .. posP + 1] ~ as[posQ] ~ as[posP + 1 .. N]; done:{} if (as.empty) { writeln(-1); } else { foreach (i; 0 .. N) { if (i > 0) write(" "); write(as[i]); } writeln(); } } } catch (EOFException e) { } }