結果

問題 No.302 サイコロで確率問題 (2)
ユーザー uwiuwi
提出日時 2015-11-13 23:42:29
言語 Java21
(openjdk 21)
結果
AC  
実行時間 297 ms / 6,000 ms
コード長 4,195 bytes
コンパイル時間 3,693 ms
コンパイル使用メモリ 80,176 KB
実行使用メモリ 55,844 KB
最終ジャッジ日時 2023-10-11 16:59:57
合計ジャッジ時間 8,142 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 214 ms
55,448 KB
testcase_01 AC 164 ms
55,440 KB
testcase_02 AC 164 ms
55,132 KB
testcase_03 AC 257 ms
55,164 KB
testcase_04 AC 170 ms
55,332 KB
testcase_05 AC 164 ms
55,336 KB
testcase_06 AC 163 ms
55,344 KB
testcase_07 AC 165 ms
55,080 KB
testcase_08 AC 264 ms
55,100 KB
testcase_09 AC 165 ms
55,424 KB
testcase_10 AC 115 ms
55,492 KB
testcase_11 AC 297 ms
55,348 KB
testcase_12 AC 115 ms
55,628 KB
testcase_13 AC 115 ms
55,280 KB
testcase_14 AC 116 ms
55,844 KB
testcase_15 AC 114 ms
55,536 KB
testcase_16 AC 114 ms
55,504 KB
testcase_17 AC 164 ms
55,688 KB
testcase_18 AC 115 ms
55,640 KB
testcase_19 AC 115 ms
55,512 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest;

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class Q190_2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		long n = nl(), L = Math.max(n, nl()), R = Math.min(6*n, nl());
		
		if(n <= 3000){
			if(L > Integer.MAX_VALUE / 3){
				out.printf("%.14f\n", 0.);
				return;
			}
			double[] dp = new double[20000];
			dp[0] = 1;
			for(int i = 0;i < n;i++){
				for(int j = 19999;j >= 0;j--){
					if(dp[j] > 0){
						for(int k = 1;k <= 6;k++){
							dp[j+k] += dp[j] / 6;
						}
						dp[j] = 0;
					}
				}
			}
			double ret = 0;
			for(int i = Math.max(0, (int)L);i <= R && i < 20000;i++){
				ret += dp[i];
			}
			out.printf("%.14f\n", ret);
		}else{
			double mu = 3.5*n;
			double sigma = 0;
			for(int i = 1;i <= 6;i++)sigma += (i-3.5)*(i-3.5);
			sigma /= 6;
			sigma = Math.sqrt(sigma*n);
//			tr(mu, sigma);
//			double all = (erf((6*n+0.5-mu)/Math.sqrt(2)/sigma) - erf((n-0.5-mu)/Math.sqrt(2)/sigma))/2;
//			all = 1;
			double sup = erf((R+0.5-mu)/Math.sqrt(2)/sigma);
			double inf = erf((L-0.5-mu)/Math.sqrt(2)/sigma);
			out.printf("%.14f\n", (sup-inf)/2/1);
		}
	}
	
	double erf(double x)
	{
		if(x < -50)return -1;
		if(x > 50)return 1;
		return 2./Math.sqrt(Math.PI)*simpson(0, x, 500000);
	}
	
	public static double simpson(double l, double r, int k)
	{
		double h = (r-l)/(2*k);
		double fo = 0, fe = 0;
		for(int i = 1;i <= 2*k-3;i+=2){
			fo += f(l+h*i);
			fe += f(l+h*(i+1));
		}
		return (f(l)+f(r)+4*(fo+f(r-h))+2*fe)*h/3;
	}
	
	public static double f(double x)
	{
		return Math.exp(-x*x);
	}

	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
	}
	
	public static void main(String[] args) throws Exception { new Q190_2().run(); }
	
	private byte[] inbuf = new byte[1024];
	private int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private char[][] nm(int n, int m)
	{
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private int ni()
	{
		int num = 0, b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0