結果
問題 | No.1051 PQ Permutation |
ユーザー |
👑 |
提出日時 | 2020-05-08 21:55:39 |
言語 | D (dmd 2.109.1) |
結果 |
AC
|
実行時間 | 137 ms / 2,000 ms |
コード長 | 2,739 bytes |
コンパイル時間 | 748 ms |
コンパイル使用メモリ | 128,760 KB |
実行使用メモリ | 13,372 KB |
最終ジャッジ日時 | 2024-06-22 06:58:04 |
合計ジャッジ時間 | 5,700 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 46 |
ソースコード
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) {}}