結果

問題 No.298 話の伝達
ユーザー 紙ぺーぱー紙ぺーぱー
提出日時 2015-11-06 23:12:41
言語 C#(csc)
(csc 3.9.0)
結果
WA  
(最新)
AC  
(最初)
実行時間 -
コード長 6,512 bytes
コンパイル時間 3,729 ms
コンパイル使用メモリ 111,944 KB
実行使用メモリ 25,432 KB
最終ジャッジ日時 2023-10-11 14:53:36
合計ジャッジ時間 6,412 ms
ジャッジサーバーID
(参考情報)
judge15 / judge14
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 AC 59 ms
21,316 KB
testcase_02 AC 60 ms
23,300 KB
testcase_03 AC 59 ms
23,320 KB
testcase_04 WA -
testcase_05 AC 116 ms
23,180 KB
testcase_06 WA -
testcase_07 AC 60 ms
25,292 KB
testcase_08 AC 59 ms
23,188 KB
testcase_09 WA -
testcase_10 WA -
testcase_11 AC 60 ms
23,212 KB
testcase_12 AC 56 ms
23,248 KB
testcase_13 WA -
testcase_14 WA -
testcase_15 AC 59 ms
25,232 KB
testcase_16 AC 285 ms
25,196 KB
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 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.Diagnostics;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
using Number = System.Int32;
namespace Program
{

    public class Solver
    {
        public void Solve()
        {
            var n = sc.Integer();
            var m = sc.Integer();
            var dp = new double[n];
            var val = Enumerate(n, x => new List<double>());

            var G = Enumerate(n, x => new List<KeyValuePair<int, double>>());
            var gg = Enumerate(n, x => new List<int>());

            for (int i = 0; i < m; i++)
            {
                var f = sc.Integer();
                var t = sc.Integer();
                var p = sc.Integer() / 100.0;
                G[f].Add(new KeyValuePair<Number, double>(t, p));
                gg[f].Add(t);
            }
            dp[0] = 1;
            var ord = Graph.TopologicalSort(gg);
            Debug.WriteLine(ord.AsJoinedString());
            foreach (var x in ord)
            {
                for (int i = 1; i < 1 << val[x].Count; i++)
                {
                    var pp = 1.0;
                    for (int j = 0; j < val[x].Count; j++)
                    {
                        if ((i >> j & 1) == 1) pp *= val[x][j];
                        else pp *= (1 - val[x][j]);
                    }
                    dp[x] += pp;
                }
                foreach (var to in G[x])
                {
                    val[to.Key].Add(dp[x] * to.Value);
                }
            }
            IO.Printer.Out.WriteLine(dp[n - 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; }
        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


#region TopologicalSort
static partial class Graph
{
    //順序をいじりたい場合はQueueから変える
    //使わない奴がある場合はcountのその位置に予め-1を入れて渡す
    //循環してるとサイズが小さくなるはず?
    static public int[] TopologicalSort(List<int>[] G, int[] count = null)
    {
        var n = G.Length;
        if (count == null)
        {
            count = new int[n];
            foreach (var l in G)
                foreach (var x in l) count[x]++;
        }
        var ret = new List<int>();
        var q = new Queue<int>();
        for (int i = 0; i < n; i++)
            if (count[i] == 0) q.Enqueue(i);
        while (q.Any())
        {
            var p = q.Dequeue();
            ret.Add(p);
            foreach (var x in G[p])
                if (--count[x] == 0) q.Enqueue(x);
        }
        return ret.ToArray();
    }

}
#endregion
0