結果

問題 No.170 スワップ文字列(Easy)
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2015-03-22 23:25:20
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 61 ms / 5,000 ms
コード長 5,253 bytes
コンパイル時間 3,280 ms
コンパイル使用メモリ 112,068 KB
実行使用メモリ 26,000 KB
最終ジャッジ日時 2023-08-24 15:58:19
合計ジャッジ時間 5,677 ms
ジャッジサーバーID
(参考情報)
judge12 / judge11
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 51 ms
22,244 KB
testcase_01 AC 60 ms
23,904 KB
testcase_02 AC 53 ms
22,172 KB
testcase_03 AC 54 ms
22,352 KB
testcase_04 AC 54 ms
22,224 KB
testcase_05 AC 60 ms
23,896 KB
testcase_06 AC 61 ms
26,000 KB
testcase_07 AC 55 ms
24,332 KB
testcase_08 AC 55 ms
24,196 KB
testcase_09 AC 54 ms
22,288 KB
testcase_10 AC 57 ms
22,920 KB
testcase_11 AC 54 ms
22,152 KB
testcase_12 AC 55 ms
24,232 KB
testcase_13 AC 54 ms
22,324 KB
testcase_14 AC 54 ms
22,256 KB
testcase_15 AC 54 ms
22,392 KB
testcase_16 AC 54 ms
22,280 KB
testcase_17 AC 54 ms
22,220 KB
testcase_18 AC 54 ms
22,168 KB
testcase_19 AC 54 ms
24,264 KB
testcase_20 AC 54 ms
22,444 KB
testcase_21 AC 53 ms
20,336 KB
testcase_22 AC 54 ms
20,064 KB
testcase_23 AC 54 ms
24,348 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.Linq;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
namespace Program
{
    public class Solver
    {
        public void Solve()
        {
            var s = sc.Scan().ToCharArray();
            Array.Sort(s);
            var set = new HashSet<long>();
            do
            {
                var h = hash(s);
                set.Add(h);
            } while (MathEx.NextPermutation(s,0,s.Length));
            IO.Printer.Out.WriteLine(set.Count-1);
        }

        public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());
        static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; }
        public long hash(char[] s)
        {
            var n = s.Length;
            long ret = 0;
            for (int i = 0; i < n; i++)
                ret = ret * 26 + (s[i] - 'A');
            return ret;
        }
    }


}

#region Ex
namespace Program.IO
{
    using System.IO;
    using System.Text;
    using System.Globalization;
    public class Printer : StreamWriter
    {
        static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; }
        public static Printer Out { get; set; }
        public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
        public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
        public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { }
        public void Write<T>(string format, IEnumerable<T> source) { base.Write(format, source.OfType<object>().ToArray()); }
        public void WriteLine<T>(string format, IEnumerable<T> source) { base.WriteLine(format, source.OfType<object>().ToArray()); }
    }
    public class StreamScanner
    {
        public StreamScanner(Stream stream) { str = stream; }
        private readonly Stream str;
        private readonly byte[] buf = new byte[1024];
        private int len, ptr;
        public bool isEof = false;
        public bool IsEndOfStream { get { return isEof; } }
        private byte read()
        {
            if (isEof) return 0;
            if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } }
            return buf[ptr++];
        }
        public char Char() { byte b = 0; do b = read(); while (b < 33 || 126 < b); return (char)b; }

        public string Scan()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
                sb.Append(b);
            return sb.ToString();
        }
        public long Long()
        {
            if (isEof) return long.MinValue;
            long ret = 0; byte b = 0; var ng = false;
            do b = read();
            while (b != '-' && (b < '0' || '9' < b));
            if (b == '-') { ng = true; b = read(); }
            for (; true; b = read())
            {
                if (b < '0' || '9' < b)
                    return ng ? -ret : ret;
                else ret = ret * 10 + b - '0';
            }
        }
        public int Integer() { return (isEof) ? int.MinValue : (int)Long(); }
        public double Double() { return double.Parse(Scan(), CultureInfo.InvariantCulture); }
        private T[] enumerate<T>(int n, Func<T> f)
        {
            var a = new T[n];
            for (int i = 0; i < n; ++i) a[i] = f();
            return a;
        }

        public char[] Char(int n) { return enumerate(n, Char); }
        public string[] Scan(int n) { return enumerate(n, Scan); }
        public double[] Double(int n) { return enumerate(n, Double); }
        public int[] Integer(int n) { return enumerate(n, Integer); }
        public long[] Long(int n) { return enumerate(n, Long); }
    }
}
static class Ex
{
    static public string AsString(this IEnumerable<char> ie) { return new string(System.Linq.Enumerable.ToArray(ie)); }
    static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); }
    static public void Main()
    {
        var solver = new Program.Solver();
        solver.Solve();
        Program.IO.Printer.Out.Flush();
    }
}
#endregion


#region next_permutation
static public partial class MathEx
{

    static public bool NextPermutation<T>(T[] array, int first, int last) where T : IComparable<T>
    {
        if (first == last)
            return false;
        var i = last;
        if (--i == first)
            return false;
        while (true)
        {
            var ii = i--;
            if (array[i].CompareTo(array[ii]) < 0)
            {
                var j = last;
                while (array[i].CompareTo(array[--j]) >= 0) { }
                var temp = array[i];
                array[i] = array[j];
                array[j] = temp;
                Array.Reverse(array, ii, last - ii);
                return true;
            }
            if (i == first)
            {
                Array.Reverse(array, first, last - first);
                return false;
            }
        }
    }

}
#endregion
0