Submission #1000826
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()
#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))
// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD
// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;
int p[6],q[6];
double a[6],b[6];
double calc(double s){
double t = 1.0-s;
double ret = 0.0;
REP(i,6){
double sp = s*a[i];
double tq = t*b[i];
if(sp>=tq){
// called p
ret += tq;
}else{
ret += sp;
}
}
return ret;
}
int main(){
REP(i,6)scanf("%d",p+i);
REP(i,6)scanf("%d",q+i);
REP(i,6)a[i]=(double)p[i]/100.0;
REP(i,6)b[i]=(double)q[i]/100.0;
double low = 0.0, high = 1.0;
REP(_,1000){
double midl = (low*2.0+high)/3.0;
double midr = (low+high*2.0)/3.0;
if(calc(midl)>calc(midr)){
high = midr;
}else{
low = midl;
}
}
printf("%.12lf\n",1.0 - calc(low));
return 0;
}
Submission Info
Submission Time
2016-11-28 13:13:05+0900
Task
D - Dice Game
User
rickytheta
Language
C++14 (GCC 5.4.1)
Score
1000
Code Size
1569 Byte
Status
AC
Exec Time
3 ms
Memory
384 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:54:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
REP(i,6)scanf("%d",p+i);
^
./Main.cpp:55:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
REP(i,6)scanf("%d",q+i);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
1000 / 1000
Status
Set Name
Test Cases
Sample
example0.txt, example1.txt
All
000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, 020.txt, 021.txt, 022.txt, 023.txt, 024.txt, 025.txt, 026.txt, 027.txt, 028.txt, 029.txt, 030.txt, 031.txt, 032.txt, 033.txt, 034.txt, 035.txt, 036.txt, 037.txt, 038.txt, example0.txt, example1.txt
Case Name
Status
Exec Time
Memory
000.txt
AC
3 ms
256 KB
001.txt
AC
3 ms
256 KB
002.txt
AC
3 ms
256 KB
003.txt
AC
2 ms
256 KB
004.txt
AC
3 ms
256 KB
005.txt
AC
3 ms
256 KB
006.txt
AC
3 ms
256 KB
007.txt
AC
3 ms
256 KB
008.txt
AC
3 ms
256 KB
009.txt
AC
2 ms
256 KB
010.txt
AC
2 ms
256 KB
011.txt
AC
3 ms
256 KB
012.txt
AC
3 ms
256 KB
013.txt
AC
3 ms
256 KB
014.txt
AC
3 ms
256 KB
015.txt
AC
3 ms
256 KB
016.txt
AC
2 ms
256 KB
017.txt
AC
3 ms
256 KB
018.txt
AC
3 ms
256 KB
019.txt
AC
2 ms
256 KB
020.txt
AC
3 ms
256 KB
021.txt
AC
3 ms
384 KB
022.txt
AC
3 ms
256 KB
023.txt
AC
3 ms
256 KB
024.txt
AC
3 ms
256 KB
025.txt
AC
3 ms
256 KB
026.txt
AC
3 ms
256 KB
027.txt
AC
3 ms
256 KB
028.txt
AC
3 ms
256 KB
029.txt
AC
3 ms
256 KB
030.txt
AC
3 ms
256 KB
031.txt
AC
3 ms
256 KB
032.txt
AC
3 ms
256 KB
033.txt
AC
3 ms
256 KB
034.txt
AC
3 ms
256 KB
035.txt
AC
3 ms
256 KB
036.txt
AC
3 ms
256 KB
037.txt
AC
3 ms
256 KB
038.txt
AC
3 ms
256 KB
example0.txt
AC
3 ms
256 KB
example1.txt
AC
3 ms
256 KB