#208975 (C#(csc)) No.133 カードゲーム

• 問題: No.133 カードゲーム
• ユーザー: sekiya9311
• 提出日時: 2017-10-11 19:39:09
• 言語: C#(csc) (csc 3.9.0)
• 結果: AC
• 実行時間: 32 ms / 5,000 ms
• コード長: 4,385 bytes
• コンパイル時間: 1,271 ms
• コンパイル使用メモリ: 110,976 KB
• 実行使用メモリ: 20,224 KB
• 最終ジャッジ日時: 2024-06-25 04:17:09
• 合計ジャッジ時間: 2,796 ms
• ジャッジサーバーID （参考情報）: judge1 / judge4

ファイルパターン	結果
sample	AC * 4
other	AC * 19

コンパイルメッセージ

Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace ProgrammingContest
{
    class MainClass
    {
        Scanner sc;
        static void Main(string[] args)
        {
            new MainClass().Solve();
        }
        void Solve()
        {
#if DEBUG
            string backPath = "..";
            char dirSep = System.IO.Path.DirectorySeparatorChar;
            string inFilePath = backPath + dirSep + backPath + dirSep + "in.txt";
            sc = new Scanner(new System.IO.StreamReader(inFilePath));
#else
            sc = new Scanner();
#endif
            int n = sc.NextInt;
            int[] a = new int[n].Select(val => sc.NextInt).ToArray();
            int[] b = new int[n].Select(val => sc.NextInt).ToArray();
            int[] sel = new int[n];
            for (int i = 0; i < n; i++)
            {
                sel[i] = i;
            }
            int win = 0, allCnt = 0;
            do
            {
                int cnt = 0;
                for (int i = 0; i < n; i++)
                {
                    if (a[sel[i]] > b[i])
                    {
                        cnt++;
                    }
                }
                if (cnt * 2 > n)
                {
                    win++;
                }
                allCnt++;
                //Write(ArrayToString(sel));
            } while (NextPermutation(sel));
            Write(1.0 * win / allCnt);
        }
        bool NextPermutation<T>(T[] ar) where T : IComparable<T>
        {
            int left = ar.Length - 1;
            Func<int, int, int> compForCalcNextPermutation = (i, j) =>
            {
                return ar[i].CompareTo(ar[j]);
            };
            while (0 < left && compForCalcNextPermutation(left - 1, left) >= 0)
            {
                left--;
            }
            if (left == 0)
            {
                return false;
            }
            int right = ar.Length - 1;
            while (compForCalcNextPermutation(right, left - 1) <= 0)
            {
                right--;
            }
            Swap(ref ar[left - 1], ref ar[right]);
            right = ar.Length - 1;
            while (left < right)
            {
                Swap(ref ar[left], ref ar[right]);
                left++;
                right--;
            }
            return true;
        }
        void Write(object val)
        {
            Console.WriteLine(val.ToString());
        }
        void Write(string format, params object[] vals)
        {
            Console.WriteLine(format, vals);
        }
        void Swap<T>(ref T a, ref T b)
        {
            T tmp = a;
            a = b;
            b = tmp;
        }
        string ArrayToString<T>(T[] ar, string sep = " ")
        {
            return string.Join(sep, Array.ConvertAll(ar, el => el.ToString()));
        }
    }
    class Scanner
    {
        Queue<String> buffer;
        char[] sep;
        System.IO.TextReader reader;
        public Scanner(System.IO.TextReader reader = null)
        {
            this.buffer = new Queue<string>();
            this.sep = new char[] { ' ' };
            this.reader = (reader ?? Console.In);
        }
        private void CheckBuffer()
        {
            if (this.buffer.Count == 0 && this.reader.Peek() >= 0)
            {
                string[] sreArray = this.reader.ReadLine().Split(this.sep);
                foreach (String elStr in sreArray)
                {
                    this.buffer.Enqueue(elStr);
                }
            }
        }
        public String Next
        {
            get
            {
                this.CheckBuffer();
                return this.buffer.Dequeue();
            }
        }
        public int NextInt
        {
            get
            {
                return int.Parse(this.Next);
            }
        }
        public double NextDouble
        {
            get
            {
                return double.Parse(this.Next);
            }
        }
        public long NextLong
        {
            get
            {
                return long.Parse(this.Next);
            }
        }
        public bool IsEmpty
        {
            get
            {
                this.CheckBuffer();
                return this.buffer.Count == 0;
            }
        }
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX