結果
問題 | No.662 スロットマシーン |
ユーザー | lzy9 |
提出日時 | 2018-03-09 23:24:34 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,513 bytes |
コンパイル時間 | 2,945 ms |
コンパイル使用メモリ | 111,360 KB |
実行使用メモリ | 28,320 KB |
最終ジャッジ日時 | 2024-10-10 19:39:30 |
合計ジャッジ時間 | 4,176 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 24 ms
24,156 KB |
testcase_01 | AC | 27 ms
23,984 KB |
testcase_02 | AC | 25 ms
24,108 KB |
testcase_03 | AC | 25 ms
23,984 KB |
testcase_04 | AC | 26 ms
24,064 KB |
testcase_05 | AC | 24 ms
23,856 KB |
testcase_06 | AC | 26 ms
26,116 KB |
testcase_07 | AC | 27 ms
24,060 KB |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | AC | 26 ms
24,064 KB |
testcase_17 | WA | - |
testcase_18 | WA | - |
コンパイルメッセージ
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.Collections.Generic; class Program { static int[] dx = new int[] { 0, 0, 1, -1 }; static int[] dy = new int[] { 1, -1, 0, 0 }; static void Solve() { var str = new string[5]; var coin = new long[5]; for (int i = 0; i < 5; i++) { str[i] = sc.Str(); coin[i] = sc.Int(); } var n = sc.Int(); var a = sc.Str(n); n = sc.Int(); var b = sc.Str(n); n = sc.Int(); var c = sc.Str(n); var cnt = new long[3][]; for (int i = 0; i < 3; i++) cnt[i] = new long[5]; for (int i = 0; i < a.Length; i++) for (int j = 0; j < 5; j++) if (str[j] == a[i]) cnt[0][j]++; for (int i = 0; i < b.Length; i++) for (int j = 0; j < 5; j++) if (str[j] == b[i]) cnt[1][j]++; for (int i = 0; i < c.Length; i++) for (int j = 0; j < 5; j++) if (str[j] == c[i]) cnt[2][j]++; var ptn = new long[5]; for (int i = 0; i < 5; i++) ptn[i] = cnt[0][i] * cnt[1][i] * cnt[2][i]; Decimal ans = 0.0m; Decimal allptn = a.Length * b.Length * c.Length; for (int i = 0; i < 5; i++) ans += coin[i] * ptn[i] * 5L / allptn; pr.WriteLine(ans); for (int i = 0; i < 5; i++) pr.WriteLine(ptn[i] * 5L); } static int[,] Mul(int[,] a, int[,] b) { var ret = new int[a.GetLength(0), b.GetLength(1)]; for (int i = 0; i < a.GetLength(0); i++) for (int j = 0; j < b.GetLength(1); j++) for (int k = 0; k < a.GetLength(1); k++) ret[i, j] += a[i, k] * b[k, j]; return ret; } static int[,] Pow(int[,] a, int n) { var b = new int[a.GetLength(1), a.GetLength(0)]; var f = n % 2 == 1; for (int i = 0; i < a.GetLength(0); i++) b[i, i] = 1; while (n > 0) { if (n % 2 == 1) b = Mul(a, b); n >>= 1; } return b; } class Coord { public int x; public int y; } static void Main(string[] args) { // pr.AutoFlush = true; Solve(); pr.Flush(); // Console.ReadKey(); } static Scanner sc = new Scanner(); static Printer pr = new Printer(); } #region IO class Scanner { private int _i = 0; private string[] line = new string[0]; private T[] Enumerate<T>(int n, Func<T> f) { T[] ret = new T[n]; for (int i = 0; i < n; i++) ret[i] = f(); return ret; } public string Str() { if (line.Length <= _i) { line = Console.ReadLine().Split(' '); _i = 0; } return line[_i++]; } public int Int() => int.Parse(Str()); public long Long() => long.Parse(Str()); public double Double() => double.Parse(Str()); public int[] Int(int n) => Enumerate(n, Int); public long[] Long(int n) => Enumerate(n, Long); public double[] Double(int n) => Enumerate(n, Double); public string[] Str(int n) => Enumerate(n, Str); } class Printer : StreamWriter { public Printer() : base(Console.OpenStandardOutput()) { AutoFlush = false; } } #endregion