#400353 (D) No.927 Second Permutation

• 問題: No.927 Second Permutation
• ユーザー: iicafiaxus
• 提出日時: 2019-11-22 22:48:07
• 言語: D (dmd 2.106.1)
• 結果: AC
• 実行時間: 10 ms / 2,000 ms
• コード長: 1,344 bytes
• コンパイル時間: 1,146 ms
• コンパイル使用メモリ: 146,000 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-06-22 03:05:54
• 合計ジャッジ時間: 1,952 ms
• ジャッジサーバーID （参考情報）: judge5 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,812 KB
testcase_01	AC	1 ms; 6,944 KB
testcase_02	AC	1 ms; 6,944 KB
testcase_03	AC	1 ms; 6,944 KB
testcase_04	AC	1 ms; 6,944 KB
testcase_05	AC	1 ms; 6,940 KB
testcase_06	AC	1 ms; 6,940 KB
testcase_07	AC	1 ms; 6,940 KB
testcase_08	AC	4 ms; 6,940 KB
testcase_09	AC	2 ms; 6,940 KB
testcase_10	AC	6 ms; 6,940 KB
testcase_11	AC	9 ms; 6,940 KB
testcase_12	AC	5 ms; 6,940 KB
testcase_13	AC	2 ms; 6,944 KB
testcase_14	AC	6 ms; 6,940 KB
testcase_15	AC	5 ms; 6,940 KB
testcase_16	AC	9 ms; 6,944 KB
testcase_17	AC	10 ms; 6,940 KB
testcase_18	AC	10 ms; 6,940 KB
testcase_19	AC	10 ms; 6,940 KB
testcase_20	AC	9 ms; 6,940 KB
testcase_21	AC	9 ms; 6,944 KB
testcase_22	AC	10 ms; 6,940 KB
testcase_23	AC	9 ms; 6,944 KB
testcase_24	AC	7 ms; 6,940 KB
testcase_25	AC	5 ms; 6,944 KB
testcase_26	AC	4 ms; 6,944 KB
testcase_27	AC	3 ms; 6,940 KB
testcase_28	AC	7 ms; 6,940 KB
testcase_29	AC	5 ms; 6,940 KB

ソースコード

import std.stdio, std.conv, std.string, std.array, std.range, std.algorithm, std.container;
import std.math, std.random, std.bigint, std.datetime, std.format;
void main(string[] args){ if(args.length > 1) if(args[1] == "-debug") DEBUG = 1; solve(); }
void log()(){ writeln(""); } void log(T, A ...)(T t, lazy A a){ if(DEBUG) write(t, " "), log(a); } bool DEBUG = 0; 
string rstring(){ static string[] ss; while(!ss.length) ss = readln.chomp.split; string res = ss[0]; ss.popFront; return res; }
T rtype(T)(){ return rstring.to!T; } alias rint = rtype!int, rlong = rtype!long, rreal = rtype!real;
T[] rtypes(T)(int n){ return n.iota.map!(i => rtype!T()).array; } alias rint = rtypes!int, rlong = rtypes!long, rreal = rtypes!real;
T[][] rtypess(T)(int n, int m){ return n.iota.map!(i => rtypes!T(m)).array; } alias rint = rtypess!int, rlong = rtypess!long, rreal = rtypess!real;

// ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- ----- //

void solve(){
	char[] x = rstring.to!(char[]);
	
	int[] ans = x.map!(to!int).array;
	ans.sort!"a>b"();
	log(ans.map!(to!char).array, ": best");
	
	if(ans[0] == '0' || ans[1] == '0' || ans[0] == ans[$ - 1]){ "-1".writeln; return; }
	
	auto i = ans.length - 1; while(ans[i] == ans[$ - 1]) i --;
	int z = ans[i + 1]; ans[i + 1] = ans[i]; ans[i] = z;
	
	ans.map!(to!char).array.writeln;
	
}