結果

問題 No.155 生放送とBGM
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2015-06-25 19:16:26
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 911 ms / 6,000 ms
コード長 5,721 bytes
コンパイル時間 2,212 ms
コンパイル使用メモリ 117,376 KB
実行使用メモリ 34,304 KB
最終ジャッジ日時 2024-07-07 17:37:04
合計ジャッジ時間 8,145 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 791 ms
29,696 KB
testcase_01 AC 816 ms
29,952 KB
testcase_02 AC 911 ms
34,304 KB
testcase_03 AC 21 ms
18,432 KB
testcase_04 AC 126 ms
22,656 KB
testcase_05 AC 23 ms
19,476 KB
testcase_06 AC 743 ms
27,776 KB
testcase_07 AC 28 ms
20,096 KB
testcase_08 AC 25 ms
19,840 KB
testcase_09 AC 32 ms
19,596 KB
testcase_10 AC 26 ms
20,352 KB
testcase_11 AC 33 ms
19,584 KB
testcase_12 AC 35 ms
19,840 KB
testcase_13 AC 28 ms
19,592 KB
testcase_14 AC 643 ms
28,416 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.Diagnostics;
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 n = sc.Integer();
            var l = sc.Integer() * 60;
            var s = Enumerate(n, x => sc.Integer() * 60 + sc.Integer());
            var sum = s.Sum();
            if (l >= sum)
            {
                IO.Printer.Out.WriteLine(n);
                return;
            }
            var fact = new double[100];
            fact[0] = fact[1] = 1;
            for (int i = 2; i < 100; i++)
                fact[i] = fact[i - 1] * i;

            var dp = new long[n + 1, 22000];
            dp[0, 0] = 1;
            foreach (var x in s)
                for (int i = n; i >= 0; i--)
                    for (int j = 0; j < 22000; j++)
                        if (dp[i, j] > 0)
                            dp[i + 1, Math.Min(22000 - 1, j + x)] += dp[i, j];

            var dpdp = new long[n + 1, 22000];
            double ret = 0.0;
            foreach (var x in s)
            {
                for (int i = 0; i <= n; i++)
                    for (int j = 0; j <= l + x - 1; j++)
                    {
                        dpdp[i, j] = dp[i, j];
                        if (j >= x && i > 0) dpdp[i, j] -= dpdp[i - 1, j - x];
                        if (dpdp[i, j] == 0) continue;
                        if (i < n && j < l)
                        {
                            ret += dpdp[i, j] * fact[i] * fact[n - (i + 1)];
                        }
                    }

            }
            ret /= fact[n];
            IO.Printer.Out.WriteLine(ret);
        }
        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 != '-' && (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); }
    }
}
#endregion
0