Submission #62544120

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
public class Main{
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        
        int N = sc.nextInt();
        List<Map<Integer, Double>> dice = new ArrayList<>();
        
        for (int i = 0; i < N; i++) {
            int K = sc.nextInt();
            Map<Integer, Double> probMap = new HashMap<>();
            
            for (int j = 0; j < K; j++) {
                int face = sc.nextInt();
                probMap.put(face, probMap.getOrDefault(face, 0.0) + 1.0 / K);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Scanner;

public class Main{

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        
        int N = sc.nextInt();
        List<Map<Integer, Double>> dice = new ArrayList<>();
        
        for (int i = 0; i < N; i++) {
            int K = sc.nextInt();
            Map<Integer, Double> probMap = new HashMap<>();
            
            for (int j = 0; j < K; j++) {
                int face = sc.nextInt();
                probMap.put(face, probMap.getOrDefault(face, 0.0) + 1.0 / K);
            }
            
            dice.add(probMap);
        }
        
        double maxProbability = 0.0;
        
        // Brute-force over all pairs of dice
        for (int i = 0; i < N; i++) {
            for (int j = i + 1; j < N; j++) {
                double currentProbability = 0.0;
                
                for (int num : dice.get(i).keySet()) {
                    if (dice.get(j).containsKey(num)) {
                        currentProbability += dice.get(i).get(num) * dice.get(j).get(num);
                    }
                }
                
                maxProbability = Math.max(maxProbability, currentProbability);
            }
        }
        
        System.out.printf("%.15f\n", maxProbability);
    }
}

Submission Info

Judge Result