Submission #18982374


Source Code Expand

Copy
//Let's join Kaede Takagaki Fan Club !!
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
#define all(x) x.begin(),x.end()
template<class T>
void dmp(T a){
	rep(i,a.size()) cout << a[i] << " ";
	cout << endl;
}
template<class T>
bool chmax(T&a, T b){
	if(a < b){
		a = b;
		return 1;
	}
	return 0;
}
template<class T>
bool chmin(T&a, T b){
	if(a > b){
		a = b;
		return 1;
	}
	return 0;
}
template<class T>
void g(T &a){
	cin >> a;
}
template<class T>
void o(const T &a,bool space=false){
	cout << a << (space?' ':'\n');
}
//ios::sync_with_stdio(false);
const ll mod = 1000000007;//998244353
template<class T>
void add(T&a,T b){
	a+=b;
	if(a >= mod) a-=mod;
}
typedef long double ld;

int main(){
	ios::sync_with_stdio(false);
	int a[6], b[6];
	rep(i, 6) cin >> a[i];
	rep(i, 6) cin >> b[i];
	ld ans = 1.0L;
	rep(i, 6) {
		ld v = (ld)(b[i]) / (ld)(a[i] + b[i]), cur = 0;
		rep(j, 6){
			cur += max(v * (ld)(a[j]), (ld)(b[j]) * (1.0L-v));
		}
		chmin(ans, cur/100.);
	}
	printf("%.12Lf\n", ans);
}

Submission Info

Submission Time
Task D - Dice Game
User IH19980412
Language C++ (GCC 9.2.1)
Score 0
Code Size 1744 Byte
Status WA
Exec Time 8 ms
Memory 3760 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1000
Status
AC × 2
AC × 33
WA × 8
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 WA 5 ms 3672 KB
001.txt AC 2 ms 3580 KB
002.txt AC 2 ms 3584 KB
003.txt AC 2 ms 3736 KB
004.txt WA 3 ms 3616 KB
005.txt WA 2 ms 3628 KB
006.txt WA 2 ms 3672 KB
007.txt AC 1 ms 3548 KB
008.txt WA 4 ms 3752 KB
009.txt AC 3 ms 3628 KB
010.txt AC 2 ms 3760 KB
011.txt WA 2 ms 3528 KB
012.txt AC 1 ms 3736 KB
013.txt AC 2 ms 3532 KB
014.txt WA 2 ms 3620 KB
015.txt AC 2 ms 3620 KB
016.txt AC 2 ms 3620 KB
017.txt AC 2 ms 3636 KB
018.txt AC 3 ms 3680 KB
019.txt AC 4 ms 3628 KB
020.txt WA 2 ms 3624 KB
021.txt AC 2 ms 3736 KB
022.txt AC 2 ms 3532 KB
023.txt AC 8 ms 3532 KB
024.txt AC 2 ms 3624 KB
025.txt AC 2 ms 3528 KB
026.txt AC 2 ms 3544 KB
027.txt AC 3 ms 3628 KB
028.txt AC 3 ms 3532 KB
029.txt AC 2 ms 3628 KB
030.txt AC 2 ms 3732 KB
031.txt AC 2 ms 3544 KB
032.txt AC 2 ms 3624 KB
033.txt AC 2 ms 3736 KB
034.txt AC 3 ms 3664 KB
035.txt AC 2 ms 3532 KB
036.txt AC 2 ms 3532 KB
037.txt AC 3 ms 3532 KB
038.txt AC 2 ms 3628 KB
example0.txt AC 2 ms 3580 KB
example1.txt AC 4 ms 3736 KB