Submission #1000735
Source Code Expand
#include <cstdio> #include <iostream> #include <cstring> #include <algorithm> #include <cmath> #include <vector> #include <map> #include <set> #include <string> #include <cstdlib> #include <ctime> #include <deque> using namespace std; #define eta 0.01 #define eps 1e-6 double p[10], q[10]; double ans; double F(double x) { double ans = 0; for (int i = 1; i <= 6; i++) if (x * p[i] > (1 - x) * q[i]) ans += x * p[i]; else ans += (1-x) * q[i]; return ans; } void try1(double x) { ans = min(ans, F(x)); } int main() { for (int i = 1; i <= 6; i++) scanf("%lf", &p[i]), p[i] /= 100; for (int i = 1; i <=6; i++) scanf("%lf", &q[i]), q[i] /= 100; ans = 1; try1(0); try1(1); for (int i = 1; i <= 6; i++) if (p[i] + q[i] > 0) try1(q[i] / (p[i] + q[i])); printf("%.10lf\n", ans); }
Submission Info
Submission Time | |
---|---|
Task | D - Dice Game |
User | xyz111 |
Language | C++14 (GCC 5.4.1) |
Score | 1000 |
Code Size | 852 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 384 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:36:35: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%lf", &p[i]), p[i] /= 100; ^ ./Main.cpp:38:35: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%lf", &q[i]), q[i] /= 100; ^
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 | 2 ms | 256 KB |
001.txt | AC | 2 ms | 256 KB |
002.txt | AC | 2 ms | 256 KB |
003.txt | AC | 2 ms | 256 KB |
004.txt | AC | 2 ms | 256 KB |
005.txt | AC | 2 ms | 256 KB |
006.txt | AC | 2 ms | 256 KB |
007.txt | AC | 2 ms | 256 KB |
008.txt | AC | 2 ms | 256 KB |
009.txt | AC | 2 ms | 256 KB |
010.txt | AC | 2 ms | 256 KB |
011.txt | AC | 2 ms | 256 KB |
012.txt | AC | 2 ms | 256 KB |
013.txt | AC | 2 ms | 384 KB |
014.txt | AC | 2 ms | 256 KB |
015.txt | AC | 2 ms | 256 KB |
016.txt | AC | 2 ms | 256 KB |
017.txt | AC | 2 ms | 256 KB |
018.txt | AC | 2 ms | 256 KB |
019.txt | AC | 2 ms | 256 KB |
020.txt | AC | 2 ms | 256 KB |
021.txt | AC | 2 ms | 256 KB |
022.txt | AC | 2 ms | 256 KB |
023.txt | AC | 2 ms | 256 KB |
024.txt | AC | 2 ms | 256 KB |
025.txt | AC | 2 ms | 256 KB |
026.txt | AC | 2 ms | 256 KB |
027.txt | AC | 2 ms | 256 KB |
028.txt | AC | 2 ms | 256 KB |
029.txt | AC | 2 ms | 256 KB |
030.txt | AC | 2 ms | 256 KB |
031.txt | AC | 2 ms | 256 KB |
032.txt | AC | 2 ms | 256 KB |
033.txt | AC | 2 ms | 256 KB |
034.txt | AC | 2 ms | 256 KB |
035.txt | AC | 2 ms | 256 KB |
036.txt | AC | 2 ms | 256 KB |
037.txt | AC | 2 ms | 256 KB |
038.txt | AC | 2 ms | 256 KB |
example0.txt | AC | 2 ms | 256 KB |
example1.txt | AC | 2 ms | 256 KB |