結果

問題 No.108 トリプルカードコンプ
ユーザー OlandOland
提出日時 2019-10-29 20:57:00
言語 Java21
(openjdk 21)
結果
AC  
実行時間 85 ms / 5,000 ms
コード長 6,506 bytes
コンパイル時間 4,173 ms
コンパイル使用メモリ 82,684 KB
実行使用メモリ 61,920 KB
最終ジャッジ日時 2023-10-12 23:30:40
合計ジャッジ時間 6,763 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 54 ms
50,508 KB
testcase_01 AC 53 ms
50,136 KB
testcase_02 AC 54 ms
50,252 KB
testcase_03 AC 53 ms
50,232 KB
testcase_04 AC 53 ms
50,440 KB
testcase_05 AC 53 ms
50,196 KB
testcase_06 AC 53 ms
50,204 KB
testcase_07 AC 82 ms
61,248 KB
testcase_08 AC 83 ms
61,324 KB
testcase_09 AC 82 ms
61,920 KB
testcase_10 AC 82 ms
61,468 KB
testcase_11 AC 85 ms
61,300 KB
testcase_12 AC 54 ms
50,132 KB
testcase_13 AC 69 ms
52,724 KB
testcase_14 AC 59 ms
48,556 KB
testcase_15 AC 68 ms
52,716 KB
testcase_16 AC 70 ms
52,684 KB
testcase_17 AC 60 ms
50,656 KB
testcase_18 AC 81 ms
61,516 KB
testcase_19 AC 79 ms
57,128 KB
testcase_20 AC 81 ms
61,648 KB
testcase_21 AC 82 ms
61,232 KB
testcase_22 AC 80 ms
61,748 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;

@SuppressWarnings("unused")
public class Main implements Runnable{
    private FastScanner in;
    private PrintWriter out;
    final int MOD = (int)1e9+7;
    long ceil(long a, long b){return (a + b - 1) / b;}
    long gcd(long a, long b){return b == 0 ? a : gcd(b, a % b);}
    long lcm(long a, long b){return a / gcd(a, b) * b; /*オーバーフローに注意*/}

    private void solve() {
        int N = in.nextInt();
        int[] num = new int[4];
        for(int i = 0; i < N; i++) num[Math.min(3, in.nextInt())]++;

        //0,1,2
        double[][][] dp = new double[N+1][N+1][N+1];
        //dp[0][0][0] = 0.0;
        for(int i = 0; i <= N; i++){
            for(int j = 0; j <= N; j++){
                for(int k = 0; k <= N; k++){
                    if(i == 0 && j == 0 && k == 0) continue;
                    if((i + j + k) > N) continue;
                    double e = 0;
                    if(i > 0) e += (dp[i-1][j+1][k] + 1) * i / N;
                    if(j > 0) e += (dp[i][j-1][k+1] + 1) * j / N;
                    if(k > 0) e += (dp[i  ][j][k-1] + 1) * k / N;
                    int m = N - i - j - k;
                    if(m != 0){
                        e += (double)m / N;
                        e *= (double)N / (N - m);
                    }
                    dp[i][j][k] = e;
                }
            }
        }
        out.println(dp[num[0]][num[1]][num[2]]);
    }
    //end solve

    public static void main(String[] args) {
        Thread.setDefaultUncaughtExceptionHandler((t,e)->System.exit(1));
        new Thread(null, new Main(), "", 16L * 1024 * 1024).start();
    }

    public void run() {
        in = new FastScanner(System.in);
        out = new PrintWriter(System.out);
        solve();
        out.flush();
    }

    static class FastScanner {
        Reader input;

        FastScanner() {this(System.in);}
        FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}

        int nextInt() {return (int) nextLong();}

        long nextLong() {
            try {
                int sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                long ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) return ret * sign;
                    ret *= 10;
                    ret += b - '0';
                }
            } catch (IOException e) {
                e.printStackTrace();
                return -1;
            }
        }

        double nextDouble() {
            try {
                double sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                double ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) break;
                    ret *= 10;
                    ret += b - '0';
                }
                if (b != '.') return sign * ret;
                double div = 1;
                b = input.read();
                while ('0' <= b && b <= '9') {
                    ret *= 10;
                    ret += b - '0';
                    div *= 10;
                    b = input.read();
                }
                return sign * ret / div;
            } catch (IOException e) {
                e.printStackTrace();
                return Double.NaN;
            }
        }

        char nextChar() {
            try {
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                return (char) b;
            } catch (IOException e) {
                e.printStackTrace();
                return 0;
            }
        }

        String nextStr() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                while (b != -1 && !Character.isWhitespace(b)) {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }

        public int[] nextIntArray(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt();
            }
            return res;
        }

        public int[] nextIntArrayDec(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt() - 1;
            }
            return res;
        }

        public int[] nextIntArray1Index(int n) {
            int[] res = new int[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextInt();
            }
            return res;
        }

        public long[] nextLongArray(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong();
            }
            return res;
        }

        public long[] nextLongArrayDec(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong() - 1;
            }
            return res;
        }

        public long[] nextLongArray1Index(int n) {
            long[] res = new long[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextLong();
            }
            return res;
        }

        public double[] nextDoubleArray(int n) {
            double[] res = new double[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextDouble();
            }
            return res;
        }
    }
}
0