結果

問題 No.302 サイコロで確率問題 (2)
ユーザー LayCurseLayCurse
提出日時 2015-05-25 19:22:02
言語 C++11
(gcc 11.4.0)
結果
AC  
実行時間 658 ms / 6,000 ms
コード長 3,226 bytes
コンパイル時間 2,738 ms
コンパイル使用メモリ 162,472 KB
実行使用メモリ 6,312 KB
最終ジャッジ日時 2023-10-19 08:22:01
合計ジャッジ時間 4,817 ms
ジャッジサーバーID
(参考情報)
judge15 / judge12
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 13 ms
5,900 KB
testcase_01 AC 241 ms
6,124 KB
testcase_02 AC 16 ms
6,028 KB
testcase_03 AC 22 ms
5,920 KB
testcase_04 AC 240 ms
6,120 KB
testcase_05 AC 16 ms
6,028 KB
testcase_06 AC 16 ms
6,028 KB
testcase_07 AC 16 ms
6,028 KB
testcase_08 AC 25 ms
5,928 KB
testcase_09 AC 16 ms
6,028 KB
testcase_10 AC 14 ms
6,076 KB
testcase_11 AC 33 ms
5,940 KB
testcase_12 AC 14 ms
6,076 KB
testcase_13 AC 14 ms
6,076 KB
testcase_14 AC 14 ms
6,076 KB
testcase_15 AC 14 ms
6,076 KB
testcase_16 AC 2 ms
5,852 KB
testcase_17 AC 658 ms
6,312 KB
testcase_18 AC 2 ms
5,844 KB
testcase_19 AC 2 ms
5,844 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘void reader(double*)’:
main.cpp:15:29: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   15 | void reader(double *x){scanf("%lf",x);}
      |                        ~~~~~^~~~~~~~~
main.cpp: In function ‘double solve1()’:
main.cpp:54:10: warning: ‘res’ may be used uninitialized in this function [-Wmaybe-uninitialized]
   54 |   return res;
      |          ^~~

ソースコード

diff #

#include<bits/stdc++.h>
using namespace std;

#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)

#define ll long long
#define ull unsigned ll

void reader(int *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
void reader(ll *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
void reader(double *x){scanf("%lf",x);}
int reader(char c[]){int i,s=0;for(;;){mygc(i);if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF) break;}c[s++]=i;for(;;){mygc(i);if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF) break;c[s++]=i;}c[s]='\0';return s;}
template <class T, class S> void reader(T *x, S *y){reader(x);reader(y);}
template <class T, class S, class U> void reader(T *x, S *y, U *z){reader(x);reader(y);reader(z);}
template <class T, class S, class U, class V> void reader(T *x, S *y, U *z, V *w){reader(x);reader(y);reader(z);reader(w);}

void writer(int x, char c){int s=0,m=0;char f[10];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(ll x, char c){int s=0,m=0;char f[20];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(double x, char c){printf("%.15f",x);mypc(c);}
void writer(const char c[]){int i;for(i=0;c[i]!='\0';i++)mypc(c[i]);}
void writer(const char x[], char c){int i;for(i=0;x[i]!='\0';i++)mypc(x[i]);mypc(c);}
template<class T> void writerLn(T x){writer(x,'\n');}
template<class T, class S> void writerLn(T x, S y){writer(x,' ');writer(y,'\n');}
template<class T, class S, class U> void writerLn(T x, S y, U z){writer(x,' ');writer(y,' ');writer(z,'\n');}
template<class T> void writerArr(T x[], int n){int i;if(!n){mypc('\n');return;}rep(i,n-1)writer(x[i],' ');writer(x[n-1],'\n');}

char memarr[17000000]; void *mem = memarr;
#define MD 1000000007

ll N, L, R;
double dp[100000], ss[100000];

double solve1(void){
  ll i, j, k;
  double res, divv = 1.0 / 6;

  rep(i,R+1) dp[i] = 0;
  rep(i,6*N+1) dp[i] = 0;
  dp[0] = 1;
  rep(k,N){
    ss[k] = 0;
    for(i=k;i<=6*(k+1);i++) ss[i+1] = ss[i] + dp[i]*divv;
    for(i=k;i<=6*(k+1);i++){
      dp[i] = ss[i];
      if(i-6 >= k) dp[i] -= ss[i-6];
    }
  }

  REP(i,L,R+1) res += dp[i];
  return res;
}

double solve3(void){
  int i, j, per = 1000000;
  double mean, sd, x, cons, pi = acos(0)*2;
  double lef, rig;
  double res = 0;

  mean = 3.5 * N;
  sd = sqrt(35/12.0 * N);

  lef = (L - 0.5 - mean) / sd;
  rig = (R + 0.5 - mean) / sd;

  cons = sqrt(2*pi);
  res += exp(-lef*lef/2);
  res += exp(-rig*rig/2);
  for(i=1;i<per;i++){
    x = ((per-i) * lef + i * rig) / per;
    if(i%2==1) res += 4 * exp(-x*x/2);
    else       res += 2 * exp(-x*x/2);
  }
  res /= cons;
  res *= (rig-lef)/3/per;

  return res;
}

int main(){
  int i, j, k;
  double res;

  reader(&N,&L,&R);
  L = max(N, L);
  R = min(6*N, R);

  if(N <= 10000) res = solve1();
  else           res = solve3();
  writerLn(res);

  return 0;
}
0