#409091 (C++17) No.133 カードゲーム

• 問題: No.133 カードゲーム
• ユーザー: f1b_maxbl00d
• 提出日時: 2019-12-16 05:57:40
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 3 ms / 5,000 ms
• コード長: 1,529 bytes
• コンパイル時間: 1,602 ms
• コンパイル使用メモリ: 125,592 KB
• 最終ジャッジ日時: 2025-01-08 11:45:15
• ジャッジサーバーID （参考情報）: judge3 / judge5

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

ソースコード

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
#include <iostream>
#include <vector>
#include <limits.h>
#include <algorithm>
#include <string>
#include <math.h>
#include <limits.h>
#include <queue>
#include <map>
#include <set>
#include <iomanip>
#include <bitset>
#include <cassert>
#include <random>
#include <functional>
#include <stack>
#include <iomanip>
#include <cassert>
//#include <boost/multiprecision/cpp_int.hpp>
#include <complex>
#include <cstdio>
#include <list>
#include <bitset>
//< in.txt > out.txt
using namespace std;
//std::ios::sync_with_stdio(false);
//std::cin.tie(0);
const long long MOD = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ld, ll> pdl;
typedef pair<ld, ld> pdd;
typedef vector<ll> VLL;
typedef vector<VLL> VVLL;
//typedef boost::multiprecision::cpp_int bigint;
int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    ll N;
    cin >> N;
    VLL A(N);
    VLL B(N);
    for (ll n = 0; n < N; n++)cin >> A[n];
    for (ll n = 0; n < N; n++)cin >> B[n];
    VLL VA(N);
    for (ll n = 0; n < N; n++)VA[n] = n;
    ll ans = 0;
    do {
        VLL VB(N);
        for (ll n = 0; n < N; n++)VB[n] = n;
        do {
            ll a = 0;
            ll b = 0;
            for (ll n = 0; n < N; n++) {
                if (A[VA[n]] > B[VB[n]])a++;
                else if (A[VA[n]] < B[VB[n]])b++;
                else {
                    a++;
                    b++;
                }
            }
            if (a > b)ans++;
        } while (next_permutation(VB.begin(), VB.end()));
    } while (next_permutation(VA.begin(), VA.end()));
    ll M = 1;
    for (ll n = N; n >= 1; n--)M *= n;
    M *= M;
    cout << setprecision(12) << (ld)ans / M << "\n";
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX