提出 #75448208

---

ソースコード 拡げる

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

// --- Type Definitions ---
using ll = long long;
using db = long double; 
using str = string;

// --- PBDS Ordered Multiset ---
using ordered_set = tree<pair<ll, int>, null_type, less<pair<ll, int>>, rb_tree_tag, tree_order_statistics_node_update>;

// --- Vectors & Pairs ---
using pi = pair<int,int>;
using pl = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;

// --- Shortcuts ---
#define mp make_pair
#define f first
#define s second
#define pb push_back
#define eb emplace_back 
#define all(x) begin(x), end(x)
#define sor(x) sort(all(x))
#define rsz resize
#define sz(x) int((x).size())

// --- Loops ---
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define each(a,x) for (auto& a: x)

// --- Input/Output Optimization ---
void setIO(string name = "") {
    cin.tie(0)->sync_with_stdio(0);
    if (sz(name)) {
        freopen((name + ".in").c_str(), "r", stdin); 
        freopen((name + ".out").c_str(), "w", stdout);
    }
    cout << fixed << setprecision(15);
}

// --- Constant ---
const ll MOD = 1e9+7;
const int INF = 1e9;  

int main() {
    setIO(); 

    int C[3][7] = {0};

    F0R(i, 3) {
        F0R(j, 6) {
            int x; cin >> x;
            if (x >= 4 && x <= 6) {
                C[i][x]++;
            }
        }
    }

    vi p = {4, 5, 6};
    ll ways = 0;
    do {
        ways += C[0][p[0]] * C[1][p[1]] * C[2][p[2]];
    } while (next_permutation(all(p)));

    cout << (db)ways / 216.0 << "\n";

    return 0;
}

提出情報

ジャッジ結果