提出 #62535845

---

ソースコード 拡げる

/*
Author : Mikira
Sat 08 Feb 2025 08:17:59 PM HKT
*/

#include "bits/stdc++.h"
using namespace std;

typedef long long LL;
typedef vector<int> vi;
typedef vector<LL> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> PII;
typedef pair<int, int> pii;
typedef pair<LL, LL> PLL;
typedef pair<LL, LL> pll;
typedef long double ld;

#define rep(i, a, b) for(int i = a; i < int(b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define popf pop_front
#define pf push_front
#define popb pop_back
#define pb push_back
#define fi first
#define se second

const double EPS = 1e-9;
const int INFMEM = 63;

// Do dir^1 to get reverse direction
const int dx[8] = {0, 0, 1, -1, 1, -1, 1, -1};
const int dy[8] = {1, -1, 0, 0, 1, -1, -1, 1};
const char dch[4] = {'R', 'L', 'D', 'U'};

// Do (dir + 2)%4 to get reverse direction
// const int dx[8] = {-1,0,1,0,-1,1,1,-1};
// const int dy[8] = {0,1,0,-1,1,1,-1,-1};
// const char dch[4] = {'U','R','D','L'};
const double PI = 3.141592653589793;

inline void fasterios() {
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
}
#define endl '\n'
const int MOD = 1000000007;
// const int MOD = 998244353;
typedef __int128 BigNum;
BigNum labs(BigNum a) {
  return a < 0 ? -a : a;
}
struct Fraction {
  BigNum a, b;
  Fraction(BigNum _a = 0, BigNum _b = 1) {
    a = _a;
    b = _b;
    assert(b);
    LL curgcd = __gcd(labs(a), labs(b));
    a /= curgcd;
    b /= curgcd;
    if (b < 0) a = -a, b = -b;
  }
  bool operator ==(const Fraction &other) const {
    return a == other.a && b == other.b;
  }
  bool operator <(const Fraction &other) const {
    return a * other.b < b * other.a;
  }
  Fraction operator +(const Fraction &other) const {
    return Fraction(a * other.b + b * other.a, other.b * b);
  }
  Fraction operator -() const {
    return Fraction(-a, b);
  }
  Fraction operator -(const Fraction &other) const {
    return Fraction(a * other.b - b * other.a, other.b * b);
  }
  Fraction operator *(const Fraction &other) const {
    return Fraction(a * other.a, other.b * b);
  }
  Fraction operator /(const Fraction &other) const {
    return Fraction(a * other.b, b * other.a);
  }
  Fraction max(const Fraction &other) const {
    if (*this < other) return other;
    return *this;
  }
  Fraction min(const Fraction &other) const {
    if (*this < other) return *this;
    return other;
  }
  double val() {
    assert(b);
    return (double)a / b;
  }
  friend istream& operator>>(istream& is, Fraction &p) {
    LL tmp;
    is >> tmp;
    p = Fraction(tmp);
    return is;
  }
  friend ostream& operator<<(ostream& os, Fraction p) {
    return os << "(" << (LL)p.a << "/" << (LL)p.b << ")";
  }
};
// Don't forget to read all the inputs before returning!!!
const int kMaxFace = 1e5;
int solve() {
  int n; cin >> n;
  vector <map<LL, LL>> faces(n);
  vector <LL> diceSize(n);
  vector <int> perm(n);
  iota(all(perm), 0);
  for (int i = 0; i < n; i++) {
    int k; cin >> k;
    diceSize[i] = k;
    rep(j, 0, k) {
      int cur; cin >> cur;
      faces[i][cur]++;
    }
  }
  sort(all(perm), [&](const int &a, const int &b) {
    return faces[a].size() < faces[b].size();
  });
  Fraction ans = 0;
  rep(ii, 0, n) {
    int i = perm[ii];
    rep(jj, ii + 1, n) {
      int j = perm[jj];
      Fraction currentAns = 0;
      trav(cur, faces[i]) {
        if (!faces[j].count(cur.fi)) continue;
        currentAns = currentAns + Fraction(faces[j][cur.fi], diceSize[j]) * Fraction(cur.se, diceSize[i]);
      }
      ans = max(currentAns, ans);
    }
  }
  cout << fixed << setprecision(15) << ans.val() << endl;
  return 0;
}

int main() {
  fasterios();
  solve();
}

提出情報

ジャッジ結果