結果
問題 | No.927 Second Permutation |
ユーザー |
![]() |
提出日時 | 2019-11-23 00:04:56 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 258 ms / 2,000 ms |
コード長 | 7,257 bytes |
コンパイル時間 | 2,491 ms |
コンパイル使用メモリ | 81,912 KB |
実行使用メモリ | 51,608 KB |
最終ジャッジ日時 | 2024-10-11 06:34:03 |
合計ジャッジ時間 | 8,111 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 27 |
ソースコード
import java.io.*;import java.util.*;@SuppressWarnings("unused")public class Main {FastScanner in;PrintWriter out;int MOD = (int)1e9+7;long ceil(long a, long b){return (a + b - 1) / b;}long gcd(long a, long b){return b == 0 ? a : gcd(b, a % b);}long lcm(long a, long b){return a / gcd(a, b) * b;}void solve(){String X = in.nextStr();Character[] x = new Character[X.length()];for(int i = 0; i < X.length(); i++) x[i] = X.charAt(i);Arrays.sort(x, (e1, e2)->Character.compare(e2, e1));boolean isOk = false;for(int i = x.length-2; i >= 0; i--){if(x[i] > x[i+1]){isOk = true;int ok = i+1, ng = x.length;while(ng - ok > 1){int mid = (ok + ng) / 2;if(x[mid] < x[i]) ok = mid;else ng = mid;}for(int j = ok; j > i; j--){if(x[j] == x[ok]) ok = j;else break;}char tmp = x[i];x[i] = x[ok];x[ok] = tmp;break;}}if(!isOk || x[0] == '0'){out.println("-1");}else{for(char c : x) out.print(c);out.println();}}public static void main(String[] args) {new Main().m();}private void m() {in = new FastScanner(System.in);out = new PrintWriter(System.out);/*try {String path = "output.txt";out = new PrintWriter(new BufferedWriter(new FileWriter(new File(path))));}catch (IOException e){e.printStackTrace();}*/solve();out.flush();in.close();out.close();}static class FastScanner {private Reader input;public FastScanner() {this(System.in);}public FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}public void close() {try {this.input.close();} catch (IOException e) {e.printStackTrace();}}public int nextInt() {return (int) nextLong();}public long nextLong() {try {int sign = 1;int b = input.read();while ((b < '0' || '9' < b) && b != '-' && b != '+') {b = input.read();}if (b == '-') {sign = -1;b = input.read();} else if (b == '+') {b = input.read();}long ret = b - '0';while (true) {b = input.read();if (b < '0' || '9' < b) return ret * sign;ret *= 10;ret += b - '0';}} catch (IOException e) {e.printStackTrace();return -1;}}public double nextDouble() {try {double sign = 1;int b = input.read();while ((b < '0' || '9' < b) && b != '-' && b != '+') {b = input.read();}if (b == '-') {sign = -1;b = input.read();} else if (b == '+') {b = input.read();}double ret = b - '0';while (true) {b = input.read();if (b < '0' || '9' < b) break;ret *= 10;ret += b - '0';}if (b != '.') return sign * ret;double div = 1;b = input.read();while ('0' <= b && b <= '9') {ret *= 10;ret += b - '0';div *= 10;b = input.read();}return sign * ret / div;} catch (IOException e) {e.printStackTrace();return Double.NaN;}}public char nextChar() {try {int b = input.read();while (Character.isWhitespace(b)) {b = input.read();}return (char) b;} catch (IOException e) {e.printStackTrace();return 0;}}public String nextStr() {try {StringBuilder sb = new StringBuilder();int b = input.read();while (Character.isWhitespace(b)) {b = input.read();}while (b != -1 && !Character.isWhitespace(b)) {sb.append((char) b);b = input.read();}return sb.toString();} catch (IOException e) {e.printStackTrace();return "";}}public String nextLine() {try {StringBuilder sb = new StringBuilder();int b = input.read();while (b != -1 && b != '\n') {sb.append((char) b);b = input.read();}return sb.toString();} catch (IOException e) {e.printStackTrace();return "";}}public int[] nextIntArray(int n) {int[] res = new int[n];for (int i = 0; i < n; i++) {res[i] = nextInt();}return res;}public int[] nextIntArrayDec(int n) {int[] res = new int[n];for (int i = 0; i < n; i++) {res[i] = nextInt() - 1;}return res;}public int[] nextIntArray1Index(int n) {int[] res = new int[n + 1];for (int i = 0; i < n; i++) {res[i + 1] = nextInt();}return res;}public long[] nextLongArray(int n) {long[] res = new long[n];for (int i = 0; i < n; i++) {res[i] = nextLong();}return res;}public long[] nextLongArrayDec(int n) {long[] res = new long[n];for (int i = 0; i < n; i++) {res[i] = nextLong() - 1;}return res;}public long[] nextLongArray1Index(int n) {long[] res = new long[n + 1];for (int i = 0; i < n; i++) {res[i + 1] = nextLong();}return res;}public double[] nextDoubleArray(int n) {double[] res = new double[n];for (int i = 0; i < n; i++) {res[i] = nextDouble();}return res;}}}