結果
問題 | No.1051 PQ Permutation |
ユーザー | 37zigen |
提出日時 | 2020-05-09 15:56:28 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,154 bytes |
コンパイル時間 | 3,555 ms |
コンパイル使用メモリ | 82,388 KB |
実行使用メモリ | 65,012 KB |
最終ジャッジ日時 | 2023-09-19 08:34:55 |
合計ジャッジ時間 | 26,947 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 85 ms
52,288 KB |
testcase_01 | AC | 87 ms
52,744 KB |
testcase_02 | AC | 46 ms
49,292 KB |
testcase_03 | AC | 85 ms
52,348 KB |
testcase_04 | AC | 86 ms
53,008 KB |
testcase_05 | AC | 88 ms
53,060 KB |
testcase_06 | AC | 96 ms
52,332 KB |
testcase_07 | AC | 45 ms
48,984 KB |
testcase_08 | AC | 84 ms
52,692 KB |
testcase_09 | AC | 46 ms
49,156 KB |
testcase_10 | AC | 86 ms
53,004 KB |
testcase_11 | AC | 86 ms
52,908 KB |
testcase_12 | AC | 88 ms
53,432 KB |
testcase_13 | WA | - |
testcase_14 | AC | 85 ms
52,848 KB |
testcase_15 | AC | 1,355 ms
65,012 KB |
testcase_16 | AC | 1,254 ms
64,424 KB |
testcase_17 | AC | 943 ms
63,020 KB |
testcase_18 | AC | 974 ms
60,924 KB |
testcase_19 | AC | 983 ms
62,684 KB |
testcase_20 | AC | 1,282 ms
64,332 KB |
testcase_21 | AC | 1,058 ms
63,680 KB |
testcase_22 | AC | 956 ms
62,732 KB |
testcase_23 | AC | 1,257 ms
64,440 KB |
testcase_24 | AC | 1,045 ms
63,268 KB |
testcase_25 | AC | 335 ms
62,568 KB |
testcase_26 | AC | 284 ms
55,056 KB |
testcase_27 | AC | 160 ms
52,964 KB |
testcase_28 | AC | 391 ms
57,704 KB |
testcase_29 | AC | 276 ms
55,344 KB |
testcase_30 | AC | 340 ms
58,284 KB |
testcase_31 | AC | 186 ms
54,060 KB |
testcase_32 | AC | 331 ms
57,112 KB |
testcase_33 | AC | 176 ms
52,248 KB |
testcase_34 | AC | 164 ms
52,792 KB |
testcase_35 | WA | - |
testcase_36 | AC | 813 ms
60,588 KB |
testcase_37 | AC | 100 ms
52,416 KB |
testcase_38 | AC | 990 ms
58,816 KB |
testcase_39 | AC | 132 ms
52,912 KB |
testcase_40 | AC | 951 ms
60,840 KB |
testcase_41 | AC | 976 ms
62,708 KB |
testcase_42 | WA | - |
testcase_43 | WA | - |
testcase_44 | AC | 86 ms
52,132 KB |
testcase_45 | AC | 95 ms
53,324 KB |
testcase_46 | AC | 86 ms
52,340 KB |
testcase_47 | AC | 47 ms
49,700 KB |
testcase_48 | AC | 131 ms
51,932 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.util.Arrays; import java.util.Comparator; import java.util.NoSuchElementException; public class Main{ public static void main(String[] args) { new Main().solve(); } void gen() { int N=200000; int P=1; int Q=N; int[] a=new int[N]; for (int i=0;i<N-2;++i) { a[i]=N-1-i; } a[N-2]=N; a[N-1]=1; System.out.println(N+" "+P+" "+Q); for (int i=0;i<N;++i) { System.out.print(a[i]+(i==N-1?"\n":" ")); } } boolean check(int[] A,int P,int Q) { return find(A, P) < find(A, Q); } void yes(int[] A) { for (int i=0;i<A.length;++i) { System.out.print(A[i]+(i==A.length-1?"\n":" ")); } System.exit(0); } void no() { System.out.println(-1); System.exit(0); } int find(int[] A,int key) { for (int i=A.length-1;i>=0;--i) if (A[i]==key) return i; throw new AssertionError(); } void solve() { FastScanner sc=new FastScanner(); int N=sc.nextInt(); int P=sc.nextInt(); int Q=sc.nextInt(); int[] A=new int[N]; for (int i=0;i<N;++i) A[i]=sc.nextInt(); if (!nextPermutation(A)) no(); if (check(A, P, Q)) yes(A); while (true) { int max=0; int iq=find(A, Q); for (int i=N-1;i>=iq;--i) max=Math.max(max, A[i]); if (max==Q) { while (iq>=0 && A[iq]<=Q) --iq; } Arrays.sort(A, iq+1, N); { int s=iq+1; int t=N-1; while (s<t) { A[s]^=A[t];A[t]^=A[s];A[s]^=A[t]; ++s;--t; } } if (!nextPermutation(A)) no(); if (check(A, P, Q)) yes(A); if (!(iq>0&&A[iq-1]==Q)) break; } int ip=find(A, P); int iq=find(A, Q); for (int i=iq;i<ip;++i) { A[i]^=A[i+1];A[i+1]^=A[i];A[i]^=A[i+1]; } //1,2,...,q,...,p //1,2,...,q+1,...,p,q if (check(A, P, Q)) yes(A); throw new AssertionError(); } boolean nextPermutation(int[] a) { int n=a.length; int p=n-1; while (p>0 && a[p-1]>a[p]) --p; if (p==0) return false; int q=p; while (q+1<n && a[p-1]<a[q+1]) ++q; { a[p-1]^=a[q];a[q]^=a[p-1];a[p-1]^=a[q]; } int s=p,t=n-1; while (s<t) { a[s]^=a[t];a[t]^=a[s];a[s]^=a[t]; ++s;--t; } return true; } void tr(Object...objects) {System.out.println(Arrays.deepToString(objects));} } class FastScanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; }else{ ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;} private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;} private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;} public boolean hasNext() { skipUnprintable(); return hasNextByte();} public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while(isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { return (int)nextLong(); } }