Submission #1000736
Source Code Expand
#include <cstdio> #include <algorithm> using namespace std; const double eps = 1e-9; const int N = 6; double P[N], Q[N]; double A[2][1 << N]; double V[1 << N]; int main() { for (int i = 0; i < 6; i++) { scanf("%lf", &P[i]); P[i] /= 100.0; } for (int i = 0; i < 6; i++) { scanf("%lf", &Q[i]); Q[i] /= 100.0; } for (int msk = 0; msk < (1 << N); msk++) { for (int i = 0; i < 2; i++) { for (int j = 0; j < N; j++) { double p = (i ? P : Q)[j]; bool success = i == ((msk >> j) & 1); A[i][msk] += p * success; } } } /*for (int i = 0; i < 2; i++) { for (int j = 0; j < (1 << N); j++) { printf("%.2lf ", A[i][j]); } printf("\n"); } for (double al = 0; al <= 1.0; al += 0.0001) { for (int i = 0; i < (1 << N); i++) { V[i] = al * A[0][i] + (1 - al) * A[1][i]; } double mx = 0; mx = *min_element(V, V + (1 << N)); printf("%.10lf\n", mx); }*/ double l = 0, r = 1; for (int it = 0; it < 100; it++) { double a = 0, b = 1; double x = (l + r) / 2.0; for (int i = 0; i < (1 << N); i++) { double u = A[0][i], v = A[1][i]; if (u > v + eps) { a = max(a, (x - v) / (u - v)); } else if (v > u + eps) { b = min(b, (x - v) / (u - v)); } else { if (u < x) a = 42; } } if (a < b) l = x; else r = x; } printf("%.10lf\n", 1 - (l + r) / 2.0); }
Submission Info
Submission Time | |
---|---|
Task | D - Dice Game |
User | Zlobober |
Language | C++14 (GCC 5.4.1) |
Score | 1000 |
Code Size | 1751 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 128 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:16:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%lf", &P[i]); ^ ./Main.cpp:20:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%lf", &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 | 1 ms | 128 KB |
001.txt | AC | 1 ms | 128 KB |
002.txt | AC | 1 ms | 128 KB |
003.txt | AC | 1 ms | 128 KB |
004.txt | AC | 1 ms | 128 KB |
005.txt | AC | 1 ms | 128 KB |
006.txt | AC | 1 ms | 128 KB |
007.txt | AC | 1 ms | 128 KB |
008.txt | AC | 1 ms | 128 KB |
009.txt | AC | 1 ms | 128 KB |
010.txt | AC | 1 ms | 128 KB |
011.txt | AC | 1 ms | 128 KB |
012.txt | AC | 1 ms | 128 KB |
013.txt | AC | 1 ms | 128 KB |
014.txt | AC | 1 ms | 128 KB |
015.txt | AC | 1 ms | 128 KB |
016.txt | AC | 1 ms | 128 KB |
017.txt | AC | 1 ms | 128 KB |
018.txt | AC | 1 ms | 128 KB |
019.txt | AC | 1 ms | 128 KB |
020.txt | AC | 1 ms | 128 KB |
021.txt | AC | 1 ms | 128 KB |
022.txt | AC | 1 ms | 128 KB |
023.txt | AC | 1 ms | 128 KB |
024.txt | AC | 1 ms | 128 KB |
025.txt | AC | 1 ms | 128 KB |
026.txt | AC | 1 ms | 128 KB |
027.txt | AC | 1 ms | 128 KB |
028.txt | AC | 1 ms | 128 KB |
029.txt | AC | 1 ms | 128 KB |
030.txt | AC | 1 ms | 128 KB |
031.txt | AC | 1 ms | 128 KB |
032.txt | AC | 1 ms | 128 KB |
033.txt | AC | 1 ms | 128 KB |
034.txt | AC | 1 ms | 128 KB |
035.txt | AC | 1 ms | 128 KB |
036.txt | AC | 1 ms | 128 KB |
037.txt | AC | 1 ms | 128 KB |
038.txt | AC | 1 ms | 128 KB |
example0.txt | AC | 1 ms | 128 KB |
example1.txt | AC | 1 ms | 128 KB |