#16428 (C#(csc)) No.171 スワップ文字列(Med)

• 問題: No.171 スワップ文字列(Med)
• ユーザー: 紙ぺーぱー
• 提出日時: 2015-03-22 23:31:42
• 言語: C#(csc) (csc 3.9.0)
• 結果: WA
• 実行時間: -
• コード長: 5,564 bytes
• コンパイル時間: 982 ms
• コンパイル使用メモリ: 110,720 KB
• 実行使用メモリ: 21,760 KB
• 最終ジャッジ日時: 2024-06-29 00:11:53
• 合計ジャッジ時間: 1,938 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	32 ms; 21,760 KB
testcase_01	AC	29 ms; 21,632 KB
testcase_02	WA	-
testcase_03	RE	-
testcase_04	RE	-
testcase_05	WA	-
testcase_06	RE	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	WA	-
testcase_10	AC	26 ms; 21,632 KB
testcase_11	AC	26 ms; 21,760 KB
testcase_12	AC	27 ms; 21,504 KB

コンパイルメッセージ

Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

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();
            var h = new HashMap<int, int>();
            const long mod = 573;
            var table = new CombinationTable(1000);
            foreach (var x in s)
                h[x - 'A']++;
            var cnt = 0;
            long ret = 0;
            foreach (var kv in h)
            {
                if (cnt == 0)
                {
                    ret = 1;
                    cnt = kv.Value;
                }
                else
                {
                    ret = (ret * (table[cnt + 1, kv.Value] % mod)) % mod;
                    cnt += kv.Value;
                }
            }
            IO.Printer.Out.WriteLine(ret - 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; }

    }


}

#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 HashMap
class HashMap<K, V> : Dictionary<K, V>
{
    new public V this[K i]
    {
        get
        {
            V v;
            return TryGetValue(i, out v) ? v : base[i] = default(V);
        }
        set { base[i] = value; }
    }
}
#endregion
#region CombinationTable
public class CombinationTable
{
    long[][] nCr;
    public CombinationTable(int n)
    {
        nCr = new long[n + 1][];
        for (int i = 0; i <= n; i++)
            nCr[i] = new long[i + 2];
        nCr[0][0] = 1;
        for (int i = 1; i <= n; i++)
            for (int j = 0; j <= i; j++)
                if (j > 0)
                    nCr[i][j] = nCr[i - 1][j - 1] + nCr[i - 1][j];
                else nCr[i][j] = 1;
    }
    public long this[int n, int r]
    {
        get
        {
            if (n <= 0 || n > nCr.Length)
                throw new IndexOutOfRangeException("n<=0 || n>N ");
            if (r <= 0 || r > n)
                throw new IndexOutOfRangeException("r<=0 ||r>n");
            return nCr[n][r];
        }
    }
}
#endregion