Submission #18982062


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];
	vector<int>vec; rep(i, 6) vec.pb(i);
	sort(vec.begin(), vec.end(), [&](int c, int d){
		//a[c] / b[c] > a[d] / b[d]
		return 1LL * a[c] * b[d] > 1LL * a[d] * b[c];
	});
	ld lb = 0.0, ub = 1.0;
	rep(q, 114514){
		ld mid = (lb+ub)/2;
		ld up = mid, dw = 1.0-up;
		
		rep(ii, 6){
			int i = vec[ii];
			if(up >= (ld)(a[i])/100.0L){
				up -= (ld)(a[i])/100.0L;
				dw -= (ld)(b[i])/100.0L;
			}
			else if(a[i]){
				dw -= up * (ld)(b[i]) / (ld)(a[i]);
				break;
			}
			else break;
		}
		if(dw >= 0.0) lb = mid; else ub = mid;
	}
	printf("%.12Lf\n", lb);
}

Submission Info

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

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1000
Status
AC × 2
AC × 36
WA × 5
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 10 ms 3572 KB
001.txt WA 6 ms 3704 KB
002.txt AC 5 ms 3756 KB
003.txt AC 6 ms 3572 KB
004.txt WA 9 ms 3688 KB
005.txt AC 5 ms 3692 KB
006.txt AC 5 ms 3620 KB
007.txt AC 5 ms 3764 KB
008.txt AC 5 ms 3584 KB
009.txt AC 6 ms 3760 KB
010.txt AC 6 ms 3620 KB
011.txt AC 8 ms 3760 KB
012.txt AC 5 ms 3764 KB
013.txt AC 13 ms 3604 KB
014.txt AC 6 ms 3708 KB
015.txt WA 6 ms 3760 KB
016.txt WA 5 ms 3644 KB
017.txt AC 8 ms 3620 KB
018.txt AC 10 ms 3500 KB
019.txt WA 5 ms 3492 KB
020.txt AC 6 ms 3604 KB
021.txt AC 8 ms 3708 KB
022.txt AC 4 ms 3756 KB
023.txt AC 7 ms 3708 KB
024.txt AC 5 ms 3604 KB
025.txt AC 13 ms 3668 KB
026.txt AC 6 ms 3760 KB
027.txt AC 12 ms 3704 KB
028.txt AC 6 ms 3568 KB
029.txt AC 5 ms 3496 KB
030.txt AC 9 ms 3624 KB
031.txt AC 5 ms 3572 KB
032.txt AC 5 ms 3692 KB
033.txt AC 10 ms 3496 KB
034.txt AC 6 ms 3760 KB
035.txt AC 5 ms 3688 KB
036.txt AC 6 ms 3696 KB
037.txt AC 6 ms 3692 KB
038.txt AC 6 ms 3772 KB
example0.txt AC 8 ms 3700 KB
example1.txt AC 7 ms 3572 KB