結果

問題 No.295 hel__world
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2016-05-26 14:42:01
言語 C#(csc)
(csc 3.9.0)
結果
WA  
実行時間 -
コード長 6,108 bytes
コンパイル時間 1,156 ms
コンパイル使用メモリ 119,628 KB
実行使用メモリ 50,804 KB
最終ジャッジ日時 2024-10-07 15:44:35
合計ジャッジ時間 6,361 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 35 ms
25,128 KB
testcase_01 AC 33 ms
25,340 KB
testcase_02 AC 33 ms
24,752 KB
testcase_03 AC 35 ms
25,388 KB
testcase_04 WA -
testcase_05 AC 35 ms
25,316 KB
testcase_06 WA -
testcase_07 AC 34 ms
25,568 KB
testcase_08 AC 34 ms
27,124 KB
testcase_09 AC 35 ms
27,360 KB
testcase_10 AC 33 ms
25,184 KB
testcase_11 AC 33 ms
25,188 KB
testcase_12 AC 34 ms
25,388 KB
testcase_13 AC 33 ms
24,672 KB
testcase_14 AC 35 ms
27,228 KB
testcase_15 AC 31 ms
24,548 KB
testcase_16 AC 33 ms
27,148 KB
testcase_17 AC 32 ms
26,704 KB
testcase_18 AC 31 ms
24,624 KB
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 AC 34 ms
25,524 KB
testcase_25 AC 33 ms
24,804 KB
testcase_26 AC 32 ms
26,824 KB
testcase_27 AC 34 ms
27,480 KB
testcase_28 AC 35 ms
25,448 KB
testcase_29 AC 31 ms
24,788 KB
testcase_30 AC 32 ms
26,900 KB
testcase_31 WA -
testcase_32 AC 381 ms
47,092 KB
testcase_33 AC 380 ms
50,804 KB
testcase_34 AC 381 ms
46,808 KB
testcase_35 AC 33 ms
25,180 KB
testcase_36 AC 34 ms
26,908 KB
testcase_37 AC 32 ms
25,264 KB
testcase_38 AC 34 ms
25,404 KB
testcase_39 AC 36 ms
25,320 KB
testcase_40 AC 34 ms
27,320 KB
testcase_41 AC 35 ms
27,312 KB
testcase_42 AC 33 ms
25,012 KB
testcase_43 AC 33 ms
26,692 KB
testcase_44 AC 33 ms
26,712 KB
testcase_45 AC 32 ms
24,288 KB
testcase_46 AC 33 ms
24,880 KB
testcase_47 AC 32 ms
26,576 KB
testcase_48 AC 32 ms
24,676 KB
testcase_49 AC 32 ms
26,452 KB
testcase_50 AC 35 ms
27,224 KB
testcase_51 AC 37 ms
27,452 KB
testcase_52 AC 36 ms
25,284 KB
testcase_53 AC 58 ms
29,800 KB
testcase_54 AC 57 ms
31,856 KB
testcase_55 WA -
testcase_56 WA -
権限があれば一括ダウンロードができます
コンパイルメッセージ
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;
using Number = System.Int64;
namespace Program
{

    public class Solver
    {
        public void Solve()
        {
            var a = sc.Long(26);
            var G = Enumerate(26, x => new List<int>());
            var T = sc.Scan() + '$';
            var c = '$';
            var cnt = 0;
            foreach (var x in T)
            {
                if (c == x) cnt++;
                else
                {
                    if (c != '$') G[c - 'a'].Add(cnt);
                    c = x; cnt = 1;
                }

            }
            Func<long, int, BigInteger> comb = (n, k) =>
                 {
                     BigInteger ret = 1L;
                     for (int i = 1; i <= k; i++)
                     {
                         ret *= n - (i - 1);
                         ret /= i;
                         if (ret >= 1L << 62) break;
                     }
                     return ret;
                 };
            BigInteger ans = 1;
            for (int _ = 0; _ < 26; _++)
            {
                var b = G[_];
                if (b.Count == 0) continue;
                b.Sort();
                b.Reverse();
                //Debug.WriteLine(b.AsJoinedString());
                if (b.Sum() > a[_]) ans = 0;
                var rem = a[_] - b.Sum();
                var add = rem / b.Count;
                rem %= b.Count;
                var B = new long[b.Count];
                for (int i = 0; i < b.Count; i++)
                {
                    B[i] = b[i] + add;
                    if (rem > 0) { B[i]++; rem--; }
                    ans = BigInteger.Min(1L << 62, ans * comb(B[i], b[i]));
                }
                Debug.WriteLine(B.AsJoinedString());

            }
            if (ans >= 1L << 62)
                IO.Printer.Out.WriteLine("hel");
            else
            {
                IO.Printer.Out.WriteLine(ans);
            }
        }
        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; }
        static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
    }
}

#region main
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 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, T[] source) { base.Write(format, source.OfType<object>().ToArray()); }
        public void WriteLine<T>(string format, T[] source) { base.WriteLine(format, source.OfType<object>().ToArray()); }
    }
    public class StreamScanner
    {
        public StreamScanner(Stream stream) { str = stream; }
        public 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) && !isEof); 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 string ScanLine()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b != '\n'; b = (char)read())
                if (b == 0) break;
                else if (b != '\r') 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 != 0 && b != '-' && (b < '0' || '9' < b));
            if (b == 0) return long.MinValue;
            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() { var s = Scan(); return s != "" ? double.Parse(s, CultureInfo.InvariantCulture) : double.NaN; }
        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); }
    }
}
#endregion
0