結果

問題 No.108 トリプルカードコンプ
ユーザー k-6101k-6101
提出日時 2021-10-30 12:24:05
言語 Java21
(openjdk 21)
結果
AC  
実行時間 178 ms / 5,000 ms
コード長 4,670 bytes
コンパイル時間 2,727 ms
コンパイル使用メモリ 83,332 KB
実行使用メモリ 52,428 KB
最終ジャッジ日時 2024-04-16 16:15:56
合計ジャッジ時間 6,941 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 120 ms
41,144 KB
testcase_01 AC 119 ms
40,936 KB
testcase_02 AC 122 ms
41,092 KB
testcase_03 AC 111 ms
40,256 KB
testcase_04 AC 123 ms
41,140 KB
testcase_05 AC 123 ms
40,980 KB
testcase_06 AC 122 ms
40,912 KB
testcase_07 AC 178 ms
52,016 KB
testcase_08 AC 156 ms
52,304 KB
testcase_09 AC 145 ms
52,052 KB
testcase_10 AC 141 ms
52,236 KB
testcase_11 AC 143 ms
51,984 KB
testcase_12 AC 120 ms
41,188 KB
testcase_13 AC 139 ms
42,064 KB
testcase_14 AC 128 ms
42,064 KB
testcase_15 AC 127 ms
41,992 KB
testcase_16 AC 141 ms
41,852 KB
testcase_17 AC 125 ms
41,888 KB
testcase_18 AC 169 ms
52,196 KB
testcase_19 AC 158 ms
52,428 KB
testcase_20 AC 158 ms
52,252 KB
testcase_21 AC 165 ms
52,232 KB
testcase_22 AC 158 ms
52,028 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.net.ConnectException;
import java.rmi.dgc.Lease;
import java.text.NumberFormat;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.BitSet;
import java.util.Collections;
import java.util.Comparator;
import java.util.Deque;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.NoSuchElementException;
import java.util.Objects;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Random;
import java.util.Set;
import java.util.Stack;
import java.util.TreeMap;
import java.util.TreeSet;
import java.util.concurrent.ThreadLocalRandom;

import static java.util.Comparator.*;

public class Main {
	public static void main(String[] args) {
		Main main = new Main();
		main.solve();
		main.out.close();
	}
	// =====================================================================
	static long INF = (long)(1e15)+10;
	NumberFormat nf = NumberFormat.getNumberInstance();
	ThreadLocalRandom rand = ThreadLocalRandom.current();
	static int MOD = (int)(1e9) + 7;
	int N;
	int[] A, Z = new int[3];
	double[][][] dp;
	double calc(int c0, int c1, int c2) {
		if(c0 == 0 && c1 == 0 && c2 == 0)	return 0;
		if(dp[c0][c1][c2] != -1)			return dp[c0][c1][c2];
		double ans = 0;
		int sum = c0 + c1 + c2;
		if(c0 > 0)	ans += (calc(c0-1, c1+1, c2) + (double)N / sum) * c0 / sum;
		if(c1 > 0)	ans += (calc(c0, c1-1, c2+1) + (double)N / sum) * c1 / sum;
		if(c2 > 0)	ans += (calc(c0, c1, c2-1) + (double)N / sum) * c2 / sum;
		return dp[c0][c1][c2] = ans;
	}
	public void solve() {
		N = ni();
		A = new int[N];
		for (int i = 0; i < N; i++) {
			A[i] = ni();
			if(A[i] < 3)	Z[A[i]]++;
		}
		dp = new double[N+1][N+1][N+1];
		for (int i = 0; i <= N; i++) {
			for (int j = 0; j <= N; j++) {
				Arrays.fill(dp[i][j], -1);
			}
		}
		out.println(calc(Z[0],Z[1],Z[2]));
	}
	
	// ------------------------------------------
	// Print
	private PrintWriter out = new PrintWriter(System.out);
	
	// Scanner
	private FastScanner scan = new FastScanner();
	int ni(){ return scan.nextInt();}
	int[] ni(int n){int[] a = new int[n]; for(int i = 0; i < n; i++){a[i] = ni();} return a;}
	int[][] ni(int y, int x){int[][] a = new int[y][x];
	for(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = ni();}} return a;}
	long nl(){return scan.nextLong();}
	long[] nl(int n){long[] a = new long[n]; for(int i = 0; i < n; i++){a[i] = nl();} return a;}
	long[][] nl(int y, int x){long[][] a = new long[y][x];
	for(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = nl();}} return a;}
	String ns(){return scan.next();}
	String[] ns(int n){String[] a = new String[n]; for(int i = 0; i < n; i++){a[i] = ns();} return a;}
	String[][] ns(int y, int x){String[][] a = new String[y][x];
		for(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = ns();}} return a;}
	double nd() { return scan.nextDouble(); }
}
class FastScanner {
	private final InputStream in = System.in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;
	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		}else{
			ptr = 0;
			try {
				buflen = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen <= 0) {
				return false;
			}
		}
		return true;
	}
	private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
	private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
	public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
	public String next() {
		if (!hasNext()) throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public long nextLong() {
		if (!hasNext()) throw new NoSuchElementException();
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while(true){
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			}else if(b == -1 || !isPrintableChar(b)){
				return minus ? -n : n;
			}else{
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}
	public int nextInt() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
		return (int) nl;
	}
	public double nextDouble() { return Double.parseDouble(next());}
}
0