結果

問題 No.927 Second Permutation
ユーザー naimonon77naimonon77
提出日時 2019-11-29 18:59:00
言語 C#(csc)
(csc 3.9.0)
結果
WA  
実行時間 -
コード長 5,436 bytes
コンパイル時間 1,281 ms
コンパイル使用メモリ 117,504 KB
実行使用メモリ 30,364 KB
最終ジャッジ日時 2024-11-20 21:26:24
合計ジャッジ時間 3,584 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 32 ms
25,780 KB
testcase_01 AC 32 ms
27,360 KB
testcase_02 AC 32 ms
25,568 KB
testcase_03 AC 31 ms
25,568 KB
testcase_04 AC 30 ms
27,592 KB
testcase_05 AC 31 ms
25,828 KB
testcase_06 AC 31 ms
27,844 KB
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 AC 45 ms
25,368 KB
testcase_25 AC 40 ms
25,752 KB
testcase_26 AC 39 ms
25,640 KB
testcase_27 AC 37 ms
27,548 KB
testcase_28 AC 45 ms
23,836 KB
testcase_29 AC 42 ms
25,756 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text.RegularExpressions;
//using System.Text;
//using System.Threading.Tasks;
using System.IO;
using System.Runtime.CompilerServices;
////using System.Web.UI;
//using Debug = System.Diagnostics.Debug;
//// using System.Drawing.Primitives;
////using System.Drawing;
//using System.Windows;
using System.Numerics;

namespace ConsoleApp1
{
    class Program 
    {
        static void Main(string[] args)
        {
            new Solver().Solve();
        }
    }

    class GeneralPurposeClass {
        //public const double inf = double.PositiveInfinity;
        public const long inf = 1L << 50;
        public static readonly TextWriter error = Console.Error;
        public static Random random = new Random();

        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public static void Rep(long n_, Action<long> action)
        {
            for (long i = 0; i < n_; i++)
            {
                action(i);
            }
        }

        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public static void Rep2(int a, long n_, Action<long> action)
        {
            for (long i = a; i < n_; i++)
            {
                action(i);
            }
        }

        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public static void Rrep(long n_, Action<long> action)
        {
            for (long i = n_; i > -1; i--)
            {
                action(i);
            }
        }

        public static void TestReps()
        {
            var end = 3;
            var end2 = 10;
            error.WriteLine("rep ------");
            Dumpl("end", end);
            Rep(end, (i) =>
            {
                error.WriteLine(i);
            });

            error.WriteLine("");
            error.WriteLine("rep2 ------");
            var start = 7;
            Dumpl("start", start);
            Dumpl("end2", end2);
            Rep2(start, end2, (i) =>
            {
                error.WriteLine(i);
            });

            error.WriteLine("");
            error.WriteLine("rrep ------");
            Dumpl("end", end);
            Rrep(end, (i) =>
            {
                error.WriteLine(i);
            });
        }

        public static string ReadLine()
        {
            var s = Console.ReadLine();
            Dumpl("s", s);
            if (s.Length == 0) s = Console.ReadLine();
            var c = s[0];
            if (c == ' ' || c == '\n' || c == '\r') s = ReadLine();
            Dumpl("s", s);

            return s;
        }

        public static string ReadNext()
        {
            var s = "";
            while (true)
            {
                var c = Console.Read();
                if (c != ' ' && c != '\n' && c != '\r')
                {
                    s += (char)c;
                    break;
                }
            }
            while (true)
            {
                var c = Console.Read();
                if (c == ' ' || c == '\n' || c == '\r') break;
                s += (char)c;
            }
            return s;
        }

        public static long ReadLong()
        {
            return Stol(ReadNext());
        }

        public static long Stol(string s)
        {
            return long.Parse(s);
        }

        public static void Write<T>(T a)
            where T : IComparable
        { Console.Write(a); }

        public static void WriteL<T>(T a)
            where T : IComparable
        { Console.WriteLine(a); }

        public static void Dump<T>(string s, T a)
            where T : IComparable
        {
#if DEBUG
            error.Write(s + ": " + a.ToString() + ' ');
#endif
        }

        public static void Dumpl<T>(string s, T a)
            where T : IComparable
        {
#if DEBUG
            Dump(s, a); error.WriteLine();
#endif
        }

        public int PowRandom(int a)
        {
            double nextDouble = NextDouble(a);
            return PowAndFloor(nextDouble);
        }

        public int PowAndFloor(double a)
        {
            return (int)Math.Floor(Math.Pow(10, a));
        }

        public double NextDouble(int a)
        {
            return random.NextDouble() * a;
        }

        public double NextDouble(double a)
        {
            return random.NextDouble() * a;
        }

        public void WriteForMakeSampleCase<T>(T a)
            where T : IComparable
        {
#if DEBUG
            return;
#endif
            WriteL(a);
        }
    }

    class Solver : GeneralPurposeClass
    {
        char[] x;
        bool NG()
        {
            if (x.First() == x.Last()) return true;
            if (x[0] == '0' || x[1] == '0') return true;
            return false;
        }

        string ans()
        {
            for (var i = x.Count() - 1; i > -1; i--)
            {
                if (x[i] != x.Last())
                {
                    var tmp = x[i];
                    x[i] = x.Last();
                    x[x.Count() - 1] = tmp;
                    return string.Join("", x);
                }
            }
            return "-1";
        }

        public void Solve()
        {
            x = ReadLine().ToArray();
            Array.Sort(x);
            Array.Reverse(x);

            string res;
            if (NG()) res = "-1";
            else res = ans();
            WriteL(res);
        }
    }
}
0