結果
問題 | No.1051 PQ Permutation |
ユーザー | 37zigen |
提出日時 | 2020-05-09 12:58:47 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,683 bytes |
コンパイル時間 | 5,271 ms |
コンパイル使用メモリ | 77,144 KB |
実行使用メモリ | 64,424 KB |
最終ジャッジ日時 | 2023-09-19 08:21:16 |
合計ジャッジ時間 | 29,699 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 89 ms
53,136 KB |
testcase_01 | AC | 89 ms
52,348 KB |
testcase_02 | AC | 47 ms
49,648 KB |
testcase_03 | AC | 86 ms
52,456 KB |
testcase_04 | AC | 87 ms
52,808 KB |
testcase_05 | AC | 88 ms
50,548 KB |
testcase_06 | AC | 85 ms
52,800 KB |
testcase_07 | AC | 45 ms
49,424 KB |
testcase_08 | AC | 85 ms
52,352 KB |
testcase_09 | AC | 46 ms
49,196 KB |
testcase_10 | AC | 92 ms
52,456 KB |
testcase_11 | AC | 87 ms
52,320 KB |
testcase_12 | AC | 86 ms
52,464 KB |
testcase_13 | AC | 85 ms
52,208 KB |
testcase_14 | AC | 86 ms
53,028 KB |
testcase_15 | AC | 1,066 ms
62,900 KB |
testcase_16 | AC | 1,077 ms
62,920 KB |
testcase_17 | AC | 957 ms
64,424 KB |
testcase_18 | AC | 964 ms
62,548 KB |
testcase_19 | AC | 968 ms
58,380 KB |
testcase_20 | AC | 1,247 ms
64,384 KB |
testcase_21 | AC | 1,163 ms
61,608 KB |
testcase_22 | AC | 1,017 ms
63,844 KB |
testcase_23 | AC | 1,079 ms
61,532 KB |
testcase_24 | AC | 1,138 ms
60,376 KB |
testcase_25 | AC | 331 ms
61,704 KB |
testcase_26 | AC | 280 ms
57,152 KB |
testcase_27 | AC | 156 ms
53,140 KB |
testcase_28 | AC | 399 ms
62,916 KB |
testcase_29 | AC | 268 ms
55,216 KB |
testcase_30 | AC | 333 ms
59,900 KB |
testcase_31 | AC | 181 ms
54,288 KB |
testcase_32 | AC | 342 ms
60,404 KB |
testcase_33 | AC | 180 ms
53,968 KB |
testcase_34 | AC | 181 ms
53,168 KB |
testcase_35 | AC | 753 ms
60,728 KB |
testcase_36 | AC | 837 ms
63,176 KB |
testcase_37 | AC | 103 ms
51,652 KB |
testcase_38 | AC | 1,037 ms
63,752 KB |
testcase_39 | AC | 125 ms
52,768 KB |
testcase_40 | AC | 946 ms
59,388 KB |
testcase_41 | AC | 934 ms
60,676 KB |
testcase_42 | WA | - |
testcase_43 | AC | 90 ms
52,400 KB |
testcase_44 | AC | 90 ms
53,156 KB |
testcase_45 | AC | 88 ms
52,840 KB |
testcase_46 | AC | 89 ms
53,076 KB |
testcase_47 | WA | - |
testcase_48 | WA | - |
ソースコード
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().run(); } 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=0;i<A.length;++i) if (A[i]==key) return i; throw new AssertionError(); } void run() { 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); int iq=find(A, Q); 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); int ip=find(A, P); 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(); } }