結果
問題 | No.162 8020運動 |
ユーザー | eitaho |
提出日時 | 2015-03-08 19:50:43 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 1,612 ms / 5,000 ms |
コード長 | 3,638 bytes |
コンパイル時間 | 2,564 ms |
コンパイル使用メモリ | 111,712 KB |
実行使用メモリ | 139,692 KB |
最終ジャッジ日時 | 2023-09-06 22:09:36 |
合計ジャッジ時間 | 41,224 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 750 ms
135,788 KB |
testcase_01 | AC | 1,142 ms
139,036 KB |
testcase_02 | AC | 1,356 ms
133,564 KB |
testcase_03 | AC | 1,577 ms
136,064 KB |
testcase_04 | AC | 1,580 ms
134,280 KB |
testcase_05 | AC | 1,582 ms
134,240 KB |
testcase_06 | AC | 1,599 ms
134,020 KB |
testcase_07 | AC | 1,594 ms
136,124 KB |
testcase_08 | AC | 1,612 ms
136,120 KB |
testcase_09 | AC | 748 ms
135,796 KB |
testcase_10 | AC | 1,378 ms
137,512 KB |
testcase_11 | AC | 1,146 ms
132,996 KB |
testcase_12 | AC | 925 ms
136,328 KB |
testcase_13 | AC | 1,602 ms
134,180 KB |
testcase_14 | AC | 792 ms
133,972 KB |
testcase_15 | AC | 791 ms
133,872 KB |
testcase_16 | AC | 967 ms
134,320 KB |
testcase_17 | AC | 836 ms
135,988 KB |
testcase_18 | AC | 1,563 ms
136,364 KB |
testcase_19 | AC | 1,325 ms
135,468 KB |
testcase_20 | AC | 1,428 ms
139,692 KB |
testcase_21 | AC | 1,418 ms
135,872 KB |
testcase_22 | AC | 1,370 ms
135,672 KB |
testcase_23 | AC | 1,399 ms
135,816 KB |
testcase_24 | AC | 1,366 ms
137,724 KB |
testcase_25 | AC | 1,441 ms
135,912 KB |
testcase_26 | AC | 747 ms
135,648 KB |
testcase_27 | AC | 1,197 ms
137,196 KB |
testcase_28 | AC | 1,567 ms
136,120 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.IO; using System.Linq; using System.Text; using System.Diagnostics; using System.Collections.Generic; using System.Text.RegularExpressions; using Enu = System.Linq.Enumerable; class Program { static readonly int NumTeeth = 14; static readonly int Target = 80; void Solve() { int Age = reader.Int(); var GoodProb = Enu.Range(0, 3).Select(i => 1 - reader.Double() / 100).ToArray(); var state = new List<Edge>[1 << NumTeeth]; for (int mask = 0; mask < (1 << NumTeeth); mask++) { state[mask] = new List<Edge>(); int A = mask << 1; for (int sub = mask; ; sub = (sub - 1) & mask) { int B = sub << 1; double p = 1; for (int i = 1; i <= NumTeeth; i++) if ((A >> i & 1) == 1) { int count = (A >> (i - 1) & 1) + (A >> (i + 1) & 1); if ((B >> i & 1) == 1) p *= GoodProb[count]; else p *= 1 - GoodProb[count]; } state[mask].Add(new Edge(sub, p)); if (sub == 0) break; } } double[] prob = new double[1 << NumTeeth]; prob[(1 << NumTeeth) - 1] = 1; for (int age = Age; age < Target; age++) { var next = new double[prob.Length]; for (int mask = 0; mask < (1 << NumTeeth); mask++) foreach (var e in state[mask]) next[e.next] += prob[mask] * e.prob; prob = next; } double ans = 0; for (int mask = 0; mask < prob.Length; mask++) ans += BitCount(mask) * prob[mask]; ans *= 2; Console.WriteLine(ans); } struct Edge { public int next; public double prob; public Edge(int next, double p) { this.next = next; prob = p; } } int BitCount(long x) { return x == 0 ? 0 : 1 + BitCount(x & x - 1); } Reader reader = new Reader(Console.In); static void Main() { new Program().Solve(); } } class Reader { private readonly TextReader reader; private readonly char[] separator = { ' ' }; private readonly StringSplitOptions removeOp = StringSplitOptions.RemoveEmptyEntries; private string[] A = new string[0]; private int i; public Reader(TextReader r) { reader = r; } public Reader(string file) { reader = new StreamReader(file); } public bool HasNext() { return Enqueue(); } public string String() { return Dequeue(); } public int Int() { return int.Parse(Dequeue()); } public long Long() { return long.Parse(Dequeue()); } public double Double() { return double.Parse(Dequeue()); } public int[] IntLine() { var s = Line(); return s == "" ? new int[0] : Array.ConvertAll(Split(s), int.Parse); } public int[] IntArray(int N) { return Enu.Range(0, N).Select(i => Int()).ToArray(); } public int[][] IntGrid(int H) { return Enu.Range(0, H).Select(i => IntLine()).ToArray(); } public string[] StringArray(int N) { return Enu.Range(0, N).Select(i => Line()).ToArray(); } public string Line() { return reader.ReadLine().Trim(); } private string[] Split(string s) { return s.Split(separator, removeOp); } private bool Enqueue() { if (i < A.Length) return true; string line = reader.ReadLine(); if (line == null) return false; if (line == "") return Enqueue(); A = Split(line); i = 0; return true; } private string Dequeue() { Enqueue(); return A[i++]; } }