結果
問題 | No.133 カードゲーム |
ユーザー | mnzn |
提出日時 | 2019-12-30 11:30:51 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 33 ms / 5,000 ms |
コード長 | 5,421 bytes |
コンパイル時間 | 1,209 ms |
コンパイル使用メモリ | 108,672 KB |
実行使用メモリ | 19,840 KB |
最終ジャッジ日時 | 2024-11-07 23:22:15 |
合計ジャッジ時間 | 2,813 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 32 ms
19,712 KB |
testcase_01 | AC | 32 ms
19,712 KB |
testcase_02 | AC | 32 ms
19,712 KB |
testcase_03 | AC | 30 ms
19,072 KB |
testcase_04 | AC | 32 ms
19,840 KB |
testcase_05 | AC | 33 ms
19,840 KB |
testcase_06 | AC | 32 ms
19,712 KB |
testcase_07 | AC | 32 ms
19,584 KB |
testcase_08 | AC | 33 ms
19,712 KB |
testcase_09 | AC | 32 ms
19,712 KB |
testcase_10 | AC | 31 ms
19,712 KB |
testcase_11 | AC | 32 ms
19,584 KB |
testcase_12 | AC | 32 ms
19,712 KB |
testcase_13 | AC | 32 ms
19,712 KB |
testcase_14 | AC | 32 ms
19,712 KB |
testcase_15 | AC | 32 ms
19,712 KB |
testcase_16 | AC | 32 ms
19,584 KB |
testcase_17 | AC | 31 ms
19,072 KB |
testcase_18 | AC | 32 ms
19,840 KB |
testcase_19 | AC | 32 ms
19,840 KB |
testcase_20 | AC | 31 ms
19,840 KB |
testcase_21 | AC | 32 ms
19,840 KB |
testcase_22 | AC | 32 ms
19,712 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.Collections.Generic; using System.Linq; using System.Text; class Program { static void Main(string[] args) { var N = sc.ReadInt(); var A = sc.ReadIntArray(N); var B = sc.ReadIntArray(N); var permA = Permutation.All(A); var permB = Permutation.All(B); var all = 0; var awin = 0; foreach (var patternA in permA) { foreach (var patternB in permB) { all++; var count = 0; for (int i = 0; i < N; i++) { var a = patternA[i]; var b = patternB[i]; if (a > b) count++; } if (count > N / 2) awin++; } } var ans = (double)awin / all; Console.WriteLine(ans); } static class Permutation { private static void Search<T>(List<T[]> perms, Stack<T> stack, T[] a) { int N = a.Length; if (N == 0) { perms.Add(stack.Reverse().ToArray()); } else { var b = new T[N - 1]; Array.Copy(a, 1, b, 0, N - 1); for (int i = 0; i < a.Length; ++i) { stack.Push(a[i]); Search(perms, stack, b); if (i < b.Length) { b[i] = a[i]; } stack.Pop(); } } } public static List<T[]> All<T>(params T[] source) { var perms = new List<T[]>(); Search(perms, new Stack<T>(), source); return perms; } } static Scanner sc = new Scanner(); } class Scanner { string[] S = new string[0]; int Index = 0; char[] Separators = new char[] { ' ' }; public string Next() { if (this.Index < this.S.Length) return this.S[this.Index++]; var line = ""; while (line == "") line = Console.ReadLine(); this.S = line.Split(this.Separators, StringSplitOptions.RemoveEmptyEntries); if (this.S.Length == 0) return this.Next(); this.Index = 0; return this.S[this.Index++]; } public string ReadStr() { return this.Next(); } public char ReadChar() { return this.Next()[0]; } public int ReadInt() { return int.Parse(this.Next()); } public uint ReadUInt() { return uint.Parse(this.Next()); } public long ReadLong() { return long.Parse(this.Next()); } public double ReadDouble() { return double.Parse(this.Next()); } public Tuple<int, int> ReadTup(int add = 0) { return Tuple.Create(this.ReadInt() + add, this.ReadInt() + add); } public Tuple<long, long> ReadTupLong(int add = 0) { return Tuple.Create(this.ReadLong() + add, this.ReadLong() + add); } public Tuple<int, int, int> ReadTup3(int add = 0) { return Tuple.Create(this.ReadInt() + add, this.ReadInt() + add, this.ReadInt() + add); } public Tuple<int, int, int, int> ReadTup4(int add = 0) { return Tuple.Create(this.ReadInt() + add, this.ReadInt() + add, this.ReadInt() + add, this.ReadInt() + add); } public int[] ReadIntArray(int n) { var array = new int[n]; for (int i = 0; i < array.Length; i++) { array[i] = this.ReadInt(); } return array; } public long[] ReadLongArray(int n) { var array = new long[n]; for (int i = 0; i < array.Length; i++) { array[i] = this.ReadLong(); } return array; } public double[] ReadDoubleArray(int n) { var array = new double[n]; for (int i = 0; i < array.Length; i++) { array[i] = this.ReadDouble(); } return array; } public char[] ReadCharArray(int n) { var array = new char[n]; for (int i = 0; i < array.Length; i++) { array[i] = this.ReadChar(); } return array; } public string[] ReadStrArray(int n) { var array = new string[n]; for (int i = 0; i < array.Length; i++) { array[i] = this.ReadStr(); } return array; } public Tuple<long, long>[] ReadTupLongArray(int n, int add = 0) { var array = new Tuple<long, long>[n]; for (int i = 0; i < n; i++) { array[i] = this.ReadTupLong(add); } return array; } public Tuple<int, int>[] ReadTupArray(int n, int add = 0) { var array = new Tuple<int, int>[n]; for (int i = 0; i < n; i++) { array[i] = this.ReadTup(add); } return array; } public Tuple<int, int, int>[] ReadTup3Array(int n, int add = 0) { var array = new Tuple<int, int, int>[n]; for (int i = 0; i < n; i++) { array[i] = this.ReadTup3(add); } return array; } public Tuple<int, int, int, int>[] ReadTup4Array(int n, int add = 0) { var array = new Tuple<int, int, int, int>[n]; for (int i = 0; i < n; i++) { array[i] = this.ReadTup4(add); } return array; } }