#399657 (D) No.927 Second Permutation

• 問題: No.927 Second Permutation
• ユーザー: daut-dlang
• 提出日時: 2019-11-22 21:39:20
• 言語: D (dmd 2.106.1)
• 結果: AC
• 実行時間: 24 ms / 2,000 ms
• コード長: 2,283 bytes
• コンパイル時間: 735 ms
• コンパイル使用メモリ: 111,952 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-06-22 03:02:56
• 合計ジャッジ時間: 1,733 ms
• ジャッジサーバーID （参考情報）: judge3 / judge4

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

コンパイルメッセージ

/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/numeric.d(2999): Warning: cannot inline function `std.numeric.gcdImpl!ulong.gcdImpl`

ソースコード

import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; }
T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; }
T[] RDA(T = long)(T fix = 0) { if (_f.isOpen)  return _RDA!T(_f, fix); else return _RDA!T(fix); }

size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
long lcm(long x, long y) { return x * (y / gcd(x, y)); }

long mod = 10^^9 + 7;
//long mod = 998244353;
//long mod = 1_000_003;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }

void main()
{
	auto X = RD!string;
	auto cnt = new long[](10);
	foreach (c; X)
	{
		auto num = [c].to!int;
		++cnt[num];
	}

	int pos1 = -1, pos2 = -1;
	foreach (i; 0..10)
	{
		if (cnt[i] != 0)
		{
			if (pos1 == -1)
				pos1 = i;
			else if (pos2 == -1)
				pos2 = i;
		}
	}

	if (pos1 == -1 || pos2 == -1)
	{
		writeln(-1);
	}
	else
	{
		string ans;
		foreach_reverse (i; 0..cnt.length)
		{
			if (i == pos2)
			{
				--cnt[pos2];
				--cnt[pos1];
				foreach (_; 0..cnt[i])
					ans ~= i.to!string;
				ans ~= pos1.to!string ~ pos2.to!string;
			}
			else
			{
				foreach (_; 0..cnt[i])
					ans ~= i.to!string;	
			}
		}
		if (ans[0] == '0')
			writeln(-1);
		else
			writeln(ans);
	}

	stdout.flush();
	debug readln();
}