結果
問題 | No.927 Second Permutation |
ユーザー | uwi |
提出日時 | 2019-11-22 21:26:27 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 98 ms / 2,000 ms |
コード長 | 3,660 bytes |
コンパイル時間 | 3,476 ms |
コンパイル使用メモリ | 87,000 KB |
実行使用メモリ | 39,348 KB |
最終ジャッジ日時 | 2024-04-19 10:29:37 |
合計ジャッジ時間 | 6,481 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 46 ms
36,416 KB |
testcase_01 | AC | 45 ms
36,744 KB |
testcase_02 | AC | 47 ms
36,672 KB |
testcase_03 | AC | 47 ms
36,848 KB |
testcase_04 | AC | 46 ms
36,992 KB |
testcase_05 | AC | 46 ms
36,700 KB |
testcase_06 | AC | 47 ms
36,552 KB |
testcase_07 | AC | 46 ms
36,800 KB |
testcase_08 | AC | 81 ms
38,024 KB |
testcase_09 | AC | 50 ms
36,928 KB |
testcase_10 | AC | 90 ms
38,720 KB |
testcase_11 | AC | 94 ms
39,144 KB |
testcase_12 | AC | 72 ms
38,076 KB |
testcase_13 | AC | 51 ms
36,716 KB |
testcase_14 | AC | 86 ms
38,332 KB |
testcase_15 | AC | 71 ms
38,140 KB |
testcase_16 | AC | 94 ms
39,252 KB |
testcase_17 | AC | 94 ms
39,348 KB |
testcase_18 | AC | 94 ms
39,164 KB |
testcase_19 | AC | 93 ms
38,984 KB |
testcase_20 | AC | 95 ms
38,900 KB |
testcase_21 | AC | 98 ms
39,164 KB |
testcase_22 | AC | 96 ms
38,856 KB |
testcase_23 | AC | 96 ms
39,220 KB |
testcase_24 | AC | 83 ms
38,404 KB |
testcase_25 | AC | 81 ms
37,832 KB |
testcase_26 | AC | 76 ms
37,860 KB |
testcase_27 | AC | 75 ms
37,788 KB |
testcase_28 | AC | 87 ms
38,336 KB |
testcase_29 | AC | 84 ms
38,296 KB |
ソースコード
package contest191122; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class B { InputStream is; PrintWriter out; String INPUT = ""; void solve() { char[] s = ns().toCharArray(); int n = s.length; int[] f = new int[10]; for(char c : s) { f[c-'0']++; } int num = 0; int who = 0; for(int i = 1;i <= 9;i++) { if(f[i] > 0) { num++; who = i; } } if(num == 0 || num == 1 && (f[0] == 0 || f[who] == 1)) { out.println(-1); }else { char[] ret = new char[n]; int p = 0; for(int i = 9;i >= 0;i--) { while(f[i] > 0) { ret[p++] = (char)('0'+i); f[i]--; } } for(int i = n-1;i >= 0;i--) { if(ret[i] != ret[n-1]) { char t = ret[i]; ret[i] = ret[i+1]; ret[i+1] = t; break; } } out.println(new String(ret)); } } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new B().run(); } private byte[] inbuf = new byte[1024]; public int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }