Submission #62539501

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <iostream>
#include <vector>
#include <map>
#include <iomanip>
using namespace std;
using ll = long long;
int main(){
    int N;
    cin >> N;
    // dice[i]の各数値の出現回数を格納
    vector<map<int, int>> dice(N);
    vector<int> K(N);
    
    for (int i = 0; i < N; i++){
        cin >> K[i];
        for (int j = 0; j < K[i]; j++){
            int x;
            cin >> x;
            dice[i][x]++;
        }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <iostream>
#include <vector>
#include <map>
#include <iomanip>
using namespace std;
using ll = long long;

int main(){
    int N;
    cin >> N;
    // dice[i]の各数値の出現回数を格納
    vector<map<int, int>> dice(N);
    vector<int> K(N);
    
    for (int i = 0; i < N; i++){
        cin >> K[i];
        for (int j = 0; j < K[i]; j++){
            int x;
            cin >> x;
            dice[i][x]++;
        }
    }
    
    double ans = 0;
    // 全ての組み合わせのサイコロ i, j について
    for (int i = 0; i < N; i++){
        for (int j = i+1; j < N; j++){
            double prob = 0;
            // dice[i] の全ての数値について、dice[j] にも現れるなら積を足す
            for (auto &p : dice[i]){
                int num = p.first;
                int cnt_i = p.second;
                if(dice[j].count(num)){
                    int cnt_j = dice[j][num];
                    prob += (double)cnt_i / K[i] * (double)cnt_j / K[j];
                }
            }
            if(prob > ans) ans = prob;
        }
    }
    
    cout << fixed << setprecision(9) << ans << endl;
    return 0;
}

Submission Info

Judge Result